Random coding techniques for nonrandom codes

DOI10.1109/18.782147MaRDI QIDQ4503408zbMATH OpenOpenAlexFDO

Authors Nadav Shulman, Meir Feder

Publication date 7 September 2000

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

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

zbMATH Keywords

linear codesupper bounderror probabilityerror exponentrandom codingchannel coding theorem

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Recommendations

• Nonbinary random error-correcting codes (Corresp.)
• On the method of random coding
• scientific article; zbMATH DE number 3985119
• Nonrandom binary superimposed codes
• scientific article; zbMATH DE number 1990802
• On pseudorandom encodings
• scientific article; zbMATH DE number 1833397
• Optimal random coding
• On Obtaining Pseudorandomness from Error-Correcting Codes
• Multiuser Random Coding Techniques for Mismatched Decoding

Cited in

(7)

• scientific article; zbMATH DE number 3670354 (Why is no real title available?)
• scientific article; zbMATH DE number 1990802 (Why is no real title available?)
• Variations on the Gallager bounds with some applications
• Random coding bounds for discrete memoryless channels
• Reed-Muller Codes
• On the non-abelian group code capacity of memoryless channels
• Explicit rateless codes for memoryless binary-input output-symmetric channels

This page was built for publication: Random coding techniques for nonrandom codes

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