On linear codes whose weights and length have a common divisor
From MaRDI portal
Publication:876321
DOI10.1016/J.AIM.2006.07.011zbMATH Open1118.51007OpenAlexW2032139439MaRDI QIDQ876321FDOQ876321
Aart Blokhuis, Simeon Ball, Peter Sziklai, Zsuzsa Weiner, András Gács
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- Maximal arcs in Desarguesian planes of odd order do not exist
- Small blocking sets in higher dimensions
- Some maximal arcs in finite projective planes
- On the graph of a function in two variables over a finite field
- Scattered spaces with respect to spreads, and eggs in finite projective spaces
- An easier proof of the maximal arcs conjecture
- Research problems from the 19th British Combinatorial Conference
Cited In (3)
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)
