Skip to main content
Log in

Linear complementary pairs of codes over rings

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this work, we first prove a necessary and sufficient condition for a pairs of linear codes over finite rings to be linear complementary pairs (abbreviated to LCPs). In particular, a judging criterion of free LCP of codes over finite commutative rings is obtained. Using the criterion of free LCP of codes, we construct a maximum-distance-separable (MDS) LCP of codes over ring \(\mathbb {Z}_4\). Then, all the possible LCP of codes over chain rings are determined. We also generalize the criterions for constacyclic and quasi-cyclic LCP of codes over finite fields to constacyclic and quasi-cyclic LCP of codes over chain rings. Finally, we give a characterization of LCP of codes over principal ideal rings. Under suitable conditions, we also obtain the judging criterion for a pairs of cyclic codes over principal ideal rings \(\mathbb {Z}_{k}\) to be LCP, and illustrate a MDS LCP of cyclic codes over the principal ideal ring \(\mathbb {Z}_{15}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bhowmick S., Fotue-Tabue A., Martínez-Moro E., Bandi R., Bagchi S.: Do non-free LCD codes over finite commutative Frobenius rings exist? Des. Codes Cryptogr. 88(5), 825–840 (2020).

    Article  MathSciNet  Google Scholar 

  2. Borello M., Cruz J., Willems W.: A note on linear complementary pairs of group codes. Discret. Math. 343(8), 111905 (2020).

    Article  MathSciNet  Google Scholar 

  3. Carlet C., Guilley S.: Complementary dual codes for counter-measures to side-channel attacks, Proceedings of the 4th ICMCTA Meeting. Palmela, Portugal (2014).

  4. Carlet C., Guilley S.: Complementary dual codes for counter-measures to side-channel attacks, Post-proceedings of the 4th International Castle Meeting, Palmela Castle, Portugal, September 15–18, 2014. J. Adv. Math. Commun. 10(1), 131–150 (2016).

    Article  Google Scholar 

  5. Carlet C., Güneri C., Mesnager S., Özbudak F.: Construction of some codes suitable for both side channel and fault injection attacks, Proceedings of International Workshop on the Arithmetic of Finite Fields (WAIFI 2018), Bergen (2018).

  6. Carlet C., Güneri C., Özbudak F., Özkaya B., Solé P.: On linear complementary pairs of codes. IEEE Trans. Inform. Theory 64(1), 6583–6588 (2018).

    Article  MathSciNet  Google Scholar 

  7. de la Cruz J., Willems W.: On group codes with complementary duals. Des. Codes Cryptogr. 86(9), 2065–2673 (2018).

    Article  MathSciNet  Google Scholar 

  8. Dougherty S.T., Liu H.: Independence of vectors in codes over rings. Des. Codes Cryptogr. 51, 55–68 (2009).

    Article  MathSciNet  Google Scholar 

  9. Dougherty S.T., Kim J.L., Kulosman H.: MDS codes over finite principal ideal rings. Des. Codes Cryptogr. 50, 77–79 (2009).

    Article  MathSciNet  Google Scholar 

  10. Dougherty S.T., Liu H., Park Y.H.: Lifts codes over finite chain rings. Math. J. Okayama Univ. 53, 39–53 (2011).

    MathSciNet  MATH  Google Scholar 

  11. Fan Y., Ling S., Liu H.: Matrix product codes over finite commutative Frobenius rings. Des. Codes Cryptogr. 71, 201–227 (2014).

    Article  MathSciNet  Google Scholar 

  12. Güneri C., Özkaya B., Sayıcı S.: On linear complementary pair of \(nD\) cyclic codes. IEEE Commun. Lett. 22, 2404–2406 (2018).

    Article  Google Scholar 

  13. Güneri C., Martínez-Moro E., Sayıcı S.: Linear complementary pair of group codes over finite chain rings. Des. Codes Cryptogr. 88, 2397–2405 (2020).

    Article  MathSciNet  Google Scholar 

  14. Kaplansky I.: Projective modules. Ann. Math. 68, 372–377 (1958).

    Article  MathSciNet  Google Scholar 

  15. Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes II: Chain rings. Des. Codes Cryptogr. 30, 113–130 (2003).

    Article  MathSciNet  Google Scholar 

  16. Liu X.S.: On the characterization cyclic codes over two classes of rings. Acta Mathematica Scientia 33B(2), 413–422 (2013).

    Article  MathSciNet  Google Scholar 

  17. Liu X.S., Liu H.: LCD codes over finite chain rings. Finite Field Appl. 15, 1–19 (2015).

    Article  MathSciNet  Google Scholar 

  18. Liu X.S., Liu H.: \(\sigma -\)LCD codes over finite chain rings. Des. Codes Cryptogr. 88, 727–746 (2020).

    Article  MathSciNet  Google Scholar 

  19. Liu Z., Wang J.: Linear complementary dual codes over rings. Des. Codes Cryptogr. 87, 3077–3086 (2019).

    Article  MathSciNet  Google Scholar 

  20. MacWilliams F.J., Sloane N.J.A.: The theory of error-correcting codes. North-Holland, Amsterdam (1977).

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  22. McDonald B.R.: Finite Rings with Identity. Marcel Dekker, New York (1974).

    MATH  Google Scholar 

  23. Ngo X. T., Bhasin S., Danger J.-L., Guilley S., Najm Z.: Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses, in Proc. IEEE Int. Symp. Hardw. Oriented Secur. Trust (HOST), 82-87 (2015).

  24. Norton G.H., Sǎlǎgean A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Commun. Comput. 10, 489–506 (2000).

    Article  MathSciNet  Google Scholar 

  25. Norton G.H., Sǎlǎgean A.: On the Hamming distance of linear over a finite chain ring. IEEE Trans. Inform. Theory 46, 1060–1067 (2000).

    Article  MathSciNet  Google Scholar 

  26. Shi M., Zhang Y.: Quasi-twisted codes with constacyclic constituent code. Finite Field Appl. 39, 159–178 (2016).

    Article  MathSciNet  Google Scholar 

  27. Shi M., Zhu S., Yang S.: A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb{F}_p[u]/(u^m)\). J. Franlkin Inst. 350(5), 927–937 (2013).

  28. Shi M., Qian L., Sok L., Solé P.: On self-dual negacirculant codes of index two and four. Des. Codes Cryptogr. 11, 2485–2494 (2018).

    Article  MathSciNet  Google Scholar 

  29. Shi M., Sok L., Solé P.: Self-dual codes and orthogonal matrices over large finite fields. Finite Field Appl. 54, 297–314 (2018).

    Article  MathSciNet  Google Scholar 

  30. Shi M., Huang D., Sok L., Solé P.: Double circulant LCD codes over \(\mathbb{Z}_4\). Finite Field Appl. 58, 133–144 (2019).

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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

X. Liu was supported by Research Funds of Hubei Province (Grant No. Q20174503). P. Hu was supported by Research Project of Hubei Polytechnic University (Grant No. numbers 17xjz03A ).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiusheng Liu.

Additional information

Communicated by J.-L. Kim.

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

Hu, P., Liu, X. Linear complementary pairs of codes over rings. Des. Codes Cryptogr. 89, 2495–2509 (2021). https://doi.org/10.1007/s10623-021-00933-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-021-00933-0

Keywords

Mathematics Subject Classification

Navigation