Multiple-Access Network Information-Flow and Correction Codes

DOI10.1109/TIT.2010.2095130MaRDI QIDQ5281095zbMATH OpenOpenAlexFDO

Authors Theodoros K. Dikaliotis, Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Hongyi Yao, Michelle Effros, Jörg Kliewer, Elona Erez

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Abstract: This work considers the multiple-access multicast error-correction scenario over a packetized network with $z$ malicious edge adversaries. The network has min-cut $m$ and packets of length $ell$, and each sink demands all information from the set of sources $sources$. The capacity region is characterized for both a "side-channel" model (where sources and sinks share some random bits that are secret from the adversary) and an "omniscient" adversarial model (where no limitations on the adversary's knowledge are assumed). In the "side-channel" adversarial model, the use of a secret channel allows higher rates to be achieved compared to the "omniscient" adversarial model, and a polynomial-complexity capacity-achieving code is provided. For the "omniscient" adversarial model, two capacity-achieving constructions are given: the first is based on random subspace code design and has complexity exponential in $ellm$, while the second uses a novel multiple-field-extension technique and has $O(ell{m}^{|sources|})$ complexity, which is polynomial in the network size. Our code constructions are "end-to-end" in that all nodes except the sources and sinks are oblivious to the adversaries and may simply implement predesigned linear network codes (random or otherwise). Also, the sources act independently without knowledge of the data from other sources.

Recommendations

• Coding for a multiple-access channel
• Coding for a multiple access OR channel: A survey
• Information theory and network coding
• Publication:4886144
• Robust coding for multiple-access channels
• Homologous Codes for Multiple Access Channels
• Information flow decomposition for network coding
• Distributed coding in a multiple access environment
• Coding and control for communication networks
• Network coding and subspace designs

Cited in

(2)

• Rainbow Network Flow of Multiple Description Codes
• Coding for a multiple access OR channel: A survey

This page was built for publication: Multiple-Access Network Information-Flow and Correction Codes

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