New LMRD bounds for constant dimension codes and improved constructions

Abstract

We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.

18 pages, 1 figure, 2 tables, 1 algorithm

References in corpus (7)

• A Rank-Metric Approach to Error Control in Random Network Coding
• On Metrics for Error Correction in Network Coding
• Tables of subspace codes
• Coset Construction for Subspace Codes
• Partial spreads and vector space partitions
• Projective divisible binary codes
• A New Approach to the Main Problem of Subspace Coding

Cited by in corpus (1)

• Classification of large partial plane spreads in $PG(6,2)$ and related combinatorial objects