Randomness and structure in channel coding

zbMATH Open1505.94118MaRDI QIDQ5090199FDOQ5090199

Authors: Gérard Battail 

Publication date: 18 July 2022

Recommendations

• A comparison of known codes, random codes, and the best codes
• The serial concatenation of rate-1 codes through uniform random interleavers
• Any code of which we cannot think is good
• A construction technique for random-error-correcting convolutional codes
• Random codes: minimum distances and error exponents

zbMATH Keywords

channel capacityrandom codingrandom-like convolutional codes

Mathematics Subject Classification ID

Convolutional codes (94B10) Other types of codes (94B60)

Cited In (5)

• Channel Code Using Constrained-Random-Number Generator Revisited
• Random bit flipping and EXIT charts for nonuniform binary sources and joint source-channel turbo systems
• Any code of which we cannot think is good
• Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy
• Moderate Deviations in Channel Coding

This page was built for publication: Randomness and structure in channel coding

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