Linear perfect codes and a characterization of the classical designs
From MaRDI portal
Publication:1963164
DOI10.1023/A:1008314923487zbMath0940.05009MaRDI QIDQ1963164
Publication date: 24 January 2000
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25)
Related Items (max. 100)
The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ On Bonisoli's theorem and the block codes of Steiner triple systems ⋮ Weight enumeration of codes from finite spaces ⋮ A Hamada type characterization of the classical geometric designs ⋮ New invariants for incidence structures ⋮ Remarks on polarity designs ⋮ Symmetric \((4,4)\)-nets and generalized Hadamard matrices over groups of order 4 ⋮ The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\) ⋮ Polarities, quasi-symmetric designs, and Hamada's conjecture ⋮ Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
This page was built for publication: Linear perfect codes and a characterization of the classical designs
