On zero neighbours and trial sets of linear codes
classification
💻 cs.IT
math.IT
keywords
codewordsleaderlinearneighbourstrialzeroallowscode
read the original 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_q^n$. This allows us to describe a test set, a trial set and the set zero neighbours in terms of the leader codewords.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.