Communication Over Finite-Field Matrix Channels

DOI10.1109/TIT.2009.2039167MaRDI QIDQ4975980zbMATH OpenOpenAlexWikidataFDO

Authors Danilo Silva, Frank R. Kschischang, R. Kötter

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/0807.1372

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)

Abstract: This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random network coding. The model assumes that n packets of length m are transmitted over the network, and up to t erroneous packets are randomly chosen and injected into the network. Upper and lower bounds on capacity are obtained for any channel parameters, and asymptotic expressions are provided in the limit of large field or matrix size. A simple coding scheme is presented that achieves capacity in both limiting cases. The scheme has decoding complexity O(n^2 m) and a probability of error that decreases exponentially both in the packet length and in the field size in bits. Extensions of these results for coherent network coding are also presented.

Cited in

(5)

• On the complexity of decomposing matrices arising in satellite communication
• Induced weights on quotient modules and an application to error correction in coherent networks
• Constructions and bounds for mixed-dimension subspace codes
• Linear space bootstrap communication schemes
• Necessary conditions for the existence of subspace 3-designs with nontrivial automorphism groups

This page was built for publication: Communication Over Finite-Field Matrix Channels

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