Polarities, quasi-symmetric designs, and Hamada's conjecture

DOI10.1007/s10623-008-9249-8zbMath1247.05032OpenAlexW2166791550WikidataQ123281064 ScholiaQ123281064MaRDI QIDQ1009138

Vladimir D. Tonchev, Dieter Jungnickel

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-008-9249-8

zbMATH Keywords

DesignHamada's conjecturePolarityProjective geometryQuasi-symmetric design

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

Godsil-McKay switching and twisted Grassmann graphs, Kolmogorov width of discrete linear spaces: an approach to matrix rigidity, The weight distribution of the self-dual \([128,64\) polarity design code], Strongly regular configurations, Linearly embeddable designs, Extension sets, affine designs, and Hamada's conjecture, Maximal arcs and quasi-symmetric designs, Affine geometry designs, polarities, and Hamada's conjecture, Characterizing geometric designs. II., Recent results on designs with classical parameters, On weight distributions for a class of codes with parameters of Reed-Muller codes, Almost perfect and planar functions, A Hamada type characterization of the classical geometric designs, New invariants for incidence structures, On quasi-symmetric designs with intersection difference three, On small world non-Sunada twins and cellular Voronoi diagrams, Remarks on polarity designs, The number of designs with geometric parameters grows exponentially, On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements, Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey, Correction to: “Exponential bounds on the number of designs with affine parameters”, IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM

Cites Work

• A new bound on the number of designs with classical affine parameters
• On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
• The number of designs with classical parameters grows exponentially
• On affine designs and Hadamard designs with line spreads
• The number of designs with geometric parameters grows exponentially
• 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
• Automorphisms and isomorphisms of symmetric and affine designs
• Symmetric \((4,4)\)-nets and generalized Hadamard matrices over groups of order 4
• Some characterizations of quasi-symmetric designs with a spread
• Bounds on the number of affine, symmetric, and Hadamard designs and matrices
• Quasi-symmetric designs with good blocks and intersection number one
• Linear perfect codes and a characterization of the classical designs
• A characterization of projective subspaces of codimension two as quasi-symmetric designs with good blocks
• Majority logic decoding using combinatorial designs (Corresp.)
• Quasi‐Symmetric Designs with Good Blocks
• A class of majority logic decodable codes (Corresp.)
• On a class of majority-logic decodable cyclic codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item