- Authors:
-
Schotsch,
B.
,
Cyran,
M.
,
Huber,
J. B.
,
Fischer,
R. F. H.
,
Vary,
P.
- Book Title:
- Proceedings of International ITG Conference on Systems, Communications and Coding (SCC)
- Organization:
- ITG
- Publisher:
- IEEE
- Pages:
-
p.p.
1-6
- Date:
-
Feb. 2015
- ISBN:
- 978-3-80073-659-1
- Language:
- English
Abstract
Random linear network coding (RLNC) is a method to maximise the information flow in a network by forming random linear combinations over some finite field F_q of the received information packets at each intermediate node. The network between one source node and one destination node acts as a linear map F^n_q → F_q , which is represented by the network channel matrix. The connectivity within the network is assumed to be given, i.e. it is considered to be fixed but arbitrary and thus, the incidence matrix of the network is said to be known. The optimal decoding method is equivalent to solving a consistent system of linear equations over the respective finite field, e.g. by means of Gaussian elimination. Therefore, decoding is only successful if the respective square or tall network channel matrix has full column rank. Since the incidence matrix of the network is given, there is one degree of randomness less compared to the usual notion of random matrices. By exploiting similarities of RLNC with Luby transform (LT) coding, a method to establish rateless erasure resilience, which is also based on random matrices over some finite field, we derive an upper bound on the outage probability for RLNC with known incidence matrices.
Download
BibTeX
- Copyright © by IEEE
schotsch15.pdf -
© 2024 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
