default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJyrki T. Lahtonen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j19]Toni Ernvall, Jyrki T. Lahtonen, Hsiao-feng Francis Lu, Roope Vehkalahti
:
An Error Event Sensitive Tradeoff Between Rate and Coding Gain in MIMO MAC. IEEE Trans. Inf. Theory 61(11): 5931-5947 (2015)- 2013
- [i5]Toni Ernvall, Jyrki T. Lahtonen, Hsiao-feng Lu, Roope Vehkalahti:
An error event sensitive trade-off between rate and coding gain in MIMO MAC. CoRR abs/1312.4692 (2013) - 2012
- [j18]Jyrki T. Lahtonen, Jonghoon Ryu, Eeva Suvitie:
On the Degree of the Inverse of Quadratic Permutation Polynomial Interleavers. IEEE Trans. Inf. Theory 58(6): 3925-3932 (2012) - 2011
- [j17]Hsiao-feng Lu, Camilla Hollanti, Roope Vehkalahti, Jyrki T. Lahtonen:
DMT Optimal Codes Constructions for Multiple-Access MIMO Channel. IEEE Trans. Inf. Theory 57(6): 3594-3617 (2011) - 2010
- [c13]Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen:
A family of cyclic division algebra based fast-decodable 4×2 space-time block codes. ISITA 2010: 42-47 - [c12]Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Some simple observations on MISO codes. ISITA 2010: 537-541 - [c11]Eeva Suvitie, Jyrki T. Lahtonen:
On the degree of the inverse of quadratic permutation polynomial interleavers. ITW 2010: 1-5
2000 – 2009
- 2009
- [j16]Hsiao-feng Lu, Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Yi Hong, Emanuele Viterbo:
New Space-Time Code Constructions for Two-User Multiple Access Channels. IEEE J. Sel. Top. Signal Process. 3(6): 939-957 (2009) - [j15]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) - [i4]Jyrki T. Lahtonen, Roope Vehkalahti, Hsiao-feng Lu, Camilla Hollanti, Emanuele Viterbo:
On the Decay of the Determinants of Multiuser MIMO Lattice Codes. CoRR abs/0908.2505 (2009) - [i3]Hsiao-feng Lu, Jyrki T. Lahtonen, Roope Vehkalahti, Camilla Hollanti:
Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes. CoRR abs/0908.3166 (2009) - 2008
- [j14]Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Maximal Orders in the Design of Dense Space-Time Lattice Codes. IEEE Trans. Inf. Theory 54(10): 4493-4510 (2008) - [j13]Jyrki T. Lahtonen, Nadya Markin, Gary McGuire:
Construction of Multiblock Space-Time Codes From Division Algebras With Roots of Unity as Nonnorm Elements. IEEE Trans. Inf. Theory 54(11): 5231-5235 (2008) - [c10]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 - [i2]Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Maximal Orders in the Design of Dense Space-Time Lattice Codes. CoRR abs/0803.2639 (2008) - 2007
- [j12]Jyrki T. Lahtonen, Gary McGuire, Harold N. Ward:
Gold and Kasami-Welch functions, quadratic forms, and bent functions. Adv. Math. Commun. 1(2): 243-250 (2007) - [j11]Tor Helleseth, Jyrki T. Lahtonen, Petri Rosendahl:
On Niho type cross-correlation functions of m-sequences. Finite Fields Their Appl. 13(2): 305-317 (2007) - [j10]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) - [c9]Jyrki T. Lahtonen, Roope Vehkalahti:
Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory. AAECC 2007: 247-256 - [c8]Jyrki T. Lahtonen:
Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction. 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
- [c7]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
Optimal Matrix Lattices for MIMO Codes from Division Algebras. ISIT 2006: 783-787 - [c6]Camilla Hollanti, Jyrki T. Lahtonen:
A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras. ITW 2006: 322-326 - 2005
- [c5]Jarkko Hiltunen, Camilla Hollanti, Jyrki T. Lahtonen:
Dense full-diversity matrix lattices for four transmit antenna MISO channel. ISIT 2005: 1290-1294 - [c4]Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
3-Designs from Z4-Goethals-Like Codes and Variants of Cyclotomic Polynomials. WCC 2005: 55-68 - 2004
- [j9]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) - [j8]Jyrki T. Lahtonen, San Ling, Patrick Solé, Dmitrii Zinoviev:
Z8-Kerdock codes and pseudorandom binary sequences. J. Complex. 20(2-3): 318-330 (2004) - [c3]Mika Hirvensalo, Jyrki T. Lahtonen:
On Self-Dual Bases of the Extensions of the Binary Field. Theory Is Forever 2004: 102-111 - [c2]Jarkko Hiltunen, Jyrki T. Lahtonen, Anu Nikkanen:
On the BCJR-like Trellis for space-time group codes. ISIT 2004: 158 - [c1]Jarkko Hiltunen, Camilla Hollanti, Jyrki T. Lahtonen:
Four antenna space-time lattice constellations from division algebras. ISIT 2004: 338
1990 – 1999
- 1999
- [j7]Chunming Rong, Tor Helleseth, Jyrki T. Lahtonen:
On algebraic decoding of the Z4-linear Calderbank-McGuire code. IEEE Trans. Inf. Theory 45(5): 1423-1434 (1999) - 1998
- [j6]Xiang-dong Hou, Jyrki T. Lahtonen, Sami Koponen:
The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2. IEEE Trans. Inf. Theory 44(2): 798-799 (1998) - 1997
- [j5]Sami Koponen, Jyrki T. Lahtonen:
On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences. IEEE Trans. Inf. Theory 43(5): 1593-1596 (1997) - 1996
- [j4]Thomas Mittelholzer, Jyrki T. Lahtonen:
Group codes generated by finite reflection groups. IEEE Trans. Inf. Theory 42(2): 519-528 (1996) - 1995
- [j3]Jyrki T. Lahtonen:
Two remarks on a paper by Moreno and Kumar [binary Reed-Muller codes]. IEEE Trans. Inf. Theory 41(3): 859-861 (1995) - [j2]Jyrki T. Lahtonen:
On the odd and the aperiodic correlation properties of the Kasami sequences. IEEE Trans. Inf. Theory 41(5): 1506-1508 (1995) - 1992
- [j1]Jyrki T. Lahtonen:
An optimal polynomial for a covering radius problem. Discret. Math. 105(1-3): 313-317 (1992)
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:
