A Singleton Bound for Lattice Schemes
Information Theory
2015-06-17 v4 math.IT
Abstract
In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We also obtain a new upper bound on the code size for non-constant dimension codes. The plots of this bound along with plots of the code sizes of known non-constant dimension codes in the literature reveal that our bound is tight for certain parameters of the code.
Cite
@article{arxiv.1301.6456,
title = {A Singleton Bound for Lattice Schemes},
author = {Srikanth B. Pai and B. Sundar Rajan},
journal= {arXiv preprint arXiv:1301.6456},
year = {2015}
}
Comments
17 pages, 8 figures. Submitted to IEEE Transactions on Information Theory