A new recursive universal code of the positive integers

A new recursive universal code of the positive integers is proposed, in which any given sequence can be used as a delimiter of codeword while bit “0” is used as a delimiter in known universal codes, e.g., Levenshtein code, Elias ω code, Even-Rodeh code, Stout code, Bentley-Yao code, etc. The codeword length of the proposed code is shorter than log₂ⁿ n in almost all of sufficiently large positive integers although the known codes are longer than log₂ⁿ n for any positive integer n