## Bounds on the minimum distance of linear codes

### Bounds on linear codes [12,8] over GF(3)

 lower bound: 3 upper bound: 3

### Construction

```Construction of a linear code [12,8,3] over GF(3):
[1]:  [121, 116, 3] "Hamming code (r = 5)" Linear Code over GF(3)
5-th order HammingCode over GF( 3)
[2]:  [118, 113, 3] Linear Code over GF(3)
Shortening of [1] at { 119 .. 121 }
[3]:  [40, 36, 3] Linear Code over GF(3)
Construction B of [2]
[4]:  [37, 33, 3] Linear Code over GF(3)
Shortening of [3] at { 38 .. 40 }
[5]:  [13, 10, 3] Linear Code over GF(3)
Construction B of [4]
[6]:  [12, 9, 3] Linear Code over GF(3)
Shortening of [5] at { 13 }
[7]:  [12, 8, 3] Linear Code over GF(3)
Subcode of [6]

```

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

```Lb(12,8) = 3 is found by taking a subcode of:
Lb(12,9) = 3 is found by shortening of:
Lb(13,10) = 3 is found by construction B:
[delete from a [37,33,3]-code
the (at most) 24 coordinates of a word in the dual]

Ub(12,8) = 3 is found by considering shortening to:
Ub(11,7) = 3 is found by construction B:
[consider deleting the (at most) 6 coordinates of a word in the dual]
```

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