Abstract
We examine binary and ternary codes from adjacency matrices of the Peisert graphs, \({\mathcal {P}}^*(q)\), and the generalized Peisert graphs, \(G{\mathcal {P}}^*(q)\), in particular those instances where the code is LCD and the dual of the code from the graph is the code from the reflexive graph. This occurs for all the binary codes and for those ternary codes for which \(q {\;\equiv 1}{ (\mathrm{mod}~3)}\). We find words of small weight in the codes, which, in the reflexive case, are likely to be minimum words. In addition we propose a decoding algorithm that can be feasible for these LCD codes.
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. Cambridge University Press, Cambridge, Vol. 103 (1992) (Second printing with corrections, 1993)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symbol. Comput. 24(3/4), 235–265 (1997)
Cameron, P.J., van Lint, J.H.: Designs, Graphs, Codes and Their Links. Cambridge University Press, Cambridge (1991) (London Mathematical Society Student Texts 22)
Cannon, J., Steel, A., White, G.: Linear codes over finite fields. In: Cannon, J., Bosma, W. (eds.) Handbook of Magma Functions, pp. 3951–4023. Computational Algebra Group, Department of Mathematics, University of Sydney, V2.13 (2006). http://magma.maths.usyd.edu.au/magma
Cary Huffman, W.: Codes and groups. In: Pless V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Vol. 2, Part 2, Chapter 17, pp. 1345–1440. Elsevier, Amsterdam (1998)
Key, J.D., Rodrigues, B.G.: \({LCD}\) codes from adjacency matrices of graphs. Appl. Algebra Engrg. Comm. Comput. 29(3), 227–244 (2018)
Limbupasiriporn, J.: Partial permutation decoding for codes from designs and finite geometries. Ph.D. thesis, Clemson University (2005)
Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106(107), 337–342 (1992)
Mullin, N.: Self-complementary arc-transitive graphs and their imposters. Master’s thesis, University of Waterloo, (2009)
Peisert, W.: All self-complementary symmetric graphs. J. Algebra 240, 209–229 (2001)
Sin, P.: The critical groups of the Peisert graphs \({\cal{P}}^*(q)\). J. Algebraic Combin. 48(2), 227–245 (2018). https://doi.org/10.1007/s10801-017-0797-8; arXiv: 1606.00870v1
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.
This work is based on the research supported by the National Research Foundation of South Africa (Grant Numbers 95725 and 106071).
Rights and permissions
About this article
Cite this article
Key, J.D., Rodrigues, B.G. Special LCD Codes from Peisert and Generalized Peisert Graphs. Graphs and Combinatorics 35, 633–652 (2019). https://doi.org/10.1007/s00373-019-02019-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02019-0