Finite geometry designs, codes, and Hamada's conjecture
The coding-theoretical interest in combinatorial designs defined by subspaces of a finite geometry was motivated in the 1960's by their use for the construction of majority-logic decodable codes. In 1973, Hamada computed the ranks of the incidence matrices of finite geometry designs over the underlying finite field and made the conjecture that geometric designs have minimum rank among all designs with the given parameters. In all proved cases of the conjecture, the geometric designs not only have minimum rank, but are also the unique (up to isomorphism) designs of minimum rank. Until recently, only a handful of non-geometric designs were known that share the same rank with geometric designs. This paper discusses some recently discovered infinite families of non-geometric designs that have the same parameters and the same rank as certain geometric designs.
Information Security, Coding Theory and Related Combinatorics
Finite geometry designs, codes, and Hamada's conjecture.
Information Security, Coding Theory and Related Combinatorics,
Retrieved from: https://digitalcommons.mtu.edu/math-fp/98