A stack algorithm for source coding with a fidelity criterion

DOI10.1109/TIT.1974.1055196zbMATH Open0308.94014OpenAlexW4251707383MaRDI QIDQ4066985FDOQ4066985

Authors: John B. Anderson 

Publication date: 1974

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1974.1055196

Recommendations

• Tree encoding of memoryless time-discrete sources with a fidelity criterion
• An algorithm for source coding subject to a fidelity criterion, based on string matching
• Variable-length codes and the Fano metric
• Search properties of some sequential decoding algorithms
• scientific article; zbMATH DE number 3557667

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (3)

• Computationally Optimal Metric-First Code Tree Search Algorithms
• Tree encoding of memoryless time-discrete sources with a fidelity criterion
• Block-definition approaches to source coding with a fidelity criterion

This page was built for publication: A stack algorithm for source coding with a fidelity criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4066985)