A lower bounding method for channel and source coding probabilities

DOI10.1016/S0019-9958(75)90120-5MaRDI QIDQ4047448zbMATH OpenOpenAlexFDO

Authors Jim K. Omura

Publication date 1975

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(75)90120-5

Mathematics Subject Classification ID

Information theory (general) (94A15)

Cited in

(2)

• The sphere packing bound for memoryless channels
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses

This page was built for publication: A lower bounding method for channel and source coding probabilities

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