| lower bound: | 21 |
| upper bound: | 24 |
Construction of a linear code [39,10,21] over GF(5):
[1]: [1, 1, 1] Cyclic Linear Code over GF(5)
RepetitionCode of length 1
[2]: [38, 9, 21] Quasicyclic of degree 2 Linear Code over GF(5)
QuasiCyclicCode of length 38 with generating polynomials: 4*x^18 + 3*x^17 + 4*x^16 + 2*x^13 + 3*x^12 + 2*x^11 + x^9 + 1, 4*x^18 + 2*x^14 + 3*x^13 + 3*x^12 + 4*x^11 + 3*x^10 + x^9 + 2*x^8 + 3*x^7 + 4*x^6 + 2*x^5 + 4*x^3 + 4*x^2 + x
[3]: [38, 10, 20] Quasicyclic of degree 2 Linear Code over GF(5)
QuasiCyclicCode of length 38 with generating polynomials: 3*x^18 + 4*x^16 + 2*x^15 + 3*x^14 + 4*x^12 + 2*x^10 + x^3, x^18 + 3*x^17 + x^16 + 3*x^15 + 4*x^14 + 2*x^13 + 4*x^10 + 4*x^8 + x^7 + x^6 + x^5 + 3*x^2 + x + 4
[4]: [39, 10, 21] Linear Code over GF(5)
ConstructionX using [3] [2] and [1]
last modified: 2021-08-25
Lb(39,10) = 20 is found by shortening of: Lb(41,12) = 20 is found by truncation of: Lb(42,12) = 21 ARS Ub(39,10) = 24 follows by a one-step Griesmer bound from: Ub(14,9) = 4 is found by considering shortening to: Ub(13,8) = 4 Bou
Bou: I. Boukliev, Some new bounds on minimum length for quaternary codes of dimension five, preprint, July 1994.
Notes
|