Roope Vehkalahti

IEEE Trans. Inf. Theory, 2022

Non-commutative Ring Learning with Errors from Cyclic Algebras.

[BibT_eX]

[DOI]

J. Cryptol., 2022

Deterministic Patterns for Multiple Access in Latency-Constrained Ultra-Reliable Communications.

[BibT_eX]

[DOI]

CoRR, 2022

Secret Keys from Parity Bits in the Satellite Setting.

[BibT_eX]

[DOI]

Jari Lietzén

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Towards Ultra-Reliable Signature Coding With Multiple Transmit Antennas.

[BibT_eX]

[DOI]

Tefjol Pllaha

Proceedings of the 93rd IEEE Vehicular Technology Conference, 2021

CSI Quantization for FDD Massive MIMO Communication.

[BibT_eX]

[DOI]

Proceedings of the 93rd IEEE Vehicular Technology Conference, 2021

Signature Code Design for Fast Fading Channels.

[BibT_eX]

[DOI]

Tefjol Pllaha

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Non-Commutative Ring Learning With Errors From Cyclic Algebras.

[BibT_eX]

[DOI]

Charles Grover

Cong Ling

CoRR, 2020

A Two-way QKD Protocol Outperforming One-way Protocols at Low QBER.

[BibT_eX]

[DOI]

Jari Lietzén

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Code Design Principles for Ultra-Reliable Random Access with Preassigned Patterns.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Almost Universal Codes for MIMO Wiretap Channels.

[BibT_eX]

[DOI]

Cong Ling

IEEE Trans. Inf. Theory, 2018

Interference Cancelling Codes for Ultra-Reliable Random Access.

[BibT_eX]

[DOI]

Int. J. Wirel. Inf. Networks, 2018

The DMT Classification of Real and Quaternionic Lattice Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Grant-Free Access in URLLC with Combinatorial Codes and Interference Cancellation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom Workshops, 2018

2017

Almost Universal Codes Achieving Ergodic MIMO Capacity Within a Constant Gap.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Algebraic lattice codes for linear fading channels.

[BibT_eX]

[DOI]

CoRR, 2017

Combinatorial code designs for ultra-reliable IoT random access.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE Annual International Symposium on Personal, 2017

Grassmannian codes from multiple families of mutually unbiased bases.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Towards a complete DMT classification of division algebra codes.

[BibT_eX]

[DOI]

Alexander Gorodnik

Proceedings of the IEEE International Symposium on Information Theory, 2016

Almost universal codes for fading wiretap channels.

[BibT_eX]

[DOI]

Cong Ling

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

A Noncommutative Analogue of the Odlyzko Bounds and Bounds on Performance for Space-Time Lattice Codes.

[BibT_eX]

[DOI]

Benjamin Linowitz

Matthew Satriano

IEEE Trans. Inf. Theory, 2015

An Error Event Sensitive Tradeoff Between Rate and Coding Gain in MIMO MAC.

[BibT_eX]

[DOI]

Toni Ernvall

Hsiao-feng Francis Lu

IEEE Trans. Inf. Theory, 2015

Estimates for the growth of inverse determinant sums of quasi-orthogonal and number field lattices.

[BibT_eX]

[DOI]

CoRR, 2015

Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Division algebra codes achieve MIMO block fading channel capacity within a constant gap.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

A non-commutative analogue of the Odlyzko bounds and bounds on performance for space-time lattice codes.

[BibT_eX]

[DOI]

Benjamin Linowitz

Matthew Satriano

CoRR, 2014

Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes.

[BibT_eX]

[DOI]

Jean-Claude Belfiore

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Constructions a of lattices from number fields and division algebras.

[BibT_eX]

[DOI]

Wittawat Kositwattanarerk

Frédérique E. Oggier

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra.

[BibT_eX]

[DOI]

Hsiao-feng Francis Lu

IEEE Trans. Inf. Theory, 2013

Remarks on criteria for achieving the optimal diversity-multiplexing gain trade-off.

[BibT_eX]

[DOI]

CoRR, 2013

An error event sensitive trade-off between rate and coding gain in MIMO MAC.

[BibT_eX]

[DOI]

CoRR, 2013

A new design criterion for spherically-shaped division algebra-based space-time codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

2012

Fast-Decodable Asymmetric Space-Time Codes From Division Algebras.

[BibT_eX]

[DOI]

Frédérique E. Oggier

IEEE Trans. Inf. Theory, 2012

Connecting DMT of division algebra space-time codes and point counting in Lie groups.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Construction of MIMO MAC codes achieving the pigeon hole bound.

[BibT_eX]

[DOI]

Toni Ernvall

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

DMT Optimal Codes Constructions for Multiple-Access MIMO Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra

[BibT_eX]

[DOI]

Hsiao-feng Lu

CoRR, 2011

Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN.

[BibT_eX]

[DOI]

Youssef Nasser

Proceedings of the IEEE Workshop on Signal Processing Systems, 2011

Diversity-multiplexing gain tradeoff: A tool in algebra?

[BibT_eX]

[DOI]

Hsiao-feng Francis Lu

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Reducing complexity with less than minimum delay space-time lattice codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

An algebraic look into MAC-DMT of lattice space-time codes.

[BibT_eX]

[DOI]

Hsiao-feng Lu

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

A general framework for constructing fast-decodable asymmetric space-time codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

The coding gain of real matrix lattices: bounds and existence results.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Some simple observations on MISO codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2010

A family of cyclic division algebra based fast-decodable 4×2 space-time block codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2010

Fast-decodable MIDO codes from crossed product algebras.

[BibT_eX]

[DOI]

Frédérique E. Oggier

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

On the densest MIMO lattices from cyclic division algebras.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

New Space-Time Code Constructions for Two-User Multiple Access Channels.

[BibT_eX]

[DOI]

IEEE J. Sel. Top. Signal Process., 2009

Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes

[BibT_eX]

[DOI]

CoRR, 2009

On the Decay of the Determinants of Multiuser MIMO Lattice Codes

[BibT_eX]

[DOI]

CoRR, 2009

Some properties of Alamouti-like MISO codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

An algebraic tool for obtaining conditional non-vanishing determinants.

[BibT_eX]

[DOI]

Hsiao-feng Lu

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007

3-Designs from all Z<sub>4</sub>-Goethals-like codes with block size 7 and 8.

[BibT_eX]

[DOI]

Kalle Ranto

Finite Fields Their Appl., 2007

Constructing Optimal Division Algebras for Space-Time Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007

Dense MIMO Matrix Lattices - A Meeting Point for Class Field Theory and Invariant Theory.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2007

2006

Optimal Matrix Lattices for MIMO Codes from Division Algebras.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

3-Designs from Z<sub>4</sub>-Goethals-Like Codes and Variants of Cyclotomic Polynomials.

[BibT_eX]

[DOI]

Kalle Ranto