An algorithm for optimal prefix parsing of a noiseless and memoryless channel
- 1 March 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (2) , 208-214
- https://doi.org/10.1109/tit.1973.1054981
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)Information and Control, 1971
- Minimum-redundancy coding for the discrete noiseless channelIEEE Transactions on Information Theory, 1961
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952