On a class of multilevel universal source coding schemes

DOI10.1109/18.59941MaRDI QIDQ3199314zbMATH OpenOpenAlexFDO

Authors Yehuda Azenkot, David Hertz

Publication date 1990

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

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

zbMATH Keywords

computational complexitydata compressioncoding rateuniversal source coding schemes

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Multi-alphabet universal coding of memoryless sources
• Efficient universal noiseless source codes
• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• Universal noiseless coding
• Universal multiresolution source codes

Cited in

(6)

• A unique ranking of multilevel sequences and its application to source coding (Corresp.)
• Multilevel Coding for Nonlinear ISI Channels
• scientific article; zbMATH DE number 3601521 (Why is no real title available?)
• A variant of the Narayana coding scheme
• scientific article; zbMATH DE number 1498812 (Why is no real title available?)
• Universal multiresolution source codes

This page was built for publication: On a class of multilevel universal source coding schemes

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