Lower bounds on the code rate for a model of data transmission with side information

DOI10.1109/18.681343zbMATH Open0977.94058OpenAlexW2059612968MaRDI QIDQ4701142FDOQ4701142

V. B. Balakirskij

Publication date: 21 November 1999

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

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

Recommendations

• Lower bounds to error probability for coding on discrete memoryless channels. I
• \(\epsilon\)-optimal coding rates of a randomly varying source with side information at the decoder
• On variable length coding with side information for discrete memoryless sources
• scientific article; zbMATH DE number 3869209
• Error estimates for low rate codes

zbMATH Keywords

decoderasymptotic lower boundsencoderlocalized errorscode rate

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited In (1)

• A lower bound on the encoding length in lossy transmission

This page was built for publication: Lower bounds on the code rate for a model of data transmission with side information

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