Skip to main content
Erschienen in: Designs, Codes and Cryptography 5/2022

21.03.2022

Complete b-symbol weight distribution of some irreducible cyclic codes

verfasst von: Hongwei Zhu, Minjia Shi, Ferruh Özbudak

Erschienen in: Designs, Codes and Cryptography | Ausgabe 5/2022

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Recently, b-symbol codes are proposed to protect against b-symbol errors in b-symbol read channels. It is an interesting subject of study to consider the complete b-symbol weight distribution of cyclic codes since b-symbol metric is a generalization for Hamming metric. The complete b-symbol Hamming weight distribution of irreducible cyclic codes is known in only a few cases. In this paper, we give a complete b-symbol Hamming weight distribution of a class of irreducible cyclic codes with two nonzero b-symbol Hamming weights.
Literatur
1.
Zurück zum Zitat Cassuto Y., Blaum M.: Codes for symbol-pair read channels. In: Proc Int. Symp. Inf. Theory, pp. 988–992. Austin, TX, USA, Jun (2010). Cassuto Y., Blaum M.: Codes for symbol-pair read channels. In: Proc Int. Symp. Inf. Theory, pp. 988–992. Austin, TX, USA, Jun (2010).
2.
Zurück zum Zitat Cassuto Y., Blaum M.: Codes for symbol-pair read channels. IEEE Trans. Inform. Theory 57(12), 8011–8020 (2011).MathSciNetCrossRef Cassuto Y., Blaum M.: Codes for symbol-pair read channels. IEEE Trans. Inform. Theory 57(12), 8011–8020 (2011).MathSciNetCrossRef
3.
Zurück zum Zitat Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proc. Int. Symp. Inf. Theory, St. Petersburg, Russia, pp. 2348–2352, Jul/Aug (2011). Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Proc. Int. Symp. Inf. Theory, St. Petersburg, Russia, pp. 2348–2352, Jul/Aug (2011).
4.
Zurück zum Zitat Chee Y.M., Ji L., Kiah H.M., Wang C., Yin J.: Maximum distance separable codes for symbol pair read channels. IEEE Trans. Inform. Theory 59(11), 7259–7267 (2013).MathSciNetCrossRef Chee Y.M., Ji L., Kiah H.M., Wang C., Yin J.: Maximum distance separable codes for symbol pair read channels. IEEE Trans. Inform. Theory 59(11), 7259–7267 (2013).MathSciNetCrossRef
5.
Zurück zum Zitat Chee Y.M., Kiah H.M., Wang C., Yin J.: Maximum distance separable symbol-pair codes. In: Proc IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, pp. 2886–2890 (2012). Chee Y.M., Kiah H.M., Wang C., Yin J.: Maximum distance separable symbol-pair codes. In: Proc IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, pp. 2886–2890 (2012).
6.
Zurück zum Zitat Chen B., Lin L., Liu H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inform. Theory 63(12), 7661–7666 (2017).MathSciNetCrossRef Chen B., Lin L., Liu H.: Constacyclic symbol-pair codes: lower bounds and optimal constructions. IEEE Trans. Inform. Theory 63(12), 7661–7666 (2017).MathSciNetCrossRef
7.
Zurück zum Zitat 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).MathSciNetCrossRef 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).MathSciNetCrossRef
8.
Zurück zum Zitat Ding B., Zhang T., Ge G.: Maximum distance separable codes for b-symbol read channels. Finite Fields Appl. 49, 180–197 (2018).MathSciNetCrossRef Ding B., Zhang T., Ge G.: Maximum distance separable codes for b-symbol read channels. Finite Fields Appl. 49, 180–197 (2018).MathSciNetCrossRef
9.
10.
Zurück zum Zitat Kai X., Zhu S., Li P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inform. Theory 61(11), 5828–5834 (2015).MathSciNetCrossRef Kai X., Zhu S., Li P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inform. Theory 61(11), 5828–5834 (2015).MathSciNetCrossRef
11.
Zurück zum Zitat Lidl R., Niederreiter H.: Finite Fields, Second Edition, vol. 20. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997).MATH Lidl R., Niederreiter H.: Finite Fields, Second Edition, vol. 20. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997).MATH
12.
13.
Zurück zum Zitat Shi M., Li X., Neri A., Solé P.: How many weights can a cyclic code have? IEEE Trans. Inform. Theory 67(3), 1449–1459 (2020).MathSciNetCrossRef Shi M., Li X., Neri A., Solé P.: How many weights can a cyclic code have? IEEE Trans. Inform. Theory 67(3), 1449–1459 (2020).MathSciNetCrossRef
14.
Zurück zum Zitat Shi M., Neri A., Solé P.: How many weights can a quasi-cyclic code have? IEEE Trans. Inform. Theory 67(11), 6855–6862 (2020).MathSciNetCrossRef Shi M., Neri A., Solé P.: How many weights can a quasi-cyclic code have? IEEE Trans. Inform. Theory 67(11), 6855–6862 (2020).MathSciNetCrossRef
15.
Zurück zum Zitat Shi M., Zhu H., Solé P., Cohen G.: How many weights can a linear code have? Des. Codes Cryptogr. 8(1), 87–95 (2019).MathSciNetCrossRef Shi M., Zhu H., Solé P., Cohen G.: How many weights can a linear code have? Des. Codes Cryptogr. 8(1), 87–95 (2019).MathSciNetCrossRef
16.
Zurück zum Zitat Shi M., Özbudak F., Solé P.: Geometric approach to \(b\)-symbol hamming weights of cyclic codes. IEEE Trans. Inform. Theory 67(6), 3735–3751 (2021).MathSciNetCrossRef Shi M., Özbudak F., Solé P.: Geometric approach to \(b\)-symbol hamming weights of cyclic codes. IEEE Trans. Inform. Theory 67(6), 3735–3751 (2021).MathSciNetCrossRef
17.
Zurück zum Zitat 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).MathSciNetCrossRef 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).MathSciNetCrossRef
18.
Zurück zum Zitat Yaakobi E., Bruck J., Siegel P.H.: Constructions and decoding of cyclic codes over \(b\)-symbol read channels. IEEE Trans. Inform. Theory 62(4), 1541–1551 (2016).MathSciNetCrossRef Yaakobi E., Bruck J., Siegel P.H.: Constructions and decoding of cyclic codes over \(b\)-symbol read channels. IEEE Trans. Inform. Theory 62(4), 1541–1551 (2016).MathSciNetCrossRef
Metadaten
Titel
Complete b-symbol weight distribution of some irreducible cyclic codes
verfasst von
Hongwei Zhu
Minjia Shi
Ferruh Özbudak
Publikationsdatum
21.03.2022
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 5/2022
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-022-01030-6

Weitere Artikel der Ausgabe 5/2022

Designs, Codes and Cryptography 5/2022 Zur Ausgabe

Premium Partner