Maximal arcs in projective three-spaces and double-error-correcting cyclic codes

DOI10.1006/jcta.2000.3064zbMath1022.94021OpenAlexW2035096461MaRDI QIDQ5929840

Henk D. L. Hollmann, Qing Xiang

Publication date: 13 July 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2000.3064

zbMATH Keywords

BCH codescyclic codemaximal arcs

Mathematics Subject Classification ID

Bounds on codes (94B65) Combinatorial structures in finite projective spaces (51E20) Cyclic codes (94B15)

Related Items (1)

Recent progress in algebraic design theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curve razionali normali e \(k\)-archi negli spazi finiti
• The solution to Beniamino Segre's problem \(I_ p,\),p=3, q=\(2^ k\).
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
• Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
• A Class of Exceptional Polynomials
• Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
• On the minimum distance of cyclic codes

This page was built for publication: Maximal arcs in projective three-spaces and double-error-correcting cyclic codes