New LMRD bounds for constant dimension codes and improved constructions
arXiv:1801.04803
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