Abstract
It is shown how LCD codes with a particularly useful feature can be found from row spans over finite fields of adjacency matrices of graphs by considering these together with the codes from the associated reflexive graphs and complementary graphs. Application is made to some particular classes, including uniform subset graphs and strongly regular graphs where, if a p-ary code from a graph has this special LCD feature, the dimension can be found from the multiplicities modulo p of the eigenvalues of an adjacency matrix and, bounds on the minimum weight of the code and the dual code follow from the valency of the graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Araujo, J., Bratten, T.: On the spectrum of the Johnson graphs \({J}(n,k,r)\). In: Proceedings of the XXIIrd “Dr. Antonio A. R. Monteiro” Congress, 2016, Univ. Nac. Sur Dep. Mat. Inst. Mat., Baha Blanca, pp. 57–62 (2015)
Assmus Jr., E.F., Key, J.D.: Designs and Their Codes. Cambridge Tracts in Mathematics, vol. 103. Cambridge University Press, Cambridge (1992). (Second printing with corrections, 1993)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symb. Comput. 24(3/4), 235–265 (1997)
Brouwer, A.E., van Eijl, C.J.: On the \(p\)-rank of the adjacency matrices of strongly regular graphs. J. Algebr. Comb. 1, 329–346 (1992)
Brouwer, A.E., Haemers, W.H.: Association schemes. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, Chapter 15, vol. 1, pp. 749–771. Elsevier, MIT, Cambridge (1995)
Cameron, P.J., van Lint, J.H.: Designs, Graphs, Codes and Their Links. London Mathematical Society Student Texts 22. Cambridge University Press, Cambridge (1991)
Cannon, J., Steel, A., White, G.: Linear codes over finite fields. In: Cannon, J., Bosma, W.(eds.) Handbook of Magma Functions, Computational Algebra Group, Department of Mathematics, University of Sydney, V2.13, pp. 3951–4023. http://magma.maths.usyd.edu.au/magma (2006)
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Technical Report, Philips Research Laboratorie, Philips Research Reports, Supplement No. 10 (1973)
Delsarte, P., Levenshtein, V.I.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44, 2477–2504 (1998)
Fish, W., Fray, R., Mwambene, E.: Binary codes and partial permutation decoding sets from the odd graphs. Cent. Eur. J. Math. 12(9), 1362–1371 (2014)
Fish, W., Key, J.D., Mwambene, E.: Codes from adjacency matrices of uniform subset graphs, (Submitted)
Fish, W., Key, J.D., Mwambene, E.: Codes, designs and groups from the Hamming graphs. J. Comb. Inf. Syst. Sci. 34(1–4), 169–182 (2009)
Fish, W., Key, J.D., Mwambene, E.: Graphs, designs and codes related to the \(n\)-cube. Discrete Math. 309, 3255–3269 (2009)
Fish, W., Key, J.D., Mwambene, E.: Ternary codes from reflexive graphs on \(3\)-sets. Appl. Algebr. Eng. Commun. Comput. 25, 363–382 (2014)
Fish, W., Key, J.D., Mwambene, E., Rodrigues, B.G.: Hamming graphs and LCD codes, (In preparation)
Fish, W.: Codes from uniform subset graphs and cycle products. Ph.D. Thesis, University of the Western Cape (2007)
Fish, W., Key, J.D., Mwambene, E.: Binary codes from reflexive graphs on \(3\)-sets. Adv. Math. Commun. 9, 211–232 (2015)
Ghinelli, D., Key, J.D., McDonough, T.P.: Hulls of codes from incidence matrices of connected regular graphs. Des. Codes Cryptogr. 70, 35–54 (2014). doi:10.1007/s10623-012-9635-0
Haemers, W.H., Peeters, R., van Rijckevorsel, J.M.: Binary codes of strongly regular graphs. Des. Codes Cryptogr. 17, 187–209 (1999)
Huffman, W.C.: Codes and groups. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Volume 2, Part 2, Chapter 17, pp. 1345–1440. Elsevier, Amsterdam (1998)
Key, J.D., Moori, J., Rodrigues, B.G.: Binary codes from graphs on triples. Discrete Math. 282(1–3), 171–182 (2004)
Key, J.D., Moori, J., Rodrigues, B.G.: Permutation decoding for binary codes from triangular graphs. Eur. J. Comb. 25, 113–123 (2004)
Key, J.D., Moori, J., Rodrigues, B.G.: Ternary codes from graphs on triples. Discrete Math. 309, 4663–4681 (2009)
Key, J.D., Fish, W., Mwambene, E.: Codes from the incidence matrices and line graphs of Hamming graphs \({H}^k(n,2)\) for \(k \ge 2\). Adv. Math. Commun. 5, 373–394 (2011)
Krebs, M., Shaheen, A.: On the spectra of Johnson graphs. Electron. J. Linear Algebr. 17, 154–167 (2008)
Leemans, D., Rodrigues, B.G.: Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph. Math. Commun. 21(2), 239–249 (2016)
Limbupasiriporn, J., Limbupasiriporn, P.: Codes from adjacency matrices of generalized Paley graphs (in preparation)
Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106/107, 337–342 (1992)
Rodrigues, B.G.: Linear codes with complementary duals related to the complement of the Higman-Sims graph, To appear: Bull. Iran. Math. Soc
Seneviratne, P., Limbupasiriporn, J.: Permutation decoding of codes from generalized Paley graphs. Appl. Algebra Eng. Commun. Comput. 24, 225–236 (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Key, J.D., Rodrigues, B.G. LCD codes from adjacency matrices of graphs. AAECC 29, 227–244 (2018). https://doi.org/10.1007/s00200-017-0339-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-017-0339-6