Publications – Details

 

An Upper Bound on the Outage Probability of Random Linear Network Codes with Known Incidence Matrices

Authors:

Birgit Schotsch, Michael Cyran, Johannes B. Huber, Robert F. H. Fischer, and Peter Vary

Book Title:

Proceedings of International ITG Conference on Systems, Communications and Coding (SCC)

Venue:

Hamburg, Germany

Event Date:

2.-5.2.2015

Organization:

ITG

Publisher:

IEEE

Date:

Feb. 2015

Pages:

1–6

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 of Publication

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

The following notice applies to all IEEE publications:
© IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

File