Abstract
Linear codes with complementary duals (shortly named LCD codes) are linear codes whose intersection with their duals are trivial. In this paper, we give a method of constructing these type of linear codes from equitable partitions of association schemes. The LCD codes constructed in this paper are of length 2n and dimension n and have the property of being formally self-dual. To illustrate the method we construct LCD codes from some distance-regular graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alahmadi, A., Altassan, A., AlKenani, A., Çalkavur, S., Shoaib, H., Solé, P.: A multisecret-sharing scheme based on LCD codes. Mathematics 8(2), 272 (2020)
Araya, M., Harada, M., Saito, K.: Characterization and classification of optimal LCD codes. Des. Codes Cryptogr. 89, 617–640 (2021)
Bosma, W., Cannon, J.: Handbook of Magma Functions, Department of Mathematics, University of Sydney (1994). http://magma.maths.usyd.edu.au/magma
Bouyuklieva, S.: Optimal binary LCD codes. Des. Codes Cryptogr. (2021). https://doi.org/10.1007/s10623-021-00929-w
Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2012)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)
Brouwer, A.E.: Strongly regular graphs. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 852–868. Chapman & Hall/CRC, Boca Raton (2007)
Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10, 131–150 (2016)
Carlet, C., Mesnager, S., Tang, C., Qi, Y.: Linear codes over \(F_q\) which are equivalent to LCD codes for \(q>3\). IEEE Trans. Inform. Theory 64, 3010–3017 (2018)
Crnković, D., Egan, R., Rodrigues, B.G., Švob, A.: LCD codes from weighing matrices. Appl. Algebra Eng. Commun. Comput. 32, 175–189 (2021)
Crnković, D., Rukavina, S., Švob, A.: Self-orthogonal codes from equitable partitions of association schemes, preprint. arXiv:1903.01832
Fish, W., Key, J.D., Mwambene, E.: Special LCD codes from products of graphs. Appl. Algebra Eng. Commun. Comput. (2021). https://doi.org/10.1007/s00200-021-00517-4
Godsil, C.D., Martin, W.J.: Quotients of association schemes. J. Combin. Theory Ser. A 69, 185–199 (1995)
Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de
Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)
Kennedy, G.T., Pless, V.: On designs and formally self-dual codes. Des. Codes Cryptogr. 4, 43–55 (1994)
Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106(107), 337–342 (1992)
Sendrier, N.: Linear codes with complementary duals meet the Gilbert–Varshamov bound. Discrete Math. 304, 345–347 (2004)
Sok, L., Shi, M., Solé, P.: Constructions of optimal LCD codes over large finite fields. Finite Fields Appl. 50, 138–153 (2018)
Acknowledgements
This work has been fully supported by Croatian Science Foundation under the project 5713. The author would like to thank Dean Crnković for his valuable suggestions. Further, the author would like to thank the anonymous referees for helpful comments that improved the presentation of the paper.
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
Švob, A. LCD codes from equitable partitions of association schemes. AAECC 34, 889–896 (2023). https://doi.org/10.1007/s00200-021-00532-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-021-00532-5