Performance of quantizers on noisy channels using structured families of codes

DOI10.1109/18.887858MaRDI QIDQ2705979zbMATH OpenOpenAlexFDO

Authors András Méhes, Kenneth Zeger

Publication date 19 March 2001

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

Full work available at URL https://semanticscholar.org/paper/05e145ae4bebcd3f20b7576411119e9f5fdb1bf1

zbMATH Keywords

binary lattice vector quantizersbinary linear channel codesdata compressiondistortion boundslinear error-correcting codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Linear codes (general theory) (94B05)

Recommendations

• Asymptotic bounds on optimal noisy channel quantization via random coding
• Tradeoff between source and channel coding
• Binary lattice vector quantization with linear block codes and affine index assignments
• Distortion bounds for vector quantizers with finite codebook size
• Quantizers with uniform decoders and channel-optimized encoders

Cited in

(3)

• Performance of binary block codes at low signal-to-noise ratios
• Capacity bounds and mapping design for binary symmetric relay channels
• Design and Analysis of Optimal Noisy Channel Quantization With Random Index Assignment

This page was built for publication: Performance of quantizers on noisy channels using structured families of codes

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