Optimal binary vector quantization via enumeration of covering codes

DOI10.1109/18.556119MaRDI QIDQ4340331zbMATH OpenOpenAlexFDO

Authors Xiaolin Wu

Publication date 15 December 1997

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

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

zbMATH Keywords

binary image compressionbinary vector quantizationcovering codesdistortion measuresHamming code

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34) Linear codes (general theory) (94B05)

Recommendations

• Robust vector quantization by a linear mapping of a block code
• Binary lattice vector quantization with linear block codes and affine index assignments
• scientific article; zbMATH DE number 1234991
• Vector quantizers with direct sum codebooks
• Theory of lattice-based fine-coarse vector quantization

Cited in

(1)

• Optimal binary covering codes of length 2j

This page was built for publication: Optimal binary vector quantization via enumeration of covering codes

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