We consider some classes of codes defined by length-increasing transitive binary relations. The embedding problem for these classes of codes is solved for both the finite and regular case. Characterizations of these codes, especially of the maximal ones are established.