ABSTRACT: In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10.

Abstract: The author investigates the properties of minimal distance lexicographic codes, or lexicode, over the ordered infinite alphabet N=(0,1,2...). The author presents a method for computing the ...

Abstract: We generalize constructions of lexicographic codes to produce locally optimal codes with a desired trellis decoding complexity. These constructions are efficient for high-rate codes and ...