A Rank-Metric Approach to Error Control in Random Network Coding
Open Access
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
The problem of error control in random network coding is considered, and a formulation of the problem is given in terms of rank-metric codes. This formulation allows many of the tools developed for rank-metric codes to be applied to random network coding. A random network code induces a generalized decoding problem for rank-metric codes in which the channel may supply partial information about the error in the form of erasures (knowledge of an error location not its values) and deviations (knowledge of an error value but not its location).Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Using Rank-Metric Codes for Error Correction in Random Network Coding2007
- Coding for Errors and Erasures in Random Network Coding2007
- Resilient network coding in the presence of Byzantine adversaries2007
- Network Error Correction Coding in Packetized Networks2006
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Fast decoding of rank-codes with rank errors and column erasures2004
- A new method of erasure correction by rank codes2003
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Bilinear forms over a finite field, with applications to coding theoryJournal of Combinatorial Theory, Series A, 1978