Coding for computing

DOI10.1109/18.915643MaRDI QIDQ4544528zbMATH OpenOpenAlexFDO

Authors Alon Orlitsky, James R. Roche

Publication date 4 August 2002

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

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

zbMATH Keywords

communication complexityconditional entropygraph entropyrate distortion

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Source coding and graph entropies
• Privacy, additional information and communication
• Three results on interactive communication
• Interactive Communication of Balanced Distributions and of Correlated Files
• Information complexity is computable

Cited in

(8)

• scientific article; zbMATH DE number 3854380 (Why is no real title available?)
• Towards a queueing-based framework for in-network function computation
• Representation and coding of signal geometry
• Source coding and graph entropies
• A candidate for a strong separation of information and communication
• Interactive function computation via polar coding
• Worst-case asymmetric distributed function computation
• Common Information, Noise Stability, and Their Extensions

This page was built for publication: Coding for computing

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