Abstract
An efficient construction of extended length Goppa codes is presented. The construction yields four new binary codes [153, 71, 25], [151, 70, 25], [160, 70, 27], and [158, 69, 27]. The minimum distances are larger than those of the best previously known linear codes of the same length and dimension.
Similar content being viewed by others
References
Bosma W., Cannon J., Playoust C.: The MAGMA algebra system I: the user language. J Symb. Comput. 24, 235–265 (1997)
Goppa V.D.: A new class of linear error correcting codes. Probl. Peredachi Inf. 6, 24–30 (1970)
Goppa V.D.: A rational representation of codes and (L, g)-codes. Probl. Peredachi Inf. 7, 41–49 (1971)
Goppa V.D.: Codes constructed on the base of (L, g)-codes. Probl. Peredachi Inf. 8(2), 107–109 (1972)
Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http://www.codetables.de. Accessed on 21/12/2010 (2007).
MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1983)
Sugiyama Y., Kasahara M., Hirasawa S., Namekawa T.: Further results on Goppa codes and their applications to constructing efficient binary codes. IEEE Trans. Inf. Theory 22(5) 518–526 (1976)
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding Theory and Applications”.
Rights and permissions
About this article
Cite this article
Tomlinson, M., Jibril, M., Tjhai, C. et al. New binary codes from extended Goppa codes. Des. Codes Cryptogr. 70, 149–156 (2014). https://doi.org/10.1007/s10623-012-9707-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9707-1