Abstract
A new bound for the dimension of binary Goppa codes belonging to a specific subclass is given. This bound improves the well-known lower bound for Goppa codes.
Similar content being viewed by others
References
S. V. Bezzateev and N. A. Shekhunova, On the subcodes of one class Goppa codes: Proc. Intern. Workshop Algebraic and Combinatorial Coding Theory ACCT-1, Sept. (1988) pp. 143-146.
S. V. Bezzateev and N. A. Shekhunova, Subclass of binary Goppa codes with minimal distance equal to the design distance, IEEE Trans. Inform. Theory, Vol. IT-41 March (1995).
S. V. Bezzateev, N. A. Shekhunova and E. T. Mironchikov, One subclass of binary Goppa codes: Proc. XI Simp. po Probl. Izbit. v Inform. Syst., Jun. (1986) pp. 140-141.
S. V. Bezzateev, N. A. Shekhunova and E. T. Mironchikov, Subclass of binary Goppa codes, Probl. Pered. Inform., Vol. 25 Oct. (1989) pp. 98-102.
V. D. Goppa, A new class of linear error correcting codes, Probl. Pered. Inform., Vol. 6 Sept. (1970) pp. 24-30.
V. D. Goppa, Rational representation of codes and (L,g) codes, Probl. Pered. Inform., Vol. 7 Sept. (1971) pp. 41-49.
M. Loeloeian and J. Conan, A (55,16,19) binary Goppa code, IEEE Trans. Inform. Theory, Vol. IT-30 Sept. (1984) pp. 773.
M. Loeloeian and J. Conan, A transform approach to Goppa codes, IEEE Trans. Inform. Theory, Vol. IT-33 Sept. (1987) pp. 105-115.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bezzateev, S.V., Shekhunova, N.A. A Subclass of Binary Goppa Codes With Improved Estimation of the Code Dimension. Designs, Codes and Cryptography 14, 23–38 (1998). https://doi.org/10.1023/A:1008252303768
Issue Date:
DOI: https://doi.org/10.1023/A:1008252303768