New LMRD bounds for constant dimension codes and improved constructions
Combinatorics
2018-01-16 v1 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1801.04803,
title = {New LMRD bounds for constant dimension codes and improved constructions},
author = {Daniel Heinlein},
journal= {arXiv preprint arXiv:1801.04803},
year = {2018}
}
Comments
18 pages, 1 figure, 2 tables, 1 algorithm