2016/06/20 by Amaro Barreal, Barreal, Amaro, Alex Karrila +4
Computer Science · #Coding theory and cryptography #Cooperative Communication and Network Coding #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1606.06099
openalex publication_date 2016/06/20 · openalex created_date 2018/03/29 · openalex updated_date 2026/07/28
In this article, the design of secure lattice coset codes for general\nwireless channels with fading and Gaussian noise is studied. Recalling the\neavesdropper's probability and information bounds, a variant of the latter is\ngiven from which it is explicitly seen that both quantities are upper bounded\nby (increasing functions of) the expected flatness factor of the faded lattice\nrelated to the eavesdropper.\n By making use of a recently developed approximation of the theta series of a\nlattice, it is further shown how the average flatness factor can be\napproximated numerically. In particular, based on the numerical computations,\nthe average flatness factor not only bounds but also orders correctly the\nperformance of different lattices.\n