lower bound: | 31 |
upper bound: | 34 |
Construction of a linear code [60,10,31] over GF(3): [1]: [61, 11, 31] Constacyclic by 2 Linear Code over GF(3) ConstaCyclicCode generated by x^60 + 2*x^59 + x^57 + x^56 + 2*x^55 + 2*x^54 + x^53 + 2*x^52 + x^50 + 2*x^49 + 2*x^47 + x^45 + 2*x^44 + x^43 + x^42 + x^41 + 2*x^40 + x^39 + x^38 + x^36 + x^34 + x^33 + 2*x^32 + x^31 + x^30 + x^29 + 2*x^28 + x^27 + 2*x^25 + 2*x^23 + x^22 + 2*x^20 + x^19 + 2*x^18 + 2*x^17 + x^16 + x^15 + 2*x^13 + x^12 + 2*x^11 + 1 with shift constant 2 [2]: [60, 10, 31] Linear Code over GF(3) Shortening of [1] at { 61 } last modified: 2003-09-22
Lb(60,10) = 31 is found by shortening of: Lb(61,11) = 31 is found by truncation of: Lb(62,11) = 32 DaH Ub(60,10) = 34 follows by a one-step Griesmer bound from: Ub(25,9) = 11 is found by considering shortening to: Ub(24,8) = 11 BS
DaH: Rumen Daskalov & Plamen Hristov, New One-Generator Quasi-Cyclic Codes over GF(7), preprint, Oct 2001. R. Daskalov & P Hristov, New One-Generator Quasi-Twisted Codes over GF(5), (preprint) Oct. 2001. R. Daskalov & P Hristov, New Quasi-Twisted Degenerate Ternary Linear Codes, preprint, Nov 2001. Email, 2002-2003.
Notes
|