Communication Over Finite-Field Matrix Channels
| Autor: | Frank R. Kschischang, Danilo Silva, Ralf Kötter |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
FOS: Computer and information sciences
Network packet Information Theory (cs.IT) Computer Science - Information Theory 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Library and Information Sciences Topology 01 natural sciences Upper and lower bounds Computer Science Applications Matrix (mathematics) Finite field 010201 computation theory & mathematics Linear network coding 0202 electrical engineering electronic engineering information engineering Error detection and correction Decoding methods Computer Science::Information Theory Information Systems Mathematics Communication channel |
| Zdroj: | IEEE Transactions on Information Theory. 56:1296-1305 |
| ISSN: | 1557-9654 0018-9448 |
| DOI: | 10.1109/tit.2009.2039167 |
| Popis: | 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. 24 pages, to be published at the IEEE Transactions on Information Theory |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|