Construction of error-correcting codes for random network coding
Authors:
- 1 March 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 070-074
Abstract
In this work we present error-correcting codes for random network coding based on rank-metric codes, Ferrers diagrams, and puncturing. For most parameters, the constructed codes are larger than all previously known codes.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers DiagramsIEEE Transactions on Information Theory, 2009
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- Constant-rank codes2008
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance2008
- A Rank-Metric Approach to Error Control in Random Network Coding2007
- Integer Partitions2004
- 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
- Subspaces, subsets, and partitionsJournal of Combinatorial Theory, Series A, 1971