Abstract
Subspace codes and constant dimension codes have become a widely investigated research topic due to their significance to error control in random linear network coding. Rank metric codes in Ferrers diagrams can be used to construct good subspace codes and constant dimension codes. In this paper, three constructions of Ferrers diagram rank metric codes are presented. The first two constructions are based on subcodes of maximum rank distance codes, and the last one generates new codes from known Ferrers diagram rank metric codes. Each of these constructions produces optimal codes with different diagrams and parameters for which no optimal construction was known before.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
