Abstract
The paper considers a new subclass of quasi-cyclic Goppa codes having special Goppa polynomial \(G(x)=x^{q^{l}+1}+ax^{q^{l}}+a^{q^{m}}bx+b, a \notin \{M \cup \{-M\}\}, b \in M=\{\alpha : \alpha ^{q^{m}}=\alpha ^{-1}, \alpha \in GF(q^{2m})\}\), where q is a prime number. For this subclass, improved lower bounds for the dimension and the minimum distance are obtained. It is shown that this subclass contains the best known and optimal codes.
Similar content being viewed by others
References
Goppa, V.D.: A new class of linear error-correcting codes. Probl. Inform. Transm. 6(3), 24–30 (1970)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. Amsterdam /New York/ Oxford, North Holland (1977)
Blahut, R.E.: Algebraic codes for data transmission. Cambridge University Press (2003)
Peterson, W.W., Weldon, E.J.: Error-Correcting Codes. The MIT Press, Cambridge, Massachusets, and London, England (1972)
Bezzateev, S., Shekhunova, N.: Subclass of cyclic Goppa codes. IEEE Trans. Inform. Theory. 59(11), 7379–7385 (2013)
Chen, C., Peterson, W., Weldon, E.: Some results on qusi-cyclic codes. Inf. and Control 15(5), 407–423 (1969)
Berlecamp, E.R., Moreno, O.: Extended double-error-correcting binary Goppa codes are cyclic. IEEE Trans. Inform. Theory 19(6), 817–818 (1973)
Tzeng, K.K., Yu, C.Y.: Characterization theorems for extending Goppa codes to cyclic codes. IEEE Trans. Inform. Theory 25(2), 246–250 (1979)
Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic codes. Trans. Inform. Theory 21(6), 712–716 (1975)
Moreno, O.: Symmetries of binary Goppa codes. IEEE Trans. Inform. Theory 25(5), 609–612 (1979)
Vishnevetskiy, A.L.: On cyclicity of extended Goppa codes. Probl. Inform. Transm XVIII(3), 14–18 (1982)
Stichenoth, H.: Which extended Goppa codes are cyclic?. J.Comb Theory. A 51, 205–220 (1989)
Berger, T.P.: New classes of cyclic extended Goppa codes. IEEE Trans. Inform. Theory 45(4), 1264–1266 (1999)
Berger, T.P.: Goppa and related codes invariant under a prescribed permutation. IEEE Trans. Inform. Theory 46(7), 2628–2633 (2000)
Berger, T.P.: On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes. Finite Fields Appl. 6, 255–281 (2000)
Berger, T.P.: Quasi-cyclic Goppa codes. Proc. ISIT2000, Sorrente Italie 2000, 195 (2000)
Bezzateev, S., Shekhunova, N.: Chain of separable binary Goppa codes and their minimal distance. IEEE Trans. Inform. Theory 54(12), 5773–5778 (2008)
Veron, P.: Goppa codes and trace operator. IEEE Trans. Inform. Theory 44(1), 290–294 (1998)
Goppa, V.D.: A rational representation of codes and (L,g) codes. Probl. Inform. Transm. 7(3), 41–49 (1971)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: The user language. J. Symbolic Comput. 24, 235–265 (1997)
Chen, Z.: A database on binary quasi-cyclic codes. http://moodle.tec.hkr.se/chen/research/codes/qc.htm. Accessed on 2015-12-21
Grassl, M.: Tables of linear codes and quantum codes http://www.codetables.de. Accessed on 2015-12-21
Acknowledgments
The authors would like to thank Prof. Thierry P. Berger and the referees for their helpful comments and suggestions that improved the presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research leading to these results has received funding from the Ministry of Education and Science of the Russian Federation according to the project part of the state funding assignment No 2.2716.2014/K, July 17th, 2014.
Rights and permissions
About this article
Cite this article
Bezzateev, S., Shekhunova, N. Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets. Cryptogr. Commun. 9, 23–39 (2017). https://doi.org/10.1007/s12095-016-0196-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-016-0196-3