On the Error Exponent of Trellis Source Coding

DOI10.1109/TIT.2005.856953MaRDI QIDQ3547001zbMATH OpenFDO

Authors Ilan Hen, Neri Merhav

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Source coding (94A29) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Error exponent for source coding with a fidelity criterion
• On the redundancy of trellis lossy source coding
• scientific article; zbMATH DE number 969989
• A trellis code construction and coding theorem for stationary Gaussian sources (Corresp.)
• scientific article; zbMATH DE number 1029231

Cited in

(7)

• Improving Error Bounds for Multipole-Based Treecodes
• Trellis-coded quantization for binary erasure channels
• The error-correcting pair for TGRS codes
• scientific article; zbMATH DE number 969989 (Why is no real title available?)
• On the error exponent of convolutionally coded ARQ
• scientific article; zbMATH DE number 1029231 (Why is no real title available?)
• Error exponents of expander codes

This page was built for publication: On the Error Exponent of Trellis Source Coding

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