Construction of error-correcting codes for random network coding

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.

[1]  Maximilien Gadouleau,et al.  Constant-rank codes , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Frank R. Kschischang,et al.  A Rank-Metric Approach to Error Control in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[3]  Maximilien Gadouleau,et al.  On the Connection between Optimal Constant-Rank Codes and Optimal Constant-Dimension Codes , 2008, ArXiv.

[4]  Ron M. Roth,et al.  Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.

[5]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[6]  Maximilien Gadouleau,et al.  Constant-Rank Codes and Their Connection to Constant-Dimension Codes , 2008, IEEE Transactions on Information Theory.

[7]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[8]  Joachim Rosenthal,et al.  Spread codes and spread decoding in network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[9]  Sascha Kurz,et al.  Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance , 2008, MMICS.

[10]  Natalia Silberstein,et al.  Coding theory and projective spaces , 2008, 0805.3528.

[11]  Vitaly Skachek,et al.  Recursive Code Construction for Random Networks , 2008, IEEE Transactions on Information Theory.

[12]  Shu-Tao Xia,et al.  Johnson type bounds on constant dimension codes , 2007, Des. Codes Cryptogr..

[13]  Natalia Silberstein,et al.  Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams , 2008, IEEE Transactions on Information Theory.

[14]  Martin Bossert,et al.  Codes for network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[15]  Philippe Delsarte,et al.  Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.

[16]  D. Knuth.  Subspaces, subsets, and partitions , 1971 .

[17]  Maximilien Gadouleau,et al.  On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes , 2008, ArXiv.