Bounds on the minimum distance of linear codes
Bounds on linear codes [60,16] over GF(2)
Construction of a linear code [60,16,20] over GF(2):
: [60, 17, 20] Linear Code over GF(2)
Construction from a stored generator Matrix
: [60, 16, 20] Linear Code over GF(2)
Subcode of 
last modified: 2001-01-30
From Brouwer's table (as of 2007-02-13)
Lb(60,16) = 20 is found by taking a subcode of:
Lb(60,17) = 20 CDJ
Ub(60,16) = 22 follows by a one-step Griesmer bound from:
Ub(37,15) = 11 is found by considering shortening to:
Ub(35,13) = 11 Ja
Huy T. Cao, Randall L. Dougherty & Heeralal Janwa, A [55,16,19] binary Goppa
code and related codes, having large minimum distance, IEEE Trans. Inform.
Theory 37 (Sep. 1991) 1432.
D.B. Jaffe, Binary linear codes: new results on nonexistence, 1996, code.ps.gz.
- All codes establishing the lower bounds were constructed using
- Upper bounds are taken from the tables of Andries E. Brouwer, with the exception of codes over GF(7) with n>50.
For most of these codes, the upper bounds are rather weak.
Upper bounds for codes over GF(7) with small dimension have been provided by Rumen Daskalov.
- Special thanks to John Cannon for his support in this project.
- A prototype version of MAGMA's code database over GF(2) was
written by Tat Chan in 1999 and extended later that year by
Damien Fisher. The current release version was
developed by Greg White over the period 2001-2006.
- Thanks also to Allan Steel for his MAGMA support.
- My apologies to all authors that have contributed codes to this table for not giving specific credits.
- If you have found any code improving the bounds or some errors, please send me an e-mail:
codes [at] codetables.de
New Query |
This page is maintained by
Last change: 30.12.2011