Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels
From MaRDI portal
Abstract: 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.
Cited in
(10)- Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis
- Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages
- Constructing Coset Codes With Optimal Same-Symbol Weight for Detecting Narrowband Interference in M-FSK Systems
- On lattice constructions D and D^ from q-ary linear codes
- Well-rounded ideal lattices of cyclic cubic and quartic fields
- Euclidean lattices: theory and applications
- A design criterion for the Rayleigh fading wiretap channel based on ^1-norm theta functions
- Well-rounded lattices from odd prime degree number fields in the ramified case
- Dense generic well-rounded lattices
- On lattices generated by algebraic conjugates of prime degree
This page was built for publication: Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001747)
