## Bounds on the minimum distance of linear codes

### Bounds on linear codes [126,16] over GF(2)

 lower bound: 50 upper bound: 54

### Construction

```Construction of a linear code [126,16,50] over
GF(2):
[1]:  [8, 4, 4] "Reed-Muller Code (r = 1, m = 3)" Linear Code over GF(2)
ReedMullerCode with parameters 1 3
[2]:  [15, 4, 12] "BCH code (d = 12, b = 1)" Linear Code over GF(2^4)
BCHCode over GF(16) with parameters 15 12
[3]:  [16, 4, 13] Linear Code over GF(2^4)
ExtendCode [2] by 1
[4]:  [128, 16, 52] Linear Code over GF(2)
ConcatenatedCode of [3] and [1]
[5]:  [126, 16, 50] Linear Code over GF(2)
Puncturing of [4] at { 127 .. 128 }

```

### From Brouwer's table (as of 2007-02-13)

```Lb(126,16) = 50 is found by truncation of:
Lb(128,16) = 52 BZ

Ub(126,16) = 54 otherwise adding a parity check bit would contradict:
Ub(127,16) = 55 Bro
```
###### References
BZ: E. L. Blokh & V. V. Zyablov, Coding of generalized concatenated codes, Probl. Inform. Transm. 10 (1974) 218-222.

Bro: A.E. Brouwer, The linear programming bound for binary linear codes, IEEE Trans. Inform. Th. 39 (1993) 677-680.

### 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 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

Homepage | New Query | Contact
This page is maintained by Markus Grassl (grassl@ira.uka.de). Last change: 30.12.2011