Abstract: Let be
the q-ary linear lexicographic codes (or lexicodes) with minimum
distance d. In this paper, we shall
introduce an algorithm to find the basis of
length n in related to Turning Turtles.
According to Mock Turtles, we can obtain the basis of
In fact, can
be obtained from by
adjoining a digit 0 or 1. In addition, a decoding scheme of these codes will be
given.
