Problems of Information Transmission

, Volume 53, Issue 2, pp 136–154 | Cite as

MDS codes in Doob graphs

Coding Theory
  • 31 Downloads

Abstract

The Doob graph D(m, n), where m > 0, is a Cartesian product of m copies of the Shrikhande graph and n copies of the complete graph K 4 on four vertices. The Doob graph D(m, n) is a distance-regular graph with the same parameters as the Hamming graph H(2m + n, 4). We give a characterization of MDS codes in Doob graphs D(m, n) with code distance at least 3. Up to equivalence, there are m 3/36+7m 2/24+11m/12+1−(m mod 2)/8−(m mod 3)/9 MDS codes with code distance 2m + n in D(m, n), two codes with distance 3 in each of D(2, 0) and D(2, 1) and with distance 4 in D(2, 1), and one code with distance 3 in each of D(1, 2) and D(1, 3) and with distance 4 in each of D(1, 3) and D(2, 2).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.MATHGoogle Scholar
  2. 2.
    Kokkala, J.I. and Östergard, P.R.J, Classification of Graeco–Latin Cubes, J. Combin. Des., 2015, vol. 23, no. 12, pp. 509–521.CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Kokkala, J.I., Krotov, D.S., and Östergard, P.R.J, On the Classification of MDS Codes, IEEE Trans. Inform. Theory, 2015, vol. 61, no. 12, pp. 6485–6492.CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Kokkala, J.I. and Östergard, P.R.J, Further Results on the Classification of MDS Codes, Adv. Math. Commun., 2016, vol. 10, no. 3, pp. 489–498.CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Alderson, T.L., (6, 3)-MDS Codes over an Alphabet of Size 4, Des. Codes Cryptogr., 2006, vol. 38, no. 1, pp. 31–40.CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Krotov, D.S. and Potapov, V.N., n-Ary Quasigroups of Order 4, SIAM J. Discrete Math., 2009, vol. 23, no. 2, pp. 561–570.CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Krotov, D.S. and Bespalov E.A., Distance-2 MDS Codes and Latin Colorings in the Doob Graphs, arXiv:1510.01429 [math.CO], 2015.Google Scholar
  8. 8.
    Ball, S, On Sets of Vectors of a Finite Vector Space in Which Every Subset of Basis Size Is a Basis, J. Eur. Math. Soc. (JEMS), 2012, vol. 14, no. 3, pp. 733–748.CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Ball, S. and De Beule, J, On Sets of Vectors of a Finite Vector Space in Which Every Subset of Basis Size Is a Basis II, Des. Codes Cryptogr., 2012, vol. 65, no. 1–2, pp. 5–14.CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Krotov, D.S, Perfect Codes in Doob Graphs, Des. Codes Cryptogr., 2016, vol. 80, no. 1, pp. 91–102.CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2017

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsSiberian Branch of the Russian Academy of SciencesNovosibirskRussia

Personalised recommendations