Skip to main content
SpringerLink
Log in

A generalization of cyclic code equivalence algorithm to constacyclic codes

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

Abstract

Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes. As an application of the algorithm we found many constacyclic codes with good parameters and properties. In particular, we found 22 new codes that improve the minimum distances of best known linear codes (BKLCs).

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

Access this article

Log in via an institution

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

References

  1. Aydin N., Guidotti T., Liu P.: Good classical and quantum codes from multi-twisted codes. CoRR arXiv:2008.07037 (2020)

  2. Aydin N., Halilović A.: A generalization of quasi-twisted codes: multi-twisted codes. Finite Fields Appl. 45, 96–106 (2017). https://doi.org/10.1016/j.ffa.2016.12.002.

    Article  MathSciNet  MATH  Google Scholar 

  3. Aydin N.O., Vandenberg R.O.: A new algorithm for equivalence of cyclic codes and its applications. Appl. Algebra Eng. Commun. Comput. (2021). https://doi.org/10.1007/s00200-021-00525-4.

    Article  Google Scholar 

  4. Aydin N., Siap I., Ray-Chaudhuri D.K.: The structure of 1-generator quasi-twisted codes and new linear codes. Des. Codes Cryptogr. 24(3), 313–326 (2001). https://doi.org/10.1023/a:1011283523000.

    Article  MathSciNet  MATH  Google Scholar 

  5. Aydin N., Connolly N., Murphree J.: New binary linear codes from quasi-cyclic codes and an augmentation algorithm. Appl. Algebra Eng. Commun. Comput. 28(4), 339–350 (2017). https://doi.org/10.1007/s00200-017-0327-x.

    Article  MathSciNet  MATH  Google Scholar 

  6. Aydin N., Connolly N., Grassl M.: Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes. Adv. Math. Commun. 11(1), 245–258 (2017). https://doi.org/10.3934/amc.2017016.

    Article  MathSciNet  MATH  Google Scholar 

  7. Aydin N., Lambrinos J., Vandenberg O.: On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes. Des. Codes Cryptogr. 87(10), 2199–2212 (2019). https://doi.org/10.1007/s10623-019-00613-0.

    Article  MathSciNet  MATH  Google Scholar 

  8. Aydin N., Guidotti T.H., Liu P., Shaikh A.S., Vandenberg R.O.: Some generalizations of the ASR search algorithm for quasitwisted codes. Involve J. Math. 13(1), 137–148 (2020). https://doi.org/10.2140/involve.2020.13.137.

    Article  MathSciNet  MATH  Google Scholar 

  9. Calderbank A.R., Rains E.M., Shor P.W., Sloane N.J.A.: Quantum error correction and orthogonal geometry. Phys. Rev. Let. 78(3), 405–408 (1997). https://doi.org/10.1103/physrevlett.78.405.

    Article  MathSciNet  MATH  Google Scholar 

  10. Chen E.: Quasi-cyclic codes: bounds on the parameters of of QC codes. http://www.tec.hkr.se/~chen/research/codes/qc.htm. Accessed Aug 2021

  11. Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015). https://doi.org/10.1109/tit.2015.2473861.

    Article  MathSciNet  MATH  Google Scholar 

  12. Dinh H.Q., Bag T., Upadhyay A.K., Ashraf M., Mohammad G., Chinnakum W.: Quantum codes from a class of constacyclic codes over finite commutative rings. J. Algebra Appl. 19(12), 2150003 (2019). https://doi.org/10.1142/s0219498821500031.

    Article  MathSciNet  MATH  Google Scholar 

  13. Gottesman D.: Class of quantum error-correcting codes saturating the quantum hamming bound. Phys. Rev. A 54(3), 1862–1868 (1996). https://doi.org/10.1103/physreva.54.1862.

    Article  MathSciNet  Google Scholar 

  14. Grassl M.: Code tables: bounds on the parameters of codes. http://www.codetables.de/. Accessed Aug 2021

  15. Group M.: Magma computer algebra system. http://magma.maths.usyd.edu.au/calc/. Accessed Aug 2021

  16. Gulliver T.A., Venkaiah V.C.: Construction of quasi-twisted codes and enumeration of defining polynomials. J. Algebra Comb. Discret. Struct. Appl. (2019). https://doi.org/10.13069/jacodesmath.645015.

    Article  MATH  Google Scholar 

  17. Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003) https://doi.org/10.1017/cbo9780511807077.

    Book  MATH  Google Scholar 

  18. Koroglu M., Siap I.: A class of constacyclic codes from group algebras. Filomat 31(10), 2917–2923 (2017). https://doi.org/10.2298/fil1710917k.

    Article  MathSciNet  MATH  Google Scholar 

  19. Lu L., Li R., Fu Q., Xuan C., Ma W.: Optimal ternary linear complementary dual codes. CoRR arXiv:2012.12093 (2020)

  20. Massey J.L.: Reversible codes. Inf. Control 7(3), 369–380 (1964). https://doi.org/10.1016/s0019-9958(64)90438-3.

    Article  MathSciNet  MATH  Google Scholar 

  21. Massey J.L.: Linear codes with complementary duals. Discret. Math. 106–107, 337–342 (1992). https://doi.org/10.1016/0012-365x(92)90563-u.

    Article  MathSciNet  MATH  Google Scholar 

  22. Petrank E., Roth R.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602–1604 (1997). https://doi.org/10.1109/18.623157.

    Article  MathSciNet  MATH  Google Scholar 

  23. Steane A.M.: Error correcting codes in quantum theory. Phys. Rev. Let. 77(5), 793–797 (1996). https://doi.org/10.1103/physrevlett.77.793.

    Article  MathSciNet  MATH  Google Scholar 

  24. Vardy A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theory 43(6), 1757–1766 (1997). https://doi.org/10.1109/18.641542.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Kenyon College, Gambier, OH, 43022, USA

    Dev Akre, Nuh Aydin, Matthew Harrington & Saurav Pandey

Authors
  1. Dev Akre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nuh Aydin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matthew Harrington
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Saurav Pandey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nuh Aydin.

Additional information

Communicated by G. Ge.

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Akre, D., Aydin, N., Harrington, M. et al. A generalization of cyclic code equivalence algorithm to constacyclic codes. Des. Codes Cryptogr. 91, 763–777 (2023). https://doi.org/10.1007/s10623-022-01124-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-022-01124-1

Keywords

Mathematics Subject Classification

Search

Navigation