A Hamada type characterization of the classical geometric designs

DOI10.1007/s10623-011-9580-3zbMath1245.05008OpenAlexW1981350535MaRDI QIDQ438902

Dieter Jungnickel, Vladimir D. Tonchev

Publication date: 31 July 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9580-3

zbMATH Keywords

classical designHamada conjecturetrace code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)

Related Items (4)

The geometric dimension of some small configurations ⋮ New invariants for incidence structures ⋮ On trace codes and Galois invariance over finite commutative chain rings ⋮ Remarks on polarity designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weight enumeration of codes from finite spaces
• Affine geometry designs, polarities, and Hamada's conjecture
• On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
• On affine designs and Hadamard designs with line spreads
• Galois invariance, trace codes and subfield subcodes
• Polarities, quasi-symmetric designs, and Hamada's conjecture
• Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture
• On projective and affine hyperplanes
• On the BIB design having the minimum p-rank
• A note on MDS codes, \(n\)-arcs and complete designs
• Symmetric \((4,4)\)-nets and generalized Hadamard matrices over groups of order 4
• Linear perfect codes and a characterization of the classical designs
• Majority logic decoding using combinatorial designs (Corresp.)
• A class of majority logic decodable codes (Corresp.)
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• On the Number of Information Symbols in Difference-Set Cyclic Codes
• On the p-rank of the design matrix of a difference set
• On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
• On a class of majority-logic decodable cyclic codes

This page was built for publication: A Hamada type characterization of the classical geometric designs