2000 character limit reached
On zero neighbours and trial sets of linear codes (1411.7493v1)
Published 27 Nov 2014 in cs.IT and 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 $\mathbb F_qn$. This allows us to describe a test set, a trial set and the set zero neighbours in terms of the leader codewords.