Abstract
Recently Jungnickel and Tonchev have shown that there exist at least four inequivalent binary selfcomplementary [28, 7, 12] codes and have asked if there are other [28, 7] codes with weight distributionA 0=A 28=1,A 12=A 16=63. In the present paper we give a negative answer: these four codes are, up to equivalence, the only codes with the given parameters. Their residuals are also classified.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Assmus, E.F., Jr. and Key, J.D. 1989. Arcs and ovals in the Hermitian and Ree unitals.Europ. J. Combinatorics 10: 297–308.
Beth, Th., Jungnickel, D., and Lenz, H. 1986.Design Theory. Mannheim: B.I. Wissenschaftsverlag, 1985, and Cambridge: Cambridge Univ. Press.
Brouwer, A.E. 1981. Some unitals on 28 points and their embeddings in projective plans of order 9. In Georetries and Group, (M. Aigner and D. Jungnickel, eds.) Lect. Notes in Math., Vol. 893:183–189. Berlin: Springer.
Dodunecov, S.M. and Encheva, S. B. 1988. On the uniqueness of some linear subcodes of the binary extended Golay code.Proc. of the Int. Workshop Alg. Comb. Coding Theory. Varna, Bulgaria, pp. 38–40.
Gibbons, P. 1976. Computing techniques for the construction and analysis of block designs. Dept. of Computer Science, Univ. of Tononto, Technical Report 92/76.
Grey, L.D. 1962. Some bounds for error-correcting codes.IEEE Trans. Info. Theory. 8:200–202.
Jungnickel, D. and Tonchev, V.D. 1992. Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound.Design, Codes and Crypotography 1:247–253.
Jungnickel, D. and Tonchev, V.D. 1992. On symmetric and quasi-symmetric designs with the symmetric difference property and their codes.J. Combin. Theory A 59:40–50.
Kantor, W.M. 1975. Symplectic groups, symmetric designs and line ovals.J. Algebra 33:43–58.
Kantor, W.M. 1983. Exponential numbers of two-weight codes, difference sets and symmetric designs.Discr. Math. 46: 95–98.
MacWilliams, F.J. and Sloane, N.J.A. 1977.The Theory of Error-Correcting Codes. Amsterdam: North-Holland.
Mathon, R. and Rosa, A., 1990. Tables of parameters of BIBDs withr≤41 including existence, enumeration and resolvability results: an update.Ars Combinatoria 30: 65–96.
Parker, C., Spence, E., and Tonchev, V.D. Designs with the symmetric difference property on 64 points and their groups.J. Combin. Theory A (to appear).
Pless, V. 1972. A classification of self-orthogonal codes over GF(2).Discrete Math. 3: 209–246.
Rankin, R.A. 1955. The closest packing of spherical caps inn-dimensions.Proc. Glasgow Math. Assoc. 2:139–144.
Rankin, R.A. 1956. On the minimal points of positive definite quadratic forms.Mathematica 3: 15–24.
van Tilborg, H.C.A. 1981. The smallest length of binary 7-dimensional linear codes with prescribed minimum distance.Discrete Math. 33: 197–207.
Tonchev, V.D. 1988.Combinatorial Configurations, Longman Scientific and Technical. New York: Wiley.
Tonchev, V.D. Quasi-symmetric designs, codes, quadratics, and hyperplane sections.Geometriae Dedicata (to appear).
Verhoeff, T. 1987. An updated table of minimum distance bounds for binary linear codes.IEEE Trans. Info. Theory 33:665–680.
Author information
Authors and Affiliations
Additional information
Communicated by D. Jungnickel
This work has been done during the visit of the author as a guest researcher to the Department of Electrical Engineering at Linköping University, Sweden. The research was partially supported by the Bulgarian National Science Foundation under contracts No. 37/1987 and No. 876/1988.
Rights and permissions
About this article
Cite this article
Dodunekov, S.M., Encheva, S.B. & Kapralov, S.N. On the [28, 7, 12] binary self-complementary codes and their residuals. Des Codes Crypt 4, 57–67 (1994). https://doi.org/10.1007/BF01388560
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388560