MDS codes in Doob graphs

Abstract: The Doob graph

D (m, n)

, where

m > 0

, is the direct product of

m

copies of The Shrikhande graph and

n

copies of the complete graph

K_{4}

on

4

vertices. The Doob graph

D (m, n)

is a distance-regular graph with the same parameters as the Hamming graph

H (2 m + n, 4)

. In this paper we consider MDS codes in Doob graphs with code distance

d g e 3

. We prove that if

2 m + n > 6

and

2 < d < 2 m + n

, then there are no MDS codes with code distance

d

. We characterize all MDS codes with code distance

d g e 3

in Doob graphs

D (m, n)

when

2 m + n l e 6

. We characterize all MDS codes in

D (m, n)

with code distance

d = 2 m + n

for all values of

m

and

n

.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: MDS codes in Doob graphs