scientific article; zbMATH DE number 1498821
A nonzero codeword \(c\) in a code \(C\) is called minimal if its support does not include the support of another nonzero codeword as a proper subset. The study of sets of minimal codewords of linear codes is important for constructing a decoding algorithm and describing the minimal access structure in linear secret-sharing schemes. A code is called intersecting if every pair of its codewords has nonempty intersection. The cardinalities are presented of the sets of minimal (nonminimal) codewords of weight 10 and 11 in a cyclic binary \([2^m-1,2^m-2m-1,5]\)-code with generating polynomial \(g(x)=m_1(x)m_{2^s+1}(x)\), where \((s,m)=1\), as well as of weight 12 in its extended code \(\hat {C}\). The weights 10 and 12 are the first weights for which both minimal and nonminimal codewords of \(C\) and, respectively, \(\hat {C}\) exist. It is proven that both the dual of Melas codes and a class of codes that includes the duals of Zetterberg codes are intersecting. For the entire collection see [Zbl 0918.00043].
- Linear intersecting codes
- Minimal cyclic codes of length \(2p^n\)
- On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
- scientific article; zbMATH DE number 1188986 (Why is no real title available?)
- Some minimal cyclic codes over finite fields
- Cycle representatives for minimal cyclic codes (Corresp.)
- scientific article; zbMATH DE number 2143618 (Why is no real title available?)
- scientific article; zbMATH DE number 2170838 (Why is no real title available?)
- scientific article; zbMATH DE number 6468123 (Why is no real title available?)
- Minimal cyclic codes of length 2p^n
- Several classes of optimal \(p\)-ary cyclic codes with minimum distance four
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501012)