On linear codes whose weights and length have a common divisor
From MaRDI portal
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
- scientific article; zbMATH DE number 53945 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- 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
- 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)
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)
