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

DOI10.1109/TIT.1979.1056022zbMath0401.94017MaRDI QIDQ4186212

János Körner, Katalin Marton

Publication date: 1979

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (6)

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

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