Skip to main content
SpringerLink
Log in

MDS symbol-pair codes from repeated-root cyclic codes

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

Abstract

Symbol-pair codes are proposed to protect against pair-errors in symbol-pair read channels. The research of symbol-pair codes with the largest possible minimum symbol-pair distance is of great significance since such codes have the best error-correcting capability. A symbol-pair code meeting the Singleton bound is called a maximum distance separable (MDS) symbol-pair code. In this paper, two new classes of MDS symbol-pair codes are proposed by utilizing repeated-root cyclic codes over finite fields with odd characteristic. It should be noted that these codes have minimum symbol-pair distance ten or twelve.

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. Cassuto Y., Blaum M.: Codes for symbol-pair read channels. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 988–992 (2010)

  2. Cassuto Y., Blaum M.: Codes for symbol-pair read channels. IEEE Trans. Inf. Theory 57(12), 8011–8020 (2011).

    Article  MathSciNet  Google Scholar 

  3. Cassuto Y., Litsyn S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 2348–2352 (2011)

  4. Castagnoli G., Massey J.L., Schoeller P.A., von Seemann N.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 337–342 (1991).

    Article  MathSciNet  Google Scholar 

  5. Chee Y. M., Kiah H. M., Wang C.: Maximum distance separable symbol-pair codes. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 2886–2890 (2012)

  6. Chee Y.M., Ji L., Kiah H.M., Wang C., Yin J.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59(11), 7259–7267 (2013).

    Article  MathSciNet  Google Scholar 

  7. Chen B., Dihn H.Q., Fan Y., Ling S.: Polynomial constacyclic codes. IEEE Trans. Inf. Theory 61(9), 4895–4904 (2015).

    Article  Google Scholar 

  8. Chen B., Lin L., Liu H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inf. Theory 63(12), 7661–7666 (2017).

    Article  MathSciNet  Google Scholar 

  9. Ding B., Ge G., Zhang J., Zhang T., Zhang Y.: New constructions of MDS symbol-pair codes. Des. Codes Cryptogr. 86(4), 841–859 (2018).

    Article  MathSciNet  Google Scholar 

  10. Dinh H.Q., Nguyen B.T., Singh A.K., Sriboonchitta S.: Hamming and symbol-pair distances of repeated-root constacyclic codes of prime power lengths over \({\mathbb{F}}_{p^m}+u\,{\mathbb{F}}_{p^{m}}\). IEEE Commun. Lett. 22(12), 2400–2403 (2018).

    Article  Google Scholar 

  11. Dinh H.Q., Nguyen B.T., Singh A.K., Sriboonchitta S.: On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths. IEEE Trans. Inf. Theory 64(4), 2417–2430 (2018).

    Article  MathSciNet  Google Scholar 

  12. Dinh H.Q., Wang X., Liu H., Sriboonchitta S.: On the symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\). Discret. Math. 342(11), 3062–3078 (2019).

    Article  Google Scholar 

  13. Dinh H.Q., Nguyen B.T., Sriboonchitta S.: MDS symbol-pair cyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}\). IEEE Trans. Inf. Theory 66(1), 240–262 (2020).

    Article  Google Scholar 

  14. Elishco O., Gabrys R., Yaakobi E.: Bounds and constructions of codes over symbol-pair read channels. IEEE Trans. Inf. Theory 66(3), 1385–1395 (2020).

    Article  MathSciNet  Google Scholar 

  15. Horii S., Matsushima T., Hirasawa S.: Linear programming decoding of binary linear codes for symbol-pair read channels. In: Proceedings of IEEE International Symposium Information Theory (ISIT), pp. 1944–1948 (2016)

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

    Book  Google Scholar 

  17. Kai X., Zhu S., Li P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inf. Theory 61(11), 5828–5834 (2015).

    Article  MathSciNet  Google Scholar 

  18. Kai X., Zhu S., Zhao Y., Luo H., Chen Z.: New MDS symbol-pair codes from repeated-root codes. IEEE Commun. Lett. 22(3), 462–465 (2018).

    Article  Google Scholar 

  19. Li S., Ge G.: Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes. Des. Codes Cryptogr. 84(3), 359–372 (2017).

    Article  MathSciNet  Google Scholar 

  20. Liu S., Xing C., Yuan C.: List decodability of symbol-pair codes. IEEE Trans. Inf. Theory 65(8), 4815–4821 (2019).

    Article  MathSciNet  Google Scholar 

  21. Ma J., Luo J.: New MDS symbol-pair codes from repeated-root cyclic codes over finite fields. http://arxiv.org/abs/2010.04329 (2020)

  22. Ma J., Luo J.: On symbol-pair weight distribution of MDS codes and simplex codes over finite fields. Cryptogr. Commun. 13(1), 101–115 (2021).

    Article  MathSciNet  Google Scholar 

  23. MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977).

    MATH  Google Scholar 

  24. Massey J.L., Costello D.J., Justesen J.: Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19(1), 101–110 (1973).

    Article  MathSciNet  Google Scholar 

  25. Morii M., Hirotomo M., Takita M.: Error-trapping decoding for cyclic codes over symbol-pair read channels. In: Proceeding of IEEE International Symposium Information Theory (ISIT), pp. 681–685 (2016)

  26. Sun Z., Zhu S., Wang L.: The symbol-pair distance distribution of a class of repeated-root cyclic codes over \({\mathbb{F}}_{p^m}\). Cryptogr. Commun. 10(4), 643–653 (2018).

    Article  MathSciNet  Google Scholar 

  27. Takita M., Hirotomo M., Morii M.: Syndrome decoding of symbol-pair codes. IEICE Trans.-A 98(12), 2423–2428 (2015).

    Article  Google Scholar 

  28. Yaakobi E., Bruck J., Siegel P. H.: Decoding of cyclic codes over symbol-pair read channels. In: Proceeding of IEEE International Symposium Information Theory (ISIT), pp. 2891–2895 (2012)

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Nos. 12171191, 11871025, 11471008), Application Foundation Frontier Project of Wuhan Science and Technology Bureau (No. 2020010601012189) and Fundamental Research Funds for the Central Universities of CCNU (No. CCNU20TD002).

Author information

Authors and Affiliations

  1. Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, Hubei, China

    Junru Ma

  2. School of Mathematics and Statistics & Hubei Key Laboratory of Mathematical Sciences, Central China Normal University, Wuhan, 430079, Hubei, China

    Jinquan Luo

Authors
  1. Junru Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinquan Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinquan Luo.

Additional information

Communicated by C. Ding.

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

Ma, J., Luo, J. MDS symbol-pair codes from repeated-root cyclic codes. Des. Codes Cryptogr. 90, 121–137 (2022). https://doi.org/10.1007/s10623-021-00967-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-021-00967-4

Keywords

Mathematics Subject Classification

Search

Navigation