default search action
Roope Vehkalahti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Jialing Liao, Roope Vehkalahti, Tefjol Pllaha, Wei Han, Olav Tirkkonen:
Modular CSI Quantization for FDD Massive MIMO Communication. IEEE Trans. Wirel. Commun. 22(12): 8543-8558 (2023) - [i29]Jialing Liao, Roope Vehkalahti, Tefjol Pllaha, Wei Han, Olav Tirkkonen:
Modular CSI Quantization for FDD Massive MIMO Communication. CoRR abs/2303.13264 (2023) - 2022
- [j14]Charles Grover, Andrew Mendelsohn, Cong Ling, Roope Vehkalahti:
Non-commutative Ring Learning with Errors from Cyclic Algebras. J. Cryptol. 35(3): 22 (2022) - [j13]Roope Vehkalahti, Laura Luzzi:
The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes. IEEE Trans. Inf. Theory 68(5): 2999-3013 (2022) - [c34]Jari Lietzén, Olav Tirkkonen, Roope Vehkalahti:
Secret Keys from Parity Bits in the Satellite Setting. ISIT 2022: 2672-2677 - [i28]Radoslaw Kotaba, Roope Vehkalahti, Cedomir Stefanovic, Olav Tirkkonen, Petar Popovski:
Deterministic Patterns for Multiple Access in Latency-Constrained Ultra-Reliable Communications. CoRR abs/2202.09890 (2022) - 2021
- [c33]Roope Vehkalahti, Tefjol Pllaha, Olav Tirkkonen:
Signature Code Design for Fast Fading Channels. ISIT 2021: 2936-2941 - [c32]Roope Vehkalahti, Jialing Liao, Tefjol Pllaha, Wei Han, Olav Tirkkonen:
CSI Quantization for FDD Massive MIMO Communication. VTC Spring 2021: 1-5 - [c31]Roope Vehkalahti, Tefjol Pllaha, Olav Tirkkonen:
Towards Ultra-Reliable Signature Coding With Multiple Transmit Antennas. VTC Spring 2021: 1-5 - [i27]Roope Vehkalahti, Laura Luzzi:
The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes. CoRR abs/2102.09910 (2021) - 2020
- [c30]Jari Lietzén, Roope Vehkalahti, Olav Tirkkonen:
A Two-way QKD Protocol Outperforming One-way Protocols at Low QBER. ISIT 2020: 1106-1111 - [i26]Charles Grover, Cong Ling, Roope Vehkalahti:
Non-Commutative Ring Learning With Errors From Cyclic Algebras. CoRR abs/2008.01834 (2020)
2010 – 2019
- 2019
- [c29]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen, Antti Laaksonen:
Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns. ISIT 2019: 2604-2608 - [i25]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen, Antti Laaksonen:
Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns. CoRR abs/1905.02761 (2019) - [i24]Laura Luzzi, Roope Vehkalahti, Cong Ling:
Almost universal codes for MIMO wiretap channels. IACR Cryptol. ePrint Arch. 2019: 1171 (2019) - 2018
- [j12]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen:
Interference Cancelling Codes for Ultra-Reliable Random Access. Int. J. Wirel. Inf. Networks 25(4): 422-433 (2018) - [j11]Laura Luzzi, Roope Vehkalahti, Cong Ling:
Almost Universal Codes for MIMO Wiretap Channels. IEEE Trans. Inf. Theory 64(11): 7218-7241 (2018) - [c28]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen:
Grant-Free Access in URLLC with Combinatorial Codes and Interference Cancellation. GLOBECOM Workshops 2018: 1-5 - [c27]Laura Luzzi, Roope Vehkalahti:
The DMT Classification of Real and Quaternionic Lattice Codes. ISIT 2018: 1026-1030 - [i23]Laura Luzzi, Roope Vehkalahti:
The DMT classification of real and quaternionic lattice codes. CoRR abs/1801.02913 (2018) - 2017
- [j10]Laura Luzzi, Roope Vehkalahti:
Almost Universal Codes Achieving Ergodic MIMO Capacity Within a Constant Gap. IEEE Trans. Inf. Theory 63(5): 3224-3241 (2017) - [c26]Olav Tirkkonen, Christopher Boyd, Roope Vehkalahti:
Grassmannian codes from multiple families of mutually unbiased bases. ISIT 2017: 789-793 - [c25]Christopher Boyd, Roope Vehkalahti, Olav Tirkkonen:
Combinatorial code designs for ultra-reliable IoT random access. PIMRC 2017: 1-5 - [i22]Laura Luzzi, Roope Vehkalahti:
Algebraic lattice codes for linear fading channels. CoRR abs/1712.07182 (2017) - 2016
- [c24]Laura Luzzi, Roope Vehkalahti, Alexander Gorodnik:
Towards a complete DMT classification of division algebra codes. ISIT 2016: 2993-2997 - [c23]Laura Luzzi, Cong Ling, Roope Vehkalahti:
Almost universal codes for fading wiretap channels. ISIT 2016: 3082-3086 - [i21]Laura Luzzi, Cong Ling, Roope Vehkalahti:
Almost universal codes for fading wiretap channels. CoRR abs/1601.02391 (2016) - [i20]Laura Luzzi, Roope Vehkalahti, Cong Ling:
Almost universal codes for MIMO wiretap channels. CoRR abs/1611.01428 (2016) - 2015
- [j9]Benjamin Linowitz, Matthew Satriano, Roope Vehkalahti:
A Noncommutative Analogue of the Odlyzko Bounds and Bounds on Performance for Space-Time Lattice Codes. IEEE Trans. Inf. Theory 61(4): 1971-1984 (2015) - [j8]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) - [c22]Roope Vehkalahti, Laura Luzzi:
Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap. ISIT 2015: 436-440 - [c21]Laura Luzzi, Roope Vehkalahti:
Division algebra codes achieve MIMO block fading channel capacity within a constant gap. ISIT 2015: 446-450 - [i19]Roope Vehkalahti, Laura Luzzi:
Estimates for the growth of inverse determinant sums of quasi-orthogonal and number field lattices. CoRR abs/1501.01773 (2015) - [i18]Laura Luzzi, Roope Vehkalahti:
Almost universal codes achieving ergodic MIMO capacity within a constant gap. CoRR abs/1507.07395 (2015) - [i17]Laura Luzzi, Roope Vehkalahti, Alexander Gorodnik:
Towards a complete DMT classification of division algebra codes. CoRR abs/1509.08254 (2015) - 2014
- [c20]Roope Vehkalahti, Wittawat Kositwattanarerk, Frédérique E. Oggier:
Constructions a of lattices from number fields and division algebras. ISIT 2014: 2326-2330 - [c19]Roope Vehkalahti, Laura Luzzi, Jean-Claude Belfiore:
Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes. ISIT 2014: 2331-2335 - [i16]Roope Vehkalahti, Laura Luzzi, Jean-Claude Belfiore:
Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes. CoRR abs/1408.1506 (2014) - [i15]Benjamin Linowitz, Matthew Satriano, Roope Vehkalahti:
A non-commutative analogue of the Odlyzko bounds and bounds on performance for space-time lattice codes. CoRR abs/1408.4630 (2014) - [i14]Roope Vehkalahti, Laura Luzzi:
Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap. CoRR abs/1411.4591 (2014) - [i13]Laura Luzzi, Roope Vehkalahti:
Division algebra codes achieve MIMO block fading channel capacity within a constant gap. CoRR abs/1412.7650 (2014) - 2013
- [j7]Roope Vehkalahti, Hsiao-feng Francis Lu, Laura Luzzi:
Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra. IEEE Trans. Inf. Theory 59(9): 6060-6082 (2013) - [c18]Laura Luzzi, Roope Vehkalahti:
A new design criterion for spherically-shaped division algebra-based space-time codes. ITW 2013: 1-5 - [i12]Roope Vehkalahti:
Remarks on criteria for achieving the optimal diversity-multiplexing gain trade-off. CoRR abs/1308.3985 (2013) - [i11]Laura Luzzi, Roope Vehkalahti:
A new design criterion for spherically-shaped division algebra-based space-time codes. CoRR abs/1309.3901 (2013) - [i10]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
- [j6]Roope Vehkalahti, Camilla Hollanti, Frédérique E. Oggier:
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras. IEEE Trans. Inf. Theory 58(4): 2362-2385 (2012) - [c17]Toni Ernvall, Roope Vehkalahti:
Construction of MIMO MAC codes achieving the pigeon hole bound. ISIT 2012: 21-25 - [c16]Roope Vehkalahti, Laura Luzzi:
Connecting DMT of division algebra space-time codes and point counting in Lie groups. ISIT 2012: 3038-3042 - [i9]Toni Ernvall, Roope Vehkalahti:
Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound. CoRR abs/1202.0675 (2012) - 2011
- [j5]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) - [c15]Roope Vehkalahti, Camilla Hollanti:
A general framework for constructing fast-decodable asymmetric space-time codes. ISIT 2011: 2821-2825 - [c14]Roope Vehkalahti, Hsiao-feng Lu:
An algebraic look into MAC-DMT of lattice space-time codes. ISIT 2011: 2831-2835 - [c13]Roope Vehkalahti, Camilla Hollanti:
Reducing complexity with less than minimum delay space-time lattice codes. ITW 2011: 130-134 - [c12]Roope Vehkalahti, Hsiao-feng Francis Lu:
Diversity-multiplexing gain tradeoff: A tool in algebra? ITW 2011: 135-139 - [c11]Camilla Hollanti, Roope Vehkalahti, Youssef Nasser:
Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN. SiPS 2011: 234-238 - [i8]Camilla Hollanti, Roope Vehkalahti, Youssef Nasser:
Algebraic Hybrid Satellite-Terrestrial Space-Time Codes for Digital Broadcasting in SFN. CoRR abs/1103.0484 (2011) - [i7]Roope Vehkalahti, Hsiao-feng Lu:
An algebraic look into MAC-DMT of lattice space-time codes. CoRR abs/1105.2114 (2011) - [i6]Roope Vehkalahti, Hsiao-feng Lu:
Diversity-multiplexing Gain Tradeoff: a Tool in Algebra? CoRR abs/1105.3569 (2011) - [i5]Roope Vehkalahti, Hsiao-feng Lu:
Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra. CoRR abs/1111.6289 (2011) - 2010
- [j4]Roope Vehkalahti:
The coding gain of real matrix lattices: bounds and existence results. IEEE Trans. Inf. Theory 56(9): 4359-4366 (2010) - [c10]Frédérique E. Oggier, Roope Vehkalahti, Camilla Hollanti:
Fast-decodable MIDO codes from crossed product algebras. ISIT 2010: 1080-1084 - [c9]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 - [c8]Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Some simple observations on MISO codes. ISITA 2010: 537-541 - [i4]Roope Vehkalahti, Camilla Hollanti, Frédérique E. Oggier:
Fast-Decodable Asymmetric Space-Time Codes from Division Algebras. CoRR abs/1010.5644 (2010)
2000 – 2009
- 2009
- [j3]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) - [j2]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) - [c7]Roope Vehkalahti:
Some properties of Alamouti-like MISO codes. ISIT 2009: 914-918 - [c6]Camilla Hollanti, Roope Vehkalahti, Hsiao-feng Lu:
An algebraic tool for obtaining conditional non-vanishing determinants. ISIT 2009: 1388-1392 - [i3]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) - [i2]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
- [c5]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
- [j1]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) - [c4]Jyrki T. Lahtonen, Roope Vehkalahti:
Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory. AAECC 2007: 247-256 - [c3]Roope Vehkalahti:
Constructing Optimal Division Algebras for Space-Time Coding. 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
- [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
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 2025-01-09 12:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint