On zero neighbours and trial sets of linear codes
Information Theory
2014-12-01 v1 math.IT
Abstract
In this work we study the set of leader codewords of a non-binary linear code. This set has some nice properties related to the monotonicity of the weight compatible order on the generalized support of a vector in . This allows us to describe a test set, a trial set and the set zero neighbours in terms of the leader codewords.
Keywords
Cite
@article{arxiv.1411.7493,
title = {On zero neighbours and trial sets of linear codes},
author = {Mijail Borges-Quintana and Miguel Angel Borges-Trenard and Edgar Martinez-Moro},
journal= {arXiv preprint arXiv:1411.7493},
year = {2014}
}
Comments
Submitted to IEEE Trans. Inf. Th