Asymptotic bounds on optimal noisy channel quantization via random coding

DOI10.1109/18.340467MaRDI QIDQ4850294zbMATH OpenOpenAlexFDO

Authors Kenneth Zeger, Vic Manzella

Publication date 9 November 1995

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

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

zbMATH Keywords

noisy channeljoint source-channel codingasymptotic vector quantization

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Distortion bounds for vector quantizers with finite codebook size
• Tradeoff between source and channel coding
• Optimal binary index assignments for a class of equiprobable scalar and vector quantizers
• scientific article; zbMATH DE number 515901

Cited in

(8)

• scientific article; zbMATH DE number 1984078 (Why is no real title available?)
• Design and Analysis of Optimal Noisy Channel Quantization With Random Index Assignment
• Single-Sample Robust Joint Source–Channel Coding: Achieving Asymptotically Optimum Scaling of SDR Versus SNR
• On the cost of finite block length in quantizing unbounded memoryless sources
• On the Design of Optimal Noisy Channel Scalar Quantizer with Random Index Assignment
• Performance of quantizers on noisy channels using structured families of codes
• On channel-constrained vector quantization and index assignment for discrete memoryless channels
• Optimum Compression of a Noisy Measurement for Transmission Over a Noisy Channel

This page was built for publication: Asymptotic bounds on optimal noisy channel quantization via random coding

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