Coding theorems for the nonsynchronized channel

DOI10.1109/TIT.1970.1054395MaRDI QIDQ5578203zbMATH OpenFDO

Authors David Chase

Publication date 1970

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

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

zbMATH Keywords

error boundscapacitymemoryless binary symmetric channel

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 3349718
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Capacity bounds for a channel with synchronization errors
• A simple derivation of the coding theorem and some applications
• Block codes for a class of constrained noiseless channels

Cited in

(12)

• Coding theorems for turbo code ensembles
• Nonuniform Fuchsian codes for noisy channels
• Capacity bounds for a channel with synchronization errors
• Capacity and a lower bound to<tex>R_{mbox{comp}}</tex>for a channel with symbol fission
• Block codes for a class of constrained noiseless channels
• scientific article; zbMATH DE number 3321830 (Why is no real title available?)
• scientific article; zbMATH DE number 3349718 (Why is no real title available?)
• Synchronization methods for block codes
• scientific article; zbMATH DE number 1779569 (Why is no real title available?)
• scientific article; zbMATH DE number 7233683 (Why is no real title available?)
• Reliable communication across parallel asynchronous channels with glitches
• Optimal Sequential Frame Synchronization

This page was built for publication: Coding theorems for the nonsynchronized channel

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