Roope Vehkalahti
Roope Vehkalahti
University of Jyväskylä
Dirección de correo verificada de utu.fi
Título
Citado por
Citado por
Año
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
922009
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
552011
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
502008
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
302009
Fast-decodable MIDO codes from crossed product algebras
F Oggier, R Vehkalahti, C Hollanti
2010 IEEE International Symposium on Information Theory, 1080-1084, 2010
232010
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
202013
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
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
172017
An algebraic MIDO-MISO code construction
F Oggier, C Hollanti, R Vehkalahti
2010 International Conference on Signal Processing and Communications (SPCOM …, 2010
152010
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
Almost universal codes for fading wiretap channels
L Luzzi, C Ling, R Vehkalahti
2016 IEEE International Symposium on Information Theory (ISIT), 3082-3086, 2016
142016
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
132015
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
112010
Dense MIMO matrix lattices—A meeting point for class field theory and invariant theory
J Lahtonen, R Vehkalahti
International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 2007
102007
Reducing complexity with less than minimum delay space-time lattice codes
R Vehkalahti, C Hollanti
2011 IEEE Information Theory Workshop, 130-134, 2011
92011
Class field theoretic methods in the design of lattice signal constellations
R Vehkalahti
TUCS Dissertations No 100, 2008
72008
Interference cancelling codes for ultra-reliable random access
C Boyd, R Vehkalahti, O Tirkkonen
International Journal of Wireless Information Networks 25 (4), 422-433, 2018
62018
Diversity-multiplexing gain tradeoff: A tool in algebra?
R Vehkalahti, H Lu
2011 IEEE Information Theory Workshop, 135-139, 2011
62011
An algebraic look into MAC-DMT of lattice space-time codes
R Vehkalahti, H Lu
2011 IEEE International Symposium on Information Theory Proceedings, 2831-2835, 2011
62011
DMT optimal code constructions for multiuser MIMO channel
HF Lu, C Hollanti, R Vehkalahti, J Lahtonen
IEEE Trans. Inf. Theory 57 (6), 2011
62011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20