New LMRD bounds for constant dimension codes and improved constructions
Daniel Heinlein·2018-01-15·via math.CO updates on arXiv.org
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.