Linear perfect codes and a characterization of the classical designs
From MaRDI portal
Recommendations
Cited in
(19)- On characterizing designs by their codes
- On extended cyclic codes, Reed-muller codes and related designs
- New invariants for incidence structures
- AG codes, \(t\)-designs and partition sets
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- A Hamada type characterization of the classical geometric designs
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Weight enumeration of codes from finite spaces
- Symmetric \((4,4)\)-nets and generalized Hadamard matrices over groups of order 4
- Remarks on polarity designs
- scientific article; zbMATH DE number 1455270 (Why is no real title available?)
- A note on MDS codes, \(n\)-arcs and complete designs
- Polarities, quasi-symmetric designs, and Hamada's conjecture
- The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\)
- scientific article; zbMATH DE number 4110625 (Why is no real title available?)
- scientific article; zbMATH DE number 2185736 (Why is no real title available?)
- Designs from subcode supports of linear codes
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
This page was built for publication: Linear perfect codes and a characterization of the classical designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963164)
