A lower bounding method for channel and source coding probabilities
- 28 February 1975
- journal article
- research article
- Published by Elsevier in Information and Control
- Vol. 27 (2) , 148-177
- https://doi.org/10.1016/s0019-9958(75)90120-5
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Hypothesis testing and information theoryIEEE Transactions on Information Theory, 1974
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Expurgated bounds, bhattacharyya distance, and rate distortion functionsInformation and Control, 1974
- Error exponent for source coding with a fidelity criterionIEEE Transactions on Information Theory, 1974
- A coding theorem for discrete-time sourcesIEEE Transactions on Information Theory, 1973
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)IEEE Transactions on Information Theory, 1973
- Lower bounds to error probability for coding on discrete memoryless channels. IIInformation and Control, 1967
- Lower bounds to error probability for coding on discrete memoryless channels. IInformation and Control, 1967
- A simple derivation of the coding theorem and some applicationsIEEE Transactions on Information Theory, 1965