The precoding problem for sparse random linear network coding

In the random linear network coding scenario with subspace codes applied, if the number of packets injected into the network is larger than the dimension of the subspace, the packets are not linearly independent. This paper addresses the problem of how to choose these packets to represent the subspa...

Full description

Saved in:
Bibliographic Details
Published in:2012 International Symposium on Network Coding (NetCod) pp. 185 - 190
Main Authors: Xiaolin Li, Wai Ho Mow
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2012
Subjects:
Decoding
Decoding failure probability
Encoding
Generators
MDS codes
Measurement
Network coding
random matrix
rank distribution
Sparse matrices
subspace codes
Vectors
ISBN:9781467318907, 1467318906
ISSN:2374-9660
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the random linear network coding scenario with subspace codes applied, if the number of packets injected into the network is larger than the dimension of the subspace, the packets are not linearly independent. This paper addresses the problem of how to choose these packets to represent the subspaces so as to minimize the decoding failure probability and formulates it as a precoding problem. We propose a precoding method based on the generator matrices of a class of the maximum distance separable codes and show that it can minimize the decoding failure probability for a sparse random transfer matrix over a large enough finite field. Our result is obtained by analyzing the rank distribution of finite field random matrices in the large field size limit. As a consequence, it is applied to shed some light on the tradeoff between the maximum achievable sparsity of the transfer matrix and the rate of the subspace code.
ISBN:9781467318907
1467318906
ISSN:2374-9660
DOI:10.1109/NETCOD.2012.6261906