lower bound: | 64 |
upper bound: | 65 |
Construction of a linear code [140,11,64] over GF(2): [1]: [140, 11, 64] Linear Code over GF(2) QuasiCyclicCode of length 140 stacked to height 3 with generating polynomials: x^6 + x^5 + x^4 + x, x^6 + x^4 + x^3 + x^2, x^6 + x^3 + x + 1, x^6 + x^5 + x^2 + 1, x^5 + x^3 + x^2 + x, x^4 + x^2 + x + 1, x^6 + x^3 + x + 1, x^6 + x^5 + x^4 + x, x^5 + x^3 + x^2 + x, x^4 + x^2 + x + 1, 0, x^4 + x^2 + x + 1, 0, 0, x^6 + x^4 + x^3 + x^2, x^5 + x^3 + x^2 + x, x^6 + x^3 + x + 1, 0, x^6 + x^3 + x + 1, x^6 + x^5 + x^2 + 1, x^6 + x^5 + x^4 + x^3 + x^2 + x + 1, x^6 + x^5 + x^3, x^6 + x^2 + x, x^6 + x^4 + x^3 + x^2, x^6 + x^3 + x + 1, 0, x^6 + x^4 + x^3 + x^2, x^5 + x^4 + x^3 + 1, x^5 + x^4 + x^3 + 1, x^6 + x^5 + x^3, x^6 + x^4 + 1, x^6 + x^4 + 1, 0, x^6 + x^5 + x^4 + x^3 + x^2 + x + 1, x^4 + x^3 + x, x^6 + x^5 + x^3, x^6 + x^4 + 1, x^6 + x^5 + x^2 + 1, x^6 + x^3 + x + 1, x^6 + x^3 + x + 1, x^6 + x^4 + 1, x^5 + x^4 + x^2, x^6 + x^4 + 1, x^6 + x^5 + x^3, x^4 + x^3 + x, x^3 + x^2 + 1, x^5 + x^4 + x^2, x^6 + x^5 + x^3, x^6 + x^4 + 1, x^5 + x + 1, x^6 + x^5 + x^3, x^6 + x^2 + x, x^5 + x + 1, x^4 + x^2 + x + 1, x^6 + x^4 + x^3 + x^2, x^6 + x^5 + x^4 + x, x^6 + x^3 + x + 1, x^3 + x^2 + 1, x^6 + x^4 + 1, x^6 + x^4 + 1 last modified: 2006-05-31
Lb(140,11) = 63 GB6 Ub(140,11) = 65 follows by a one-step Griesmer bound from: Ub(74,10) = 32 follows by a one-step Griesmer bound from: Ub(41,9) = 16 follows by a one-step Griesmer bound from: Ub(24,8) = 8 otherwise adding a parity check bit would contradict: Ub(25,8) = 9 YH1
YH1: Øyvind Ytrehus & Tor Helleseth, There is no binary [25,8,10] code, IEEE Trans. Inform. Theory 36 (May 1990) 695-696.
Notes
|