New Improvements on the Echelon-Ferrers Construction

2011/10/11 by Trautmann, Anna-Lena, Rosenthal, Joachim · 3 citations
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1110.2417

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.

Cited by

• Multilevel constructions of constant dimension codes based on one-factorization of complete graphs
• Multilevel inserting constructions for constant dimension subspace codes
• New constant-dimension subspace codes from parallel cosets of optimal Ferrers diagram rank-metric codes and multilevel inserting constructions

Related

• Construction of Error-Correcting Codes for Random Network Coding
• Bounds for the multilevel construction
• A Note on the Injection Distance
• Improving the Linkage Construction with Echelon-Ferrers for Constant-Dimension Codes
• New Constant Dimension Codes From the Inserting Mixed Dimension Construction and Multilevel Construction