One-step completely orthogonalizable codes from generalized quadrangles (Q1106809)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: One-step completely orthogonalizable codes from generalized quadrangles |
scientific article; zbMATH DE number 4062992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-step completely orthogonalizable codes from generalized quadrangles |
scientific article; zbMATH DE number 4062992 |
Statements
One-step completely orthogonalizable codes from generalized quadrangles (English)
0 references
1988
0 references
For \(q\) any power of two, the dual \(D_q\) of the binary linear code spanned by the lines of the regular \((q,q)\)-generalized quadrangle \(W(q)\) is shown to be a \(q\)-error correcting one-step completely orthogonalizable code of length \(q^3+q^2+q+1\). By a previous result of the authors [Geom. Dedicata 22, 137--147 (1987; Zbl 0609.51011)], the rate of \(D_q\) is at least half in the limit as \(q\to \infty\). We also determine the full automorphism group and maximum weight of \(D_q\) and the minimum weight of its dual.
0 references
binary linear code
0 references
0.8061231970787048
0 references
0.7713524699211121
0 references
0.7695438265800476
0 references
0.7632851600646973
0 references