default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalle Ranto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j8]Roope Vehkalahti
, Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto:
On the densest MIMO lattices from cyclic division algebras. IEEE Trans. Inf. Theory 55(8): 3751-3780 (2009)- 2008
- [j7]Marko J. Moisio, Kalle Ranto:
Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed. Finite Fields Their Appl. 14(3): 798-815 (2008) - [c6]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti, Emanuele Viterbo:
On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code. ITW 2008: 91-94 - 2007
- [j6]Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
3-Designs from all Z4-Goethals-like codes with block size 7 and 8. Finite Fields Their Appl. 13(4): 815-827 (2007) - [j5]Marko J. Moisio, Kalle Ranto:
Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros. Finite Fields Their Appl. 13(4): 922-935 (2007) - [c5]Camilla Hollanti, Kalle Ranto:
On MIDO Space-Time Block Codes. ISIT 2007: 1631-1635 - [c4]Camilla Hollanti, Kalle Ranto:
Asymmetric Space-Time Block Codes for MIMO Systems. ITW 2007: 1-5 - [i1]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
On the densest MIMO lattices from cyclic division algebras. CoRR abs/cs/0703052 (2007) - 2006
- [j4]Kalle Ranto, Petri Rosendahl:
On Four-Valued Niho-Type Cross-Correlation Functions of m-Sequences. IEEE Trans. Inf. Theory 52(12): 5533-5536 (2006) - [c3]Kalle Ranto, Petri Rosendahl:
The Solutions of the Third Power Sum Equation for Niho Type Decimations. AAECC 2006: 101-107 - [c2]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
Optimal Matrix Lattices for MIMO Codes from Division Algebras. ISIT 2006: 783-787 - 2005
- [c1]Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
3-Designs from Z4-Goethals-Like Codes and Variants of Cyclotomic Polynomials. WCC 2005: 55-68 - 2004
- [j3]Tor Helleseth, Jyrki T. Lahtonen, Kalle Ranto:
A simple proof to the minimum distance of Z4-linear Goethals-like codes. J. Complex. 20(2-3): 297-304 (2004) - 2002
- [j2]Kalle Ranto:
Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8. SIAM J. Discret. Math. 15(3): 289-304 (2002) - 2000
- [j1]Kalle Ranto:
On algebraic decoding of the Z4-linear Goethals-like codes. IEEE Trans. Inf. Theory 46(6): 2193-2197 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
