2017/01/28 by Antonio Campello, Campello, Antonio, Линг Лиу +3
Computer Science · #Coding theory and cryptography #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1701.08314
openalex publication_date 2017/01/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with negligible probability of error for any channel realization and normalized log-density approaching the Poltyrev limit. Capacity analyses and numerical results on the achievable rates for each partition level are provided. The proposed codes have several enjoyable properties such as constructiveness and good decoding complexity, as compared to random one-level codes. Numerical results for finite-dimensional multi-level lattices based on polar codes are exhibited.