Abstract
In this work we define and study binary codes \(C_{q,k}\) and \(\overline{C_{q,k}}\) obtained from neighborhood designs of Paley-type bipartite graphs P(q, k) and their complements, respectively for q an odd prime. We prove that for some values of q and k the codes \({C}_{q,k}\) are self-dual and the codes \(\overline{C_{q,k}}\) are self-orthogonal. Most of these codes tend to be with optimal or near optimal parameters. Next, we extend the codes \(C_{q,k}\) to get doubly even self dual codes and find that most of these codes are extremal.
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., Key, J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992) (Second printing with corrections 1993)
Babai, L., Gál, A., Kollár, J., Rónyai, L., Szabó, T., Wigderson, A.: Extremal bipartite graphs and superpolynomial lowerbounds for monotone span programs. In: Proceedings of ACM STOC’96, pp. 603–611
Carlet, C., Guilley, S.: Statistical properties of side-channel and fault injection attacks using coding theory. Cryptogr. Commun. 10, 909–933 (2018)
Conway, J.H., Sloane, N.J.A.: A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36(6), 1319–1333 (1990)
Gaborit, P.: Quadratic double circulant codes over fields. J. Comb. Theory Ser. A 97(1), 85–107 (2002)
Ghinelli, D., Key, J.D.: Codes from incidence matrices and line graphs of Paley graphs. Adv. Math. Commun. 5(1), 93–108 (2011)
Grassl, M.: Code tables. http://www.codetables.de
Dougherty, S.T., Gulliver, T.A., Harada, M.: Extremal binary self-dual codes. IEEE Trans. Inf. Theory 43(6), 2036–2047 (1997)
Kelley, J.B.: A characteristic property of quadratic residues. Proc. Am. Math. Soc. 5(1), 38–46 (1954)
Key, J.D., Limbupasiriporn, J.: Partial permutation decoding for codes from Paley graphs. Congr. Numer. 170, 143–155 (2005)
Lehmer, D.N.: Certain Theorems in the theory of quadratic residues. Am. Math. Mon. 20(5), 151–157 (1913)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 1st edn. North-Holland Mathematical Library, Amsterdam (1983)
Mallows, C.L., Sloane, N.J.A.: An upper bound for self-dual codes. Inf. Control 22, 188–200 (1973)
Massaki, H.: New doubly even self-dual codes having minimum weight 20. Adv. Math. Commun. 14(1), 89–96 (2020)
Paley, R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12, 311–320 (1933)
Perron, O.: Bemerkungen Über die Verteilung der quadratische Reste. Math. Z. 56, 122–130 (1952)
Pless, V.: A classification of self-orthogonal codes over GF(2). Discrete Math. 3(1–3), 209–246 (1972)
Rains, E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inf. Theory 44(1), 134–139 (1998)
Shi, M., Sok, L., Solé, P., Calkavur, S.: Self-dual codes and orthogonal matrices over large finite fields. Finite Fields Appl. 54, 297–314 (2018)
Tonchev, V.D.: Self-orthogonal designs and extremal doubly even codes. J. Comb. Theory Ser. A 52(2), 197–205 (1989)
van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fellah, N., Guenda, K., Özbudak, F. et al. Construction of self dual codes from graphs. AAECC (2022). https://doi.org/10.1007/s00200-022-00567-2
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00200-022-00567-2