Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

LCD codes from equitable partitions of association schemes

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. 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)

    Article  Google Scholar 

  2. Araya, M., Harada, M., Saito, K.: Characterization and classification of optimal LCD codes. Des. Codes Cryptogr. 89, 617–640 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bosma, W., Cannon, J.: Handbook of Magma Functions, Department of Mathematics, University of Sydney (1994). http://magma.maths.usyd.edu.au/magma

  4. Bouyuklieva, S.: Optimal binary LCD codes. Des. Codes Cryptogr. (2021). https://doi.org/10.1007/s10623-021-00929-w

    Article  MathSciNet  MATH  Google Scholar 

  5. Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2012)

    Book  MATH  Google Scholar 

  6. Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)

    Book  MATH  Google Scholar 

  7. 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)

    Google Scholar 

  8. Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10, 131–150 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. 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)

    Article  MathSciNet  MATH  Google Scholar 

  10. Crnković, D., Egan, R., Rodrigues, B.G., Švob, A.: LCD codes from weighing matrices. Appl. Algebra Eng. Commun. Comput. 32, 175–189 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  11. Crnković, D., Rukavina, S., Švob, A.: Self-orthogonal codes from equitable partitions of association schemes, preprint. arXiv:1903.01832

  12. 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

    Article  MATH  Google Scholar 

  13. Godsil, C.D., Martin, W.J.: Quotients of association schemes. J. Combin. Theory Ser. A 69, 185–199 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http://www.codetables.de

  15. Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  16. Kennedy, G.T., Pless, V.: On designs and formally self-dual codes. Des. Codes Cryptogr. 4, 43–55 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Massey, J.L.: Linear codes with complementary duals. Discrete Math. 106(107), 337–342 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sendrier, N.: Linear codes with complementary duals meet the Gilbert–Varshamov bound. Discrete Math. 304, 345–347 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sok, L., Shi, M., Solé, P.: Constructions of optimal LCD codes over large finite fields. Finite Fields Appl. 50, 138–153 (2018)

    Article  MathSciNet  MATH  Google Scholar 

Download references

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

  1. Department of Mathematics, University of Rijeka, Radmile Matejčić 2, 51000, Rijeka, Croatia

    Andrea Švob

Authors
  1. Andrea Švob
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Švob.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-021-00532-5

Keywords

Mathematics Subject Classification

Search

Navigation