Tree encoding of memoryless time-discrete sources with a fidelity criterion

DOI10.1109/TIT.1969.1054355MaRDI QIDQ5568917zbMATH OpenWikidataFDO

Authors Frederick Jelinek

Publication date 1969

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

Full work available at URL https://doi.org/10.1109/TIT.1969.1054355

zbMATH Keywords

information, communication

Recommendations

• A stack algorithm for source coding with a fidelity criterion
• A tree coding theorem for stationary Gaussian sources and the squared-error distortion measure
• On the redundancy of trellis lossy source coding
• Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion
• A trellis code construction and coding theorem for stationary Gaussian sources (Corresp.)

Cited in

(7)

• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• A survey of constructive coding theory, and a table of binary codes of highest known rate
• A trellis code construction and coding theorem for stationary Gaussian sources (Corresp.)
• Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
• A tree coding theorem for stationary Gaussian sources and the squared-error distortion measure
• A stack algorithm for source coding with a fidelity criterion
• Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion

This page was built for publication: Tree encoding of memoryless time-discrete sources with a fidelity criterion

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