Corrected proof of de Buda's theorem (lattice channel codes)

DOI10.1109/18.259668zbMATH Open0802.94005OpenAlexW1970046173MaRDI QIDQ4307397FDOQ4307397

Tamás Linder, Kenneth Zeger, Christian B. Schlegel

Publication date: 3 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.259668

Recommendations

• Erratum
• Corrections to ``Abelian group codes for channel coding and source coding
• Errata: Quantitative robust uncertainty principles and optimally sparse decompositions.
• scientific article; zbMATH DE number 3991414
• Corrigendum to: ``\(l\)-LIPs of codes over finite chain rings

zbMATH Keywords

asymptotic optimalityadditive white Gaussian noise channellattice channel codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)

Cited In (1)

• Nested linear/lattice codes revisited

This page was built for publication: Corrected proof of de Buda's theorem (lattice channel codes)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307397)