On general Gilbert bounds
- 1 September 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (5) , 661-666
- https://doi.org/10.1109/tit.1973.1055056
Abstract
We define a distance measure for block codes used over memoryless channels and show that it is related to upper and lower bounds on the low-rate error probability in the same way as Hamming distance is for binary block codes used over the binary symmetric channel. We then prove general Gilbert bounds for block codes using this distance measure. Some new relationships between coding theory and rate-distortion theory are presented.Keywords
This publication has 6 references indexed in Scilit:
- Expurgated bounds, bhattacharyya distance, and rate distortion functionsInformation and Control, 1974
- Limit distribution of the minimum distance of random linear codesIEEE Transactions on Information Theory, 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
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956
- A Comparison of Signalling AlphabetsBell System Technical Journal, 1952