Bounds on the minimum distance of linear codes

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

lower bound:140
upper bound:145


Construction type: GraPun

Construction of a 
linear code [228,10,140] over GF(3):
[1]:  [242, 10, 153] "BCH code (d = 153, b = 91)" Linear Code over GF(3)
     BCHCode with parameters 242 153 91
[2]:  [228, 10, 140] Linear Code over GF(3)
     Puncturing of [1] at { 1, 2, 5, 7, 9, 10, 22, 46, 64, 70, 72, 122, 173, 196

last modified: 2004-08-17

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

Lb(228,10) = 140 MSY

Ub(228,10) = 145 is found by considering truncation to:
Ub(226,10) = 143 Gur
Gur: Sugi Guritman, Restrictions on the weight distribution of linear codes, Thesis, Techn. Univ. Delft, 2000.

MSY: T. Maruta, M. Shinohara, F. Yamane, K. Tsuji, E. Takata, H. Miki & R. Fujiwara, New linear codes from cyclic or generalized cyclic codes by puncturing, to appear in Proc. 10th International Workshop on Algebraic and Combinatorial Coding Theory(ACCT-10) in Zvenigorod, Russia, 2006.


  • All codes establishing the lower bounds where constructed using MAGMA.
  • Upper bounds are taking 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]

Homepage | New Query | Contact
This page is maintained by Markus Grassl ( Last change: 27.03.2010