Title: Finite maximal infix codes
    Author: Nguyen Huong Lam
    Abstract: Infix code are subsets consisting of words none of which is a factor of others. The infix codes form  a special subclass of bifix codes. In some respects infix codes stand closely to bifix codes, while in others they behave much differently. It has been known that, unlike bifix codes, finite maximal infix codes are definitely not maximal as codes, unless they are the uniform codes and  every finite infix code is included in a finite maximal infix code, but it is shown in this paper also that, like bifix codes, every regular infix code is included in a regular maximal infix code.
However, the main result of this paper is an algorithm to produce all finite maximal infix codes from the uniform codes, that is similar to  a result of C\'esari  on finite maximal bifix codes.