An upper bound of Singleton type for componentwise products of linear codes
Information Theory
2016-11-18 v3 math.IT
Abstract
We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical Singleton bound.
Keywords
Cite
@article{arxiv.1305.4840,
title = {An upper bound of Singleton type for componentwise products of linear codes},
author = {Hugues Randriambololona},
journal= {arXiv preprint arXiv:1305.4840},
year = {2016}
}
Comments
9 pages; major improvements in v3: now works for an arbitrary number of codes, and the low-weight codeword can be taken in product form; submitted to IEEE Trans. Inform. Theory