Pseudogeometries with clusters and an example of a recursive $[4,2,3]_{42}$-code
Fundamentalʹnaâ i prikladnaâ matematika, Tome 14 (2008) no. 4, pp. 181-192
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
In 1998, E. Couselo, S. Gonzalez, V. Markov, and A. Nechaev defined the recursive codes and obtained some results that allowed one to conjecture the existence of recursive MDS-codes of dimension 2 and length 4 over any finite alphabet of cardinality $q\notin\{2,6\}$. This conjecture remained open only for $q\in\{14,18,26,42\}$. It is shown in this paper that there exist such codes for $q=42$. We used a new construction, that of pseudogeometry with clusters.
[1] Gonsales S., Kouselo E., Markov V. T., Nechaev A. A., “Rekursivnye MDR-kody i rekursivno differentsiruemye kvazigruppy”, Diskret. mat., 10:2 (1998), 3–29 | MR | Zbl
[2] Gonsales S., Kouselo E., Markov V., Nechaev A., “Parametry rekursivnykh MDR-kodov”, Diskret. mat., 12:4 (2000), 3–24 | MR | Zbl
[3] MakVilyams F. Dzh., Sloen N. Dzh. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979
[4] Kholl M., Kombinatorika, Mir, M., 1970 | MR
[5] Tarry G., “Le problème de 36 officiers. 1”, C. R. Assoc. Fr. Av. Sci., 1900, 122–123; “Le problème de 36 officiers. 2”, 1901, 170–203