Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels

Mohamed Taoufiq Damir, Alex Karrila, Laia Amoros, Oliver W. Gnilke, David Karpuk, Camilla Hollanti

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)


The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage and error probability are controlled by the average flatness factor of the eavesdropper's lattice, which we further interpret geometrically. It is concluded that the minimization of the (average) flatness factor of the eavesdropper's lattice leads to the study of well-rounded lattices, which are shown to be among the optimal in order to achieve these minima. Constructions of some well-rounded lattices are also provided.
Original languageEnglish
Article number9354828
Pages (from-to)3645-3663
JournalIEEE Transactions on Information Theory
Issue number6
Publication statusPublished - Jun 2021
MoE publication typeA1 Journal article-refereed


  • Fading channels
  • Error probability
  • Lattices
  • Minimization
  • Decoding
  • MIMO communication
  • Coset codes
  • flatness factor
  • information theoretic security
  • lattices
  • multiple-input multiple-output (MIMO) channels
  • number fields
  • physical layer security
  • Rayleigh fast-fading channels
  • single-input single-output (SISO) channels
  • well-rounded lattices
  • wiretap channels


Dive into the research topics of 'Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels'. Together they form a unique fingerprint.

Cite this