Back to Search
Start Over
Finite-Field Matrix Channels for Network Coding.
- Source :
-
IEEE Transactions on Information Theory . Mar2019, Vol. 65 Issue 3, p1614-1625. 12p. - Publication Year :
- 2019
-
Abstract
- In 2010, Silva et al. studied certain classes of finite-field matrix channels in order to model random linear network coding where exactly $t$ random errors are introduced. In this paper, we consider a generalization of these matrix channels where the number of errors is not required to be constant, indeed the number of errors may follow any distribution. We show that a capacity-achieving input distribution can always be taken to have a very restricted form (the distribution should be uniform given the rank of the input matrix). This result complements, and is inspired by a paper of Nobrega et al., which establishes a similar result for a class of matrix channels that model network coding with link erasures. Our result shows that the capacity of our channels can be expressed as maximization over probability distributions on the set of possible ranks of input matrices: a set of linear rather than exponential size. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 65
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 134886983
- Full Text :
- https://doi.org/10.1109/TIT.2018.2875763