On linear codes whose weights and length have a common divisor

DOI10.1016/J.AIM.2006.07.011MaRDI QIDQ876321zbMATH OpenOpenAlexFDO

Authors Simeon Ball, András Gács, Peter Sziklai, Zsuzsa Weiner, Aart Blokhuis

Publication date 18 April 2007

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aim.2006.07.011

zbMATH Keywords

linear codespolynomials over finite fieldsprojective space

Mathematics Subject Classification ID

Linear codes and caps in Galois spaces (51E22) Linear codes (general theory) (94B05)

Review text

The main result of this paper is the following. Let \(C\) be a \([n,k,d]\)-linear code over the finite field \(GF(q)\), \(q\) a power of a prime \(p\), and \(1<r<n\) an integer which divides \(n\) and all the weights of codes words. If the dual minimum distance is at least 3, then \(n\geq (r-1)q+(p-1)r\). This bound is sharp in some cases and a strong generalization of results in [\textit{S. Ball} and \textit{A. Blokhuis}, Proc. Am. Math. Soc. 126, No. 11, 3377--3380 (1998; Zbl 0914.51008), \textit{S. Ball, A. Blokhuis} and \textit{F. Mazzocca}, Combinatorics 17, 31--41 (1997; Zbl 0880.51003)]; a motivation comes from the so-called ``strong cylinder conjecture [\textit{T. Szönyi} and \textit{Z. Weiner}, J. Comb. Theory, Ser. A 95, No. 1, 88--101 (2001; Zbl 0983.51006)]. Now from the generator matrix of \(C\) we obtain a set \(S\) in \(PG(k-1,q)\) with the property that each hyperplane is incident with a multiple of \(r\) points of \(S\). Then they prove the aforementioned bound by using properties of certain polynomials over finite fields.

Recommendations

• A Bound for the Maximum Weight of a Linear Code
• Maximum weight spectrum codes
• Some generalizations of extension theorems for linear codes over finite fields
• On the code generated by the incidence matrix of points and hyperplanes in \(\text{PG}(n,q)\) and its dual
• A new extension theorem for linear codes

Cites work

• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• An easier proof of the maximal arcs conjecture
• scientific article; zbMATH DE number 53945 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Maximal arcs in Desarguesian planes of odd order do not exist
• On the graph of a function in two variables over a finite field
• Research problems from the 19th British Combinatorial Conference
• Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
• Scattered spaces with respect to spreads, and eggs in finite projective spaces
• Small blocking sets in higher dimensions
• Some maximal arcs in finite projective planes

Cited in

(6)

• Maximum weight spectrum codes
• Generalizing Korchmáros-Mazzocca arcs
• A \(p\)-adic condition on the weight of a codeword of a linear code
• Finite Bolyai-Lobachevskii planes
• On linear codes of almost constant weight and the related arcs
• Lengths of divisible codes: the missing cases

This page was built for publication: On linear codes whose weights and length have a common divisor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876321)