One-step completely orthogonalizable codes from generalized quadrangles

DOI10.1016/0890-5401(88)90053-3zbMath0651.94010OpenAlexW1989621268MaRDI QIDQ1106809

N. S. Narasimha Sastry, Bhaskar Bagchi

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90053-3

zbMATH Keywords

binary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items

Binary codes of the symplectic generalized quadrangle of even order, Even order inversive planes, generalized quadrangles and codes, Elliptic ovoids and their rosettes in a classical generalized quadrangle of even order, Ovoidal fibrations in \(\mathrm{PG}(3,q),q\) even, Algebraic Codes and Geometry of Some Classical Generalized Polygons, Intersection pattern of the classical ovoids in symplectic 3-space of even order, Two characterizations of even order Miquelian inversive planes

Cites Work

• Even order inversive planes, generalized quadrangles and codes
• Codes associated with generalized polygons
• On semipartial geometries
• Moufang Conditions for Finite Generalized Quadrangles
• A Class of Strongly Regular Graphs Related to Orthogonal Groups
• Difference-Set Cyclic Codes
• Reachable sets for linear dynamical systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item