2016/05/02 by Oliver W. Gnilke, Ha Thanh Nguyen Tran, Gnilke, Oliver Wilhelm +5 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1605.00419
openalex publication_date 2016/05/02 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
For many wiretap channel models asymptotically optimal coding schemes are\nknown, but less effort has been put into actual realizations of wiretap codes\nfor practical parameters. Bounds on the mutual information and error\nprobability when using coset coding on a Rayleigh fading channel were recently\nestablished by Oggier and Belfiore, and the results in this paper build on\ntheir work. However, instead of using their ultimate inverse norm sum\napproximation, a more precise expression for the eavesdropper's probability of\ncorrect decision is used in order to determine a general class of good coset\ncodes. The code constructions are based on well-rounded lattices arising from\nsimple geometric criteria. In addition to new coset codes and simulation\nresults, novel number-theoretic results on well-rounded ideal lattices are\npresented.\n