Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels
| Autor: | Alex Karrila, David Karpuk, Oliver W. Gnilke, Mohamed Taoufiq Damir, Laia Amorós, Camilla Hollanti |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
well-rounded lattices Computer Science - Information Theory High Energy Physics::Lattice Gaussian Flatness (systems theory) 02 engineering and technology Library and Information Sciences number fields multiple-input multiple-output (MIMO) channels symbols.namesake Lattice (order) 0202 electrical engineering electronic engineering information engineering information theoretic security Fading Computer Science::Cryptography and Security Computer Science::Information Theory Mathematics Discrete mathematics Coset codes Information Theory (cs.IT) flatness factor physical layer security wiretap channels 020206 networking & telecommunications Rayleigh fast-fading channels Computer Science Applications Maxima and minima lattices single-input single-output (SISO) channels Information leakage symbols Coset Decoding methods Information Systems |
| Zdroj: | Damir, M T, Karrila, A, Amoros, L, Gnilke, O, Karpuk, D & Hollanti, C 2021, ' Well-Rounded Lattices : Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels ', IEEE Transactions on Information Theory, vol. 67, no. 6, 9354828, pp. 3645-3663 . https://doi.org/10.1109/TIT.2021.3059749 |
| ISSN: | 1557-9654 0018-9448 |
| DOI: | 10.1109/tit.2021.3059749 |
| Popis: | 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. Partial results were published in ITW'16 (arXiv:1605.00419), ITNAC'16 (arXiv:1609.07666, arXiv:1606.06099), and SPAWC'18 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|