Maximum Distance Separable Symbol-Pair Cyclic Codes of Length Over Finite Fields
Keywords:
Cyclic Codes, Symbol-Pair Codes, MDS Codes, Finite FieldsAbstract
Symbol-pair codes have attracted considerable attention due to their applications in channels where errors occur in adjacent symbol pairs rather than independently. In this paper, we investigate a class of repeated-root cyclic codes of length 7p over finite fields where q is a prime satisfying 7/(q − 1). By selecting suitable generator polynomials with prescribed root structures, several families of cyclic codes with Hamming distance 4 and symbol-pair distance 11 are constructed. In particular, we obtain codes with parameters () = (4, 11). It is shown that these codes meet the Singleton-type bound for symbol-pair distance and hence are MDS symbol-pair codes. This work provides new symbol-pair cyclic codes.References
1. Seroussi, G., Roth, R.M.: On MDS extensions of generalised reed-solomon codes. IEEE Transactions on Information Theory 32(3), 349–354 (2003).
2. Roth, R., Seroussi, G.: On cyclic mds codes of length ℓ over gf (q) (corresp.). IEEE transactions on information theory 32(2), 284–285 (2003).
3. Chen, B., Lin, L., Liu, H.: Constacyclic symbol-pair codes: Lower bounds and optimal constructions. IEEE Transactions on Information Theory 63(12), 7661–7666 (2017)
4. Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. IEEE International Symposium on Information Theory Proceedings, pp. 2891–2895 (2012).
5. Chee, Y.M., Kiah, H.M., Wang, C.: Maximum distance separable symbol-pair codes. IEEE International Symposium on Information Theory Proceedings, pp. 2886–2890 (2012).
6. Hirotomo, M., Takita, M., Morii, M.: Syndrome decoding of symbol-pair codes. IEEE Information Theory Workshop, pp. 162–166 (2014).
7. Dinh, H.Q., Nguyen, B.T., Singh, A.K., Yamaka, W.: Mds constacyclic codes and mds symbol-pair constacyclic codes. IEEE Access 9, 137970–137990 (2021).
8. Kai, X., Zhu, S., Li, P.: A construction of new mds symbol-pair codes. IEEE Transactions on Information Theory 61(11), 5828–5834 (2015).
9. Singleton, R.: Maximum distance q-nary codes. IEEE Transactions on Information Theory 10(2), 116–118 (2003).
10. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes vol. 16. North-Holland Publishing Company, Amsterdam (1977).
11. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics 8(2), 300–304 (1960).
12. Ball, S., Gamboa, G., Lavrauw, M.: On additive mds codes over small fields. arXiv preprint arXiv:2012.064183 (2020).
13. Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. IEEE Transactions on Information Theory 57(12), 8011–8020 (2011).
14. Yaakobi, E., Bruck, J., Siegel, P.H.: Constructions and decoding of cyclic codes over symbol read channels. IEEE Transactions on Information Theory 62(4), 1541–1551 (2016).
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Auhor(s)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Articles published in the Journal of Advanced Multidisciplinary Studies (JAMS) are licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0), unless otherwise stated. Authors retain copyright of their work and grant JAMS the right of first publication.
