On channel-constrained vector quantization and index assignment for discrete memoryless channels

DOI10.1109/18.796416MaRDI QIDQ4503475zbMATH OpenOpenAlexFDO

Authors Mikael Skoglund

Publication date 7 September 2000

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

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

zbMATH Keywords

channel distortionchannel robust source codingchannel robust vector quantizerscombined source-channel codingdiscrete memoryless channelsHadamard transform

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Robust vector quantization by a linear mapping of a block code
• Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
• scientific article; zbMATH DE number 515901
• Asymptotic bounds on optimal noisy channel quantization via random coding
• The Hadamard transform-a tool for index assignment

Cited in

(10)

• Minimax nonredundant channel coding
• On the Design of Optimal Noisy Channel Scalar Quantizer with Random Index Assignment
• On the performance and complexity of channel-optimized vector quantizers
• Capacity bounds and mapping design for binary symmetric relay channels
• Channel-matched hierarchical table-lookup vector quantization
• Robust vector quantization by a linear mapping of a block code
• A Linear Encoding Approach to Index Assignment in Lossy Source-Channel Coding
• Design and Analysis of Optimal Noisy Channel Quantization With Random Index Assignment
• Using geometrical properties for fast indexation of Gaussian vector quantizers
• Memory efficient adaptation of vector quantizers to time-varying channels

This page was built for publication: On channel-constrained vector quantization and index assignment for discrete memoryless channels

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