Abstract
We construct self-orthogonal binary codes from projective 2 - (v, k, λ) designs with a polarity, k odd, and λ even. We give arithmetic conditions on the parameters of the design to obtain self-dual or doubly even self-dual codes. Non existence results in the latter case are obtained from rationality conditions of certain strongly regular graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. F. Assmus, Jr., H. F. Mattson, Jr., Algebraic theory of codes II, AFCRL-71-0013, Final Report, 15 October 1970, Part II.
P. Cameron, J. H. van Lint, Graphs, codes, and designs, Cambridge University Press, 1980.
M. Hall, Jr., Combinatorial Theory, Wiley, 1986.
R. H. F. Denniston, On biplanes with 56 points, Ars. Combin., 9 (1980), pp. 167–169.
V. Pless, A classification of self-orthogonal codes over GF(2)., Discr. Math., 3 (1972), pp. 209–346.
P. Dembowski, Finite Geometries, Springer, 1968.
J. W. P. Hirschfeld, Projective Geometries over Finite Fields, Clarendon Press, 1979.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Solé, P. (1990). Self-Dual Codes and Self-Dual Designs. In: Coding Theory and Design Theory. The IMA Volumes in Mathematics and Its Applications, vol 20. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8994-1_14
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8994-1_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8996-5
Online ISBN: 978-1-4613-8994-1
eBook Packages: Springer Book Archive