On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )

DOI10.1112/jlms/s2-26.2.365zbMath0545.94014OpenAlexW1992622204MaRDI QIDQ3337372

Robert Calderbank

Publication date: 1982

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-26.2.365

zbMATH Keywords

capsuniformly packed codee-error correcting codelinear representations of partial quadrangles

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial structures in finite projective spaces (51E20)

Related Items (16)

A survey of partial difference sets ⋮ The diophantine equation \(x^ 2=4q^{a/2}+4q+1\), with an application to coding theory ⋮ Some necessary conditions on the parameters of partial difference sets ⋮ On the 430-cap of \(\mathrm{PG}(6,4)\) having two intersection sizes with respect to hyperplanes ⋮ A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\) ⋮ On two-weight \(\mathbb {Z}_{2^k}\)-codes ⋮ On the diophantine equation \(x^ 2-D=4p^ n\) ⋮ Designs as maximum codes in polynomial metric spaces ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ SPG-reguli, SPG-systems, BLT-sets and sets with the BLT-property ⋮ Intriguing sets in partial quadrangles ⋮ On near-polygons and the Coxeter cap in PG(5,3) ⋮ Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\) ⋮ On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\) ⋮ On the Diophantine equation \(y^2=4q^n+4q+1\) ⋮ On a conjecture of Ma

This page was built for publication: On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )