New Improvements on the Echelon-Ferrers Construction

Abstract

We show how to improve the echelon-Ferrers construction of random network codes introduced by Etzion and Silberstein to attain codes of larger size for a given minimum distance.

In Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems - MTNS, Budapest, Hungary, 2010, pp. 405-408

References in corpus (4)

• A Rank-Metric Approach to Error Control in Random Network Coding
• Spread Codes and Spread Decoding in Network Coding
• Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and Ferrers Diagrams
• Construction of Error-Correcting Codes for Random Network Coding

Cited by in corpus (3)

• Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4
• Codes and Designs Related to Lifted MRD Codes
• The interplay of different metrics for the construction of constant dimension codes