On the method of random coding

DOI10.1515/DMA.1999.9.4.385MaRDI QIDQ4522827zbMATH OpenOpenAlexFDO

Authors

Publication date 4 January 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1999.9.4.385

zbMATH Keywords

information transmission through a binary symmetric channelrandom coding of messages

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 107764
• Random coding bounds for discrete memoryless channels
• A fast method for complete randomization of messages.
• Some information-theoretic problems of discrete data protection
• Random-coding bounds for some broadcast channels

Cited in

(10)

• Capacity of a communication channel with inner random coding
• Works of the Kiev school of theoretical cryptography
• On a new method of coding of information
• scientific article; zbMATH DE number 1990802 (Why is no real title available?)
• Random coding techniques for nonrandom codes
• scientific article; zbMATH DE number 2169185 (Why is no real title available?)
• A comparison of known codes, random codes, and the best codes
• A random encoding method for secure data communication: An extension of sequential coding
• On unordered codes
• Analog random coding

This page was built for publication: On the method of random coding

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