Classes of codes defined by binary relations are considered. It turns out that many classes of codes can be defined by length-increasing transitive binary relations. By introducing a general embedding schema we show that the embedding problem can be solved in a unified way for many classes of codes defined in such a way. Several among these classes of codes can be characterized by means of variants of Parikh vectors. This is very useful in constructing many-word concrete codes, maximal codes in corresponding classes of codes. Also, this allows to establish procedures to generate all maximall codes as well as algorithms to embed a code in a maximal one in some classes of codes. © Springer-Verlag Berlin Heidelberg 2005.

Van D.L., Hung K.V., Huy P.T.

704.pdf    Gửi cho bạn bè

Từ khóa : Algorithms; Binary codes; Problem solving; Vectors; Binary relation; Embedding problem; Parikh vector; Binary sequences