A simple proof of the Ahlswede - Csiszár one-bit theorem (Corresp.)

DOI10.1109/TIT.1983.1056742MaRDI QIDQ3328446zbMATH OpenFDO

Authors

Publication date 1983

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

zbMATH Keywords

multi-user communicationfinite alphabet correlated sourcesone-bit theorem

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• A dichotomy of functions<tex>F(X, Y)</tex>of correlated sources<tex>(X, Y)</tex>
• On Slepian-Wolf theorem with interaction
• On interactive communication
• On Slepian-Wolf theorem with interaction
• Interactive Communication of Balanced Distributions and of Correlated Files

This page was built for publication: A simple proof of the Ahlswede - Csiszár one-bit theorem (Corresp.)

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