עקוב אחר
Roope Vehkalahti
Roope Vehkalahti
University of Jyväskylä
כתובת אימייל מאומתת בדומיין utu.fi
כותרת
צוטט על ידי
צוטט על ידי
שנה
On the densest MIMO lattices from cyclic division algebras
R Vehkalahti, C Hollanti, J Lahtonen, K Ranto
IEEE Transactions on Information Theory 55 (8), 3751-3780, 2009
1002009
Fast-decodable asymmetric space-time codes from division algebras
R Vehkalahti, C Hollanti, F Oggier
IEEE Transactions on Information Theory 58 (4), 2362-2385, 2011
592011
On the algebraic structure of the silver code: a 2× 2 perfect space-time block code
C Hollanti, J Lahtonen, K Ranto, R Vehkalahti, E Viterbo
2008 IEEE Information Theory Workshop, 91-94, 2008
522008
New space–time code constructions for two-user multiple access channels
H Lu, R Vehkalahti, C Hollanti, J Lahtonen, Y Hong, E Viterbo
IEEE Journal of Selected Topics in Signal Processing 3 (6), 939-957, 2009
332009
Fast-decodable MIDO codes from crossed product algebras
F Oggier, R Vehkalahti, C Hollanti
2010 IEEE International Symposium on Information Theory, 1080-1084, 2010
242010
Inverse determinant sums and connections between fading channel information theory and algebra
R Vehkalahti, HF Lu, L Luzzi
IEEE transactions on information theory 59 (9), 6060-6082, 2013
212013
DMT optimal codes constructions for multiple-access MIMO channel
H Lu, CJ Hollanti, RI Vehkalahti, J Lahtonen
IEEE transactions on information theory 57 (6), 3594-3617, 2011
192011
An algebraic MIDO-MISO code construction
F Oggier, C Hollanti, R Vehkalahti
2010 International Conference on Signal Processing and Communications (SPCOM …, 2010
182010
Almost universal codes achieving ergodic MIMO capacity within a constant gap
L Luzzi, R Vehkalahti
IEEE Transactions on Information Theory 63 (5), 3224-3241, 2017
162017
Non-commutative ring learning with errors from cyclic algebras
C Grover, A Mendelsohn, C Ling, R Vehkalahti
Journal of Cryptology 35 (3), 22, 2022
152022
Almost universal codes for fading wiretap channels
L Luzzi, C Ling, R Vehkalahti
2016 IEEE International Symposium on Information Theory (ISIT), 3082-3086, 2016
152016
Optimal matrix lattices for MIMO codes from division algebras
C Hollanti, J Lahtonen, K Ranto, R Vehkalahti
2006 IEEE International Symposium on Information Theory, 783-787, 2006
152006
Remarks on the criteria of constructing MIMO-MAC DMT optimal codes
H Lu, J Lahtonen, R Vehkalahti, C Hollanti
2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo …, 2010
132010
Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap
R Vehkalahti, L Luzzi
2015 IEEE International Symposium on Information Theory (ISIT), 436-440, 2015
112015
Reducing complexity with less than minimum delay space-time lattice codes
R Vehkalahti, C Hollanti
2011 IEEE Information Theory Workshop, 130-134, 2011
112011
Dense MIMO matrix lattices—A meeting point for class field theory and invariant theory
J Lahtonen, R Vehkalahti
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 17th …, 2007
102007
Grant-free access in URLLC with combinatorial codes and interference cancellation
C Boyd, R Vehkalahti, O Tirkkonen
2018 IEEE Globecom Workshops (GC Wkshps), 1-5, 2018
92018
Interference cancelling codes for ultra-reliable random access
C Boyd, R Vehkalahti, O Tirkkonen
International Journal of Wireless Information Networks 25, 422-433, 2018
82018
On the decay of the determinants of multiuser MIMO lattice codes
J Lahtonen, R Vehkalahti, H Lu, C Hollanti, E Viterbo
2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo …, 2010
82010
Almost universal codes for MIMO wiretap channels
L Luzzi, R Vehkalahti, C Ling
IEEE Transactions on Information Theory 64 (11), 7218-7241, 2018
72018
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20