Bounds on the minimum distance of linear codes
Bounds on linear codes [101,75] over GF(5)
lower bound:  13 
upper bound:  19 
Construction
Construction type: DastbastehPadashnickCrespoGrasslSharafi
Construction of a linear code [101,75,13] over GF(5):
[1]: [101, 75, 13] Cyclic Linear Code over GF(5)
CyclicCode of length 101 with generating polynomial x^26 + 2*x^25 + 2*x^24 + 3*x^23 + 2*x^22 + x^21 + 2*x^20 + 4*x^19 + 2*x^16 + x^15 + 2*x^14 + 4*x^13 + 3*x^12 + x^10 + 4*x^8 + 3*x^6 + 2*x^5 + 2*x^3 + x^2 + 2*x + 1
last modified: 20240710
From Brouwer's table (as of 20070213)
Lb(101,75) = 12 is found by taking a subcode of:
Lb(101,76) = 12 is found by shortening of:
Lb(126,101) = 12 BCH
Ub(101,75) = 19 is found by considering shortening to:
Ub(96,70) = 19 is found by considering truncation to:
Ub(95,70) = 18 sp
References
BCH:
T. Kasami & N. Tokura, Some remarks on BCH bounds and minimum weights of
binary primitive BCH codes, IEEE Trans. Inform. Theory IT15 (May
1969) 408413.
Or: a BCH code.
sp:
Notes
 All codes establishing the lower bounds were constructed using
MAGMA.
 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 20012006.
 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 email:
codes [at] codetables.de

Homepage 
New Query 
Contact
This page is maintained by
Markus Grassl
(codes@codetables.de).
Last change: 30.12.2011