New Lower Bounds for Constant Dimension Codes
Information Theory
2014-09-03 v1 math.IT
Abstract
This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.
Cite
@article{arxiv.1301.5961,
title = {New Lower Bounds for Constant Dimension Codes},
author = {Natalia Silberstein and Anna-Lena Trautmann},
journal= {arXiv preprint arXiv:1301.5961},
year = {2014}
}