How to encode the modulo-two sum of binary sources (Corresp.)

DOI10.1109/TIT.1979.1056022MaRDI QIDQ4186212zbMATH OpenFDO

Authors János Körner, K. Marton

Publication date 1979

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

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

zbMATH Keywords

Source CodingBinary SourcesModulo-Two AdderRate RegionTwo-Help-One Source Network

Mathematics Subject Classification ID

Circuits, networks (94C99) Source coding (94A29)

Cited in

(7)

• Over-the-Air computation for distributed machine learning and consensus in large wireless networks
• Coding of image feature descriptors for distributed rate-efficient visual correspondences
• Weight distribution of random linear codes and Krawtchouk polynomials
• Nested linear/lattice codes revisited
• Worst-case asymmetric distributed function computation
• Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function
• Interactive function computation via polar coding

This page was built for publication: How to encode the modulo-two sum of binary sources (Corresp.)

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