## Bounds on the minimum distance of linear codes

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

 lower bound: 144 upper bound: 148

### Construction

Construction type: GraBZ

```Construction of a linear code [228,8,144] over GF(3):
[1]:  [121, 116, 3] "Hamming code (r = 5)" Linear Code over GF(3)
5-th order HammingCode over GF( 3)
[2]:  [121, 5, 81] Cyclic Linear Code over GF(3)
Dual of [1]
[3]:  [119, 5, 79] Linear Code over GF(3)
Puncturing of [2] at { 120 .. 121 }
[4]:  [40, 4, 27] Linear Code over GF(3)
ResidueCode of [3]
[5]:  [38, 4, 25] Linear Code over GF(3)
Puncturing of [4] at { 39 .. 40 }
[6]:  [13, 3, 9] Linear Code over GF(3)
ResidueCode of [5]
[7]:  [11, 3, 7] Linear Code over GF(3)
Puncturing of [6] at { 12 .. 13 }
[8]:  [4, 2, 3] Linear Code over GF(3)
ResidueCode of [7]
[9]:  [82, 4, 72] Constacyclic by \$.1 Linear Code over GF(3^2)
ConstaCyclicCode generated by \$.1^6*x^81 + 2*x^80 + \$.1^6*x^79 + x^78 + 2*x^77 + \$.1^6*x^76 + \$.1^6*x^75 + \$.1^6*x^73 + \$.1^2*x^72 + x^71 + \$.1^7*x^70 +
\$.1^2*x^68 + \$.1^2*x^67 + \$.1^2*x^66 + 2*x^65 + \$.1^2*x^64 + \$.1^3*x^63 + \$.1^6*x^62 + \$.1^2*x^60 + \$.1^7*x^59 + 2*x^58 + \$.1^2*x^57 + \$.1^6*x^56 + \$.1^5*x^55 +
\$.1*x^54 + \$.1^2*x^53 + \$.1^7*x^52 + x^51 + \$.1^2*x^50 + \$.1^3*x^49 + \$.1*x^48 + \$.1^6*x^47 + \$.1^6*x^46 + 2*x^45 + \$.1^2*x^44 + \$.1^7*x^42 + \$.1^2*x^41 +
\$.1^5*x^40 + \$.1^6*x^39 + \$.1^2*x^38 + \$.1^5*x^37 + \$.1^5*x^36 + 2*x^35 + 2*x^34 + x^33 + x^32 + \$.1^5*x^31 + \$.1^7*x^30 + 2*x^29 + \$.1^7*x^28 + \$.1^3*x^27 +
\$.1^7*x^26 + \$.1^5*x^24 + \$.1^3*x^23 + \$.1^3*x^22 + \$.1^6*x^21 + \$.1^5*x^20 + \$.1^6*x^19 + \$.1^7*x^18 + \$.1^6*x^16 + x^15 + \$.1^3*x^14 + x^13 + \$.1^2*x^11 +
\$.1^3*x^10 + \$.1^2*x^9 + \$.1^7*x^8 + \$.1^6*x^7 + \$.1^5*x^6 + x^5 + \$.1^2*x^4 + 1 with shift constant \$.1
[10]: [57, 4, 48] Linear Code over GF(3^2)
Puncturing of [9] at { 1, 2, 3, 4, 5, 6, 7, 13, 20, 24, 25, 27, 30, 33, 34, 38, 39, 44, 47, 51, 57, 70, 76, 81, 82 }
[11]: [228, 8, 144] Linear Code over GF(3)
ConcatenatedCode of [10] and [8]

```

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

```Lb(228,8) = 144 BKW

Ub(228,8) = 148 follows by a one-step Griesmer bound from:
Ub(79,7) = 49 follows by a one-step Griesmer bound from:
Ub(29,6) = 16 is found by considering truncation to:
Ub(28,6) = 15 HHM
```
###### References
BKW: Michael Braun, Axel Kohnert & Alfred Wassermann, Optimal linear codes from matrix groups, preprint, Mar 2004, and Construction of (sometimes) Optimal Linear Codes, email, Mar 2005.

HHM: N. Hamada, T. Helleseth, H.M. Martinsen & Ø. Ytrehus, There is no ternary [28,6,16] code

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