Bounds on the minimum distance of linear codes

Bounds on linear codes [204,13] over GF(2)

lower bound:93
upper bound:96

Construction

Construction of a linear code [204,13,93] over 
GF(2):
[1]:  [8, 1, 8] Cyclic Linear Code over GF(2)
     RepetitionCode of length 8
[2]:  [4, 1, 4] Cyclic Linear Code over GF(2)
     RepetitionCode of length 4
[3]:  [4, 3, 2] Cyclic Linear Code over GF(2)
     Dual of the RepetitionCode of length 4
[4]:  [8, 4, 4] Quasicyclic of degree 2 Linear Code over GF(2)
     PlotkinSum of [3] and [2]
[5]:  [16, 5, 8] Linear Code over GF(2)
     PlotkinSum of [4] and [1]
[6]:  [63, 7, 43] "BCH code (d = 43, b = 1)" Linear Code over GF(2^2)
     BCHCode over GF(4) with parameters 63 43
[7]:  [189, 14, 86] Linear Code over GF(2)
     ConcatenatedCode of [6] and [10]
[8]:  [189, 6, 86] Linear Code over GF(2)
     CodeComplement of [7] with [12]
[9]:  [189, 5, 86] Linear Code over GF(2)
     Subcode of [8]
[10]: [3, 2, 2] Cyclic Linear Code over GF(2)
     CordaroWagnerCode of length 3
[11]: [63, 4, 47] "BCH code (d = 47, b = 1)" Linear Code over GF(2^2)
     BCHCode over GF(4) with parameters 63 47
[12]: [189, 8, 94] Linear Code over GF(2)
     ConcatenatedCode of [11] and [10]
[13]: [189, 13, 86] Linear Code over GF(2)
     The Vector space sum: [12] + [9]
[14]: [205, 13, 94] Linear Code over GF(2)
     ConstructionX using [13] [12] and [5]
[15]: [204, 13, 93] Linear Code over GF(2)
     Puncturing of [14] at { 205 }

last modified: 2001-01-30

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

Lb(204,13) = 93 is found by truncation of:
Lb(205,13) = 94 EB1

Ub(204,13) = 96 follows by a one-step Griesmer bound from:
Ub(107,12) = 48 follows by a one-step Griesmer bound from:
Ub(58,11) = 24 follows by a one-step Griesmer bound from:
Ub(33,10) = 12 is found by considering shortening to:
Ub(30,7) = 12 otherwise adding a parity check bit would contradict:
Ub(31,7) = 13 vT3
References
EB1: Y. Edel & J. Bierbrauer, Some codes related to BCH codes of low dimension, preprint, 1995.

vT3: H.C.A. van Tilborg, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance, Discr. Math. 33 (1981) 197-207.

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