Near merging of paths in suboptimal tree searching (Corresp.)
- 1 May 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (3) , 567-573
- https://doi.org/10.1109/tit.1984.1056903
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Sequential Coding Algorithms: A Survey and Cost AnalysisIEEE Transactions on Communications, 1984
- Robust Two-Dimensional Tree Encoding of ImagesIEEE Transactions on Communications, 1981
- Tree encoding of images in the presence of channel errorsIEEE Transactions on Information Theory, 1981
- Asymptotic stability of linear shift-invariant two-dimensional digital filtersIEEE Transactions on Circuits and Systems, 1980
- Real-number convolutional codes for speech-like quasi-stationary sources (Corresp.)IEEE Transactions on Information Theory, 1977
- Tree encoding of speechIEEE Transactions on Information Theory, 1975
- A stack algorithm for source coding with a fidelity criterionIEEE Transactions on Information Theory, 1974
- A 2-cycle algorithm for source coding with a fidelity criterionIEEE Transactions on Information Theory, 1973
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- Tree encoding of memoryless time-discrete sources with a fidelity criterionIEEE Transactions on Information Theory, 1969