One-step completely orthogonalizable codes from generalized quadrangles (Q1106809): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0890-5401(88)90053-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1989621268 / rank | |||
Normal rank |
Revision as of 01:47, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | One-step completely orthogonalizable codes from generalized quadrangles |
scientific article |
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