On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code

DOI10.1109/TIT.1983.1056664zbMath0505.94014OpenAlexW2128821244MaRDI QIDQ4742690

Andries E. Brouwer

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056664

zbMATH Keywords

graphcombinatorial structurevertex

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial geometries and geometric closure systems (51D20) Theory of error-correcting codes and error-detecting codes (94B99) Other finite incidence structures (geometric aspects) (51E30)

Related Items

Distance-regular graphs of Hamming type, 1-homogeneous graphs with cocktail party \({\mu}\)-graphs, Distinguishing graphs via cycles, Pseudo primitive idempotents and almost 2-homogeneous bipartite distance-regular graphs, On subgraphs in distance-regular graphs, The Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes, Almost 2-homogeneous bipartite distance-regular graphs, Some formulas for spin models on distance-regular graphs, Locally triangular graphs and rectagraphs with symmetry, On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group \(M_{12}\))