본문 바로가기
KERD
논문KCI 등재

On LCD codes over finite chain rings

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. LCD cyclic codes have been known as reversible cyclic codes that had applications in data storage. Due to a newly discovered application in cryptography, interest in LCD codes has increased again. Although LCD codes over finite fields have been extensively studied so far, little work has been done on LCD codes over chain rings. In this paper, we are interested in structure of LCD codes over chain rings. We show that LCD codes over chain rings are free codes. We provide some necessary and sufficient conditions for an LCD code $C$ over finite chain rings in terms of projections of linear codes. We also showed the existence of asymptotically good LCD codes over finite chain rings.

Abstract

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. LCD cyclic codes have been known as reversible cyclic codes that had applications in data storage. Due to a newly discovered application in cryptography, interest in LCD codes has increased again. Although LCD codes over finite fields have been extensively studied so far, little work has been done on LCD codes over chain rings. In this paper, we are interested in structure of LCD codes over chain rings. We show that LCD codes over chain rings are free codes. We provide some necessary and sufficient conditions for an LCD code $C$ over finite chain rings in terms of projections of linear codes. We also showed the existence of asymptotically good LCD codes over finite chain rings.

참고문헌 (23)

  1. A. R. Calderbank, "Modular andp-adic cyclic codes", Designs, Codes and Cryptography, 6(1), pp.21~35 (1995), Springer Science and Business Media LLC[DOI]
  2. Claude Carlet, "Complementary dual codes for counter-measures to side-channel attacks", Advances in Mathematics of Communications, 10(1), pp.131~150 (2016), American Institute of Mathematical Sciences (AIMS)[DOI]
  3. Claude Carlet, "Linear Codes Over $\mathbb F_q$ Are Equivalent to LCD Codes for $q>3$", IEEE Transactions on Information Theory, 64(4), pp.3010~3017 (2018), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  4. Steven T. Dougherty, "The combinatorics of LCD codes: linear programming bound and orthogonal matrices", International Journal of Information and Coding Theory, 4(2, pp.3) (2017), 116~128[DOI]
  5. M. Esmaeili, "On complementary-dual quasi-cyclic codes", Finite Fields and Their Applications, 15(3), pp.375~386 (2009), Elsevier BV[DOI]
  6. Yun Fan, "Matrix product codes over finite commutative Frobenius rings", Designs, Codes and Cryptography, 71(2), pp.201~227 (2014), Springer Science and Business Media LLC[DOI]
  7. Cem Güneri, "Quasi-cyclic complementary dual codes", Finite Fields and Their Applications, 42, pp.67~80 (2016), Elsevier BV[DOI]
  8. M. Hazewinkel, "Handbook of Algebra. Vol. 5", pp.2008, Elsevier
  9. T. Honold, "Linear codes over finite chain rings", Electron. J. Combin, 7, pp.22~ (2000)
  10. Lingfei Jin, "Construction of MDS codes with complementary duals", IEEE Transactions on Information Theory, 63(5), pp.2843~2847 (2016), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  11. Chengju Li, "Hermitian LCD codes from cyclic codes", Designs, Codes and Cryptography, 86(10), pp.2261~2278 (2018), Springer Science and Business Media LLC[DOI]
  12. Xiusheng Liu, "LCD codes over finite chain rings", Finite Fields and Their Applications, 34, pp.1~19 (2015), Elsevier BV[DOI]
  13. J. L. Massey, "Reversible codes", Information and Control, 7, pp.369~380 (1964)
  14. James L. Massey, "Linear codes with complementary duals", Discrete Mathematics, 106-107, pp.337~342 (1992), Elsevier BV[DOI]
  15. B. R. McDonald, "Finite Rings with Identity" (1974), Marcel Dekker, Inc
  16. Sihem Mesnager, "Complementary Dual Algebraic Geometry Codes", IEEE Transactions on Information Theory, 64(4), pp.2390~2397 (2018), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  17. G.H. Norton, "On the Hamming distance of linear codes over a finite chain ring", IEEE Transactions on Information Theory, 46(3), pp.1060~1067 (2000), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  18. Graham H. Norton, "On the Structure of Linear and Cyclic Codes over a Finite Chain Ring", Applicable Algebra in Engineering, Communication and Computing, 10(6), pp.489~506 (2000), Springer Science and Business Media LLC[DOI]
  19. Nicolas Sendrier, "Linear codes with complementary duals meet the Gilbert–Varshamov bound", Discrete Mathematics, 285(1-3), pp.345~347 (2004), Elsevier BV[DOI]
  20. Lin Sok, "Constructions of optimal LCD codes over large finite fields", Finite Fields and Their Applications, 50, pp.138~153 (2018), Elsevier BV[DOI]
  21. Jay Alan Wood, "Duality for modules over finite rings and applications to coding theory", American Journal of Mathematics, 121(3), pp.555~575 (1999), Project Muse[DOI]
  22. Xiang Yang, "The condition for a cyclic code to have a complementary dual", Discrete Mathematics, 126(1-3), pp.391~393 (1994), Elsevier BV[DOI]
  23. HONGWEI ZHU, "ON LINEAR COMPLEMENTARY DUAL FOUR CIRCULANT CODES", Bulletin of the Australian Mathematical Society, 98(1), pp.159~166 (2018), Cambridge University Press (CUP)[DOI]

관련 논문AI추천

이 간행물의 다른 논문 (18건)