An improvement of the Feng-Rao bound for primary codes
Information Theory
2013-07-25 v2 Commutative Algebra
math.IT
Abstract
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method does not only work for the minimum distance but can be applied to any generalised Hamming weight
Keywords
Cite
@article{arxiv.1307.3107,
title = {An improvement of the Feng-Rao bound for primary codes},
author = {Olav Geil and Stefano Martin},
journal= {arXiv preprint arXiv:1307.3107},
year = {2013}
}
Comments
30 pages, 7 figures