Abstract
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
Similar content being viewed by others
References
A. A. Bruen and D. L. Wehlau, Maximal caps, line free sets and quasi-perfect codes, submitted.
Aiden A. Bruen, L. Haddad and D. L. Wehlau, Binary codes and caps, J.C.D., Vol. 6,No. 4 (1998) pp. 275-284.
R. C. Bose and J. N. Srivastava, On a bound useful in the theory of factorial designs and error correcting codes, Ann. Math. Stat., Vol. 35,No. 1 (1964) pp. 408-414.
W. Edwin Clark, Blocking sets in finite projective spaces and uneven binary codes, Discrete Math., Vol. 94 (1991) pp. 65-68.
W. E. Clark, L. A. Dunning and D. G. Rogers, Binary set functions and parity check matrices, Discrete Math., Vol. 80 (1990) pp. 249-265.
A. A. Davydov and L. M. Tombak, Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry, Problems of Information Transmission, Vol. 25,No. 4 (1990) pp. 265-275.
T. Helleseth, On the covering radius codes, Discr. Appl. Math., Vol. 11,No. 2 (1985) pp. 151-173.
R. Hill, Caps and codes, Discrete Math, Vol. 22,No. 2 (1978) pp. 111-137.
J. H. B. Kemperman, On small sumsets in an abelian group, Acta. Math. Stockholm, Vol. 103,Nos. 1–2 (1960) pp. 62-88.
M. Kneser, Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen, Math. Z., Vol. 61 (1955) pp. 429-434.
M. Kneser, Summenmengen in Iokalkompakten abelschen Gruppen, Math. Z., Vol. 66 (1956) pp. 88-110.
B. Segre, Introduction to Galois geometries, Atti. Accad. Naz. Lincei Memorie, Vol. 8 (1967) pp. 133-236.
G. Tallini, On caps of kind r in a Galois r-dimensional space, Acta Arithmet., Vol. 7,No. 1 (1961) pp. 19-28.
W. T. Tutte, Colouring problems, Math. Intelligencer, Vol. 0 (1977) pp. 72-75.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bruen, A.A., Wehlau, D.L. Long Binary Linear Codes and Large Caps in Projective Space. Designs, Codes and Cryptography 17, 37–60 (1999). https://doi.org/10.1023/A:1008346303015
Issue Date:
DOI: https://doi.org/10.1023/A:1008346303015