Binary lattice vector quantization with linear block codes and affine index assignments

DOI10.1109/18.650990MaRDI QIDQ4392437zbMATH OpenOpenAlexFDO

Authors András Méhes, Kenneth Zeger

Publication date 10 February 1999

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

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

zbMATH Keywords

binary-symmetric channelHadamard transformindex assignmentlatticeslinear block channel codinglinear block codenonsymmetric channelvector quantization

Mathematics Subject Classification ID

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

Recommendations

• Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
• The Hadamard transform-a tool for index assignment
• scientific article; zbMATH DE number 515901
• Tradeoff between source and channel coding

Cited in

(5)

• Performance of quantizers on noisy channels using structured families of codes
• scientific article; zbMATH DE number 515901 (Why is no real title available?)
• Optimal binary vector quantization via enumeration of covering codes
• Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
• Robust indexing of lattices and permutation codes over binary symmetric channels

This page was built for publication: Binary lattice vector quantization with linear block codes and affine index assignments

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