Some new codes from binary Goppa codes and a method of shortening linear codes

Some new codes from binary Goppa codes and a method of shortening linear codes

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Goppa codes have some of the largest minimum distances possible for linear codes. The authors use some binary Goppa codes in which four new binary codes are obtained with parameters better than any codes known to date. The authors also present the necessary conditions for a code obtained by shortening a longer code which will have a greater minimum distance than the original code.


    1. 1)
      • 1. Grassl, M.: ‘Bounds on the minimum distance of linear codes and quantum codes’. Accessed June2011.
    2. 2)
      • 2. Schimd, W., Shurer, R.: ‘Mint: A database for optimal net parameters’. Accessed June2011.
    3. 3)
      • 3. Goppa, V.D.: ‘A new class of linear error correcting codes’, Probl. Peredachi Inf., 1970, 6, (3), pp. 2430.
    4. 4)
      • 4. Goppa, V.D.: ‘A rational representation of codes and (l,g)-codes’, Probl. Peredachi Inf., 1971, 7, (3), pp. 4149.
    5. 5)
      • 5. Bezzateev, S., Shekhunova, N.: ‘Chain of separable binary Goppa codes and their minimal distance’, IEEE Trans. Inf. Theory, 2008, 54, (12), pp. 57735778.
    6. 6)
      • 6. Grassl, M., White, G.: ‘New good linear codes by special puncturings’. Proc. Int. Symp. on Inf. Theory, Chicago, USA, June 2004, pp. 454.
    7. 7)
      • 7. Lim, K.C., Guan, Y.: ‘Improved code shortening for block and product codes’. Proc. IEEE Vehicular Tech. Conf. (VTC 2006-Spring), May 2006, pp. 13671371.
    8. 8)
      • 8. MacWilliams, F.J., Sloane, N.J.A.: ‘The theory of error-correcting codes’ (North-Holland mathematical library, Amsterdam, 1983).
    9. 9)
      • 9. Véron, P.: ‘Proof of conjectures on the true dimension of some binary Goppa codes’, Designs Codes Cryptogr., 2005, 36, (3), pp. 317325.
    10. 10)
      • 10. Bezzateev, S.V., Shekhunova, N.A.: ‘Subclass of binary Goppa codes with minimal distance equal to the design distance’, IEEE Trans. Inf. Theor., 1995, 41, (2), pp. 554555.
    11. 11)
      • 11. Sloane, N., Reddy, S., Chen, C.: ‘New binary codes’, IEEE Trans. Inf. Theor., 1972, 18, (4), pp. 503510.
    12. 12)
      • 12. Garey, M.R., Johnson, D.S.: ‘Computers and intractability’ (W.H. Freeman and Company, San Francisco, 1979).
    13. 13)
      • 13. Vardy, A.: ‘The intractability of computing the minimum distance of a code’, IEEE Trans. Inf. Theor., 1997, 43, (6), pp. 17571766.
    14. 14)
      • 14. Bosma, W., Cannon, J., Playoust, C.: ‘The magma algebra system i: The user language’, J. Symbolic Comput., 1997, 24, pp. 235265.
    15. 15)
      • 15. Bezzateev, S., Shekhunova, N.: ‘Cumulative separable codes’, available at: Accessed on 22, August2011.

Related content

This is a required field
Please enter a valid email address