Capacity and a lower bound to<tex>R_{mbox{comp}}</tex>for a channel with symbol fission

DOI10.1109/TIT.1976.1055575zbMATH Open0348.94021OpenAlexW2143858609MaRDI QIDQ4119097FDOQ4119097

Authors: Robert J. Dick, Toby Berger 

Publication date: 1976

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

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

Recommendations

• Lower bounds to error probability for coding on discrete memoryless channels. I
• Channel capacity for a given decoding metric
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• Coding theorems for the nonsynchronized channel
• A simple derivation of the lower bound to&lt;tex&gt;R_{mbox{comp}}&lt;/tex&gt;for discrete memoryless channels (Corresp.)

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Cited In (3)

• Shannon meets Turing: non-computability and non-approximability of the finite state channel capacity
• A simple derivation of the lower bound to&lt;tex&gt;R_{mbox{comp}}&lt;/tex&gt;for discrete memoryless channels (Corresp.)
• Upper and lower bounds on the binary input AWGN channel capacity

This page was built for publication: Capacity and a lower bound to&lt;tex&gt;R_{mbox{comp}}&lt;/tex&gt;for a channel with symbol fission

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