INITIAL LITERAL SHUFFLES OF UNIFORM CODES

It is known that the family of prefix codes is closed under the initial literal shuffle operation. However, it has not been known whether or not other families of codes are closed under this operation. In this paper we investigate the initial literal shuffles of subsets of full uniform codes. We shall show that the initial literal shuffle operation preserves various properties of uniform codes under certain conditions. From this fact, we can construct more complicated uniform codes from simpler uniform codes by using the initial literal shuffle operation.