A source matching approach to finding minimax codes
- 1 March 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (2), 166-174
- https://doi.org/10.1109/tit.1980.1056167
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Minimax codes for finite alphabets (Corresp.)IEEE Transactions on Information Theory, 1978
- Random coding strategies for minimum entropyIEEE Transactions on Information Theory, 1975
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Universal noiseless codingIEEE Transactions on Information Theory, 1973
- Enumerative source encodingIEEE Transactions on Information Theory, 1973
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- An algorithm for source codingIEEE Transactions on Information Theory, 1972
- Codes based on inaccurate source probabilitiesIEEE Transactions on Information Theory, 1971
- Comments on "Sequence time coading for data compression"Proceedings of the IEEE, 1966
- Sequence time coding for data compressionProceedings of the IEEE, 1966