Worst-case asymmetric distributed function computation

DOI10.1080/03081079.2012.708342zbMath1269.93100arXiv1301.0207OpenAlexW2159104842MaRDI QIDQ5326145

Samar Agnihotri, Rajesh Venkatachalapathy

Publication date: 31 July 2013

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.0207

zbMATH Keywords

information measureswireless sensor networksinteractive communicationneural information processing systemsasymmetric communication scenariosdistributed function computationworst-case information-theoretic analysis

Mathematics Subject Classification ID

Decentralized systems (93A14) Stochastic systems in control theory (general) (93E03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uncertainty and Information
• Coding for interactive communication
• Finding parity in a simple broadcast network
• A dichotomy of functions<tex>F(X, Y)</tex>of correlated sources<tex>(X, Y)</tex>
• Worst-case interactive communication. I. Two messages are almost optimal
• How to encode the modulo-two sum of binary sources (Corresp.)
• Coding for computing
• Communication Complexity
• Some Results on Distributed Source Coding for Interactive Function Computation
• Channel Coding Rate in the Finite Blocklength Regime
• Elements of Information Theory
• Noiseless coding of correlated information sources

This page was built for publication: Worst-case asymmetric distributed function computation