Abstract
We construct a class of \(\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}\)-additive cyclic codes generated by pairs of polynomials, where p is a prime number. The generator matrix of this class of codes is obtained. By establishing the relationship between the random \(\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}\)-additive cyclic code and random quasi-cyclic code of index 2 over \(\mathbb {Z}_{p}\), the asymptotic properties of the rates and relative distances of this class of codes are studied. As a consequence, we prove that \(\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}\)-additive cyclic codes are asymptotically good since the asymptotic GV-bound at \(\frac {1+p^{s-1}}{2}\delta \) is greater than \(\frac {1}{2}\), the relative distance of the code is convergent to δ, while the rate is convergent to \(\frac {1}{1+p^{s-1}}\) for \(0< \delta < \frac {1}{1+p^{s-1}}\).
Similar content being viewed by others
References
Abualrub, T., Siap, I., Aydin, H.: \(\mathbb {Z}_{2}\mathbb {Z}_{4}\)-additive cyclic codes. IEEE Trans. Inform. Theory 60(3), 1508–1514 (2014)
Aydogdu, I., Siap, I.: The structure of \(\mathbb {Z}_{2}\mathbb {Z}_{2^{s}}\)-additive codes: bounds on the minimum distance. Appl. Math. Inform. Sci. (AMIS) 7(6), 2271–2278 (2013)
Aydogdu, I., Siap, I.: On \(\mathbb {Z}_{p^{r}}\mathbb {Z}_{p^{s}}\)-additive codes. Linear Multil. Algebra 63(10), 2089–2102 (2015)
Bazzi, L., Mitter, S.: Some randomized code constructions from group actions. IEEE Trans. Inform. Theory 52(7), 3210–3219 (2006)
Constantinescu, I., Heise, W.: A metric for codes over residue class rings. Probl. Peredachi Inform. 33(3), 22–28 (1997)
Chen, C., Peterson, W., Weldon, E.: Some results on quasicyclic codes. Inform. Control 15(5), 407–423 (1969)
Chepyzhov, V.: New lower bounds for minimum distance of linear quasi-cyclic and almost linear cyclic codes. Probl. Peredachi Inform. 28(1), 39–51 (1992)
Delsarte, P., Levenshtein, V.: Association schemes and coding theory. IEEE Trans. Inform. Theory 44(6), 2477–2504 (1998)
Dey, B., Rajan, B.: Codes closed under arbitrary abelian group of permutations. SIAM J. Discrete Math. 18(1), 1–18 (2004)
Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes. IEEE Trans. Inform. Theory 61(1), 82–90 (2015)
Fan, Y., Liu, H.: Double circulant matrices. Linear and Multil. Algebra, Published online: 19 Oct 2017
Fan, Y., Liu, H.: Quasi-cyclic codes of Index \(1\frac {1}{3}\). IEEE Trans. Inform. Theory 62(11), 6342–6347 (2016)
Huffman, W., Pless, V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)
Ling, S., Solé, P.: Good self-dual quasi-cyclic codes exist. IEEE Trans. Inform. Theory 49(4), 1052–1053 (2003)
Martinez-Perez, C., Willems, W.: Is the class of cyclic codes asymptotically good. IEEE Trans. Inform. Theory 52(2), 696–700 (2006)
Mi, J., Cao, X.: Asymptotically good quasi-cyclic codes of fractional index. Discrete Math. 341(2), 308–314 (2018)
Shi, M.J., Qian, L.Q., Liu, Y., Solé, P.: Good self-dual generalized quasi-cyclic codes exist. Inf. Process. Lett. 118, 21–24 (2017)
Shi, M., Wu, R., Solé, P.: Asymptotically good additive cyclic codes exist. IEEE Commun. Lett. 22(10), 1980–1983 (2018)
Shi, M.J., Qian, L.Q., Solé, P.: On self-dual negacirculant codes of index two and four. Des. Codes Crypt. 11, 2485–2494 (2018)
Shi, M., Wu, R., Krotov, D.: On \(\mathbb {Z}_{p}\mathbb {Z}_{p^{k}}\)-additive codes and their duality. IEEE Trans. Inform. Theory 65(6), 3841–3847 (2019)
Shi, M.J., Huang, D.T., Sok, L., Solé, P.: Double circulant LCD codes over \(\mathbb {Z}_4\). Finite Fields Appl. 58, 133–144 (2019)
Shi, M.J., Huang, D.T., Sok, L., Solé, P.: Double circulant self-dual and LCD codes over Galois rings. Adv. Math. Commun. 13(1), 171–183 (2019)
Varshamov, R.: Estimate of the number of signals in error correcting codes. Dokl. Akad. Nauk SSSR 117(5), 739–741 (1957). in Russian
Wasan, S.: Quasi abelian codes. Pub. Inst. Math., (Beograd) N. S. 21(35), 201–206 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This research is supported by the National Natural Science Foundation of China (No.61772168; No.61572168).
Rights and permissions
About this article
Cite this article
Yao, T., Zhu, S. \(\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}\)-additive cyclic codes are asymptotically good. Cryptogr. Commun. 12, 253–264 (2020). https://doi.org/10.1007/s12095-019-00397-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-019-00397-z
Keywords
- \(\mathbb {Z}_{p}\mathbb {Z}_{p^{s}}\)-additive cyclic codes
- Generator matrix
- Random codes
- GV-bound
- Asymptotically good codes