Bounded delay L codes (Q1178694)

A code is a morphism \(h\). The code obtained by applying \(h\) to the first letter of the plaintext, \(h^ 2\) to the second letter, \(h^ 3\) to the third letter, and so on, is referred to as \(L\)-code. A code being of bounded delay means the existence of a constant \(k\) such that the first \(k\) letters of the cryptotext uniquely determine the first letter of the plaintext. Three notions of bounded \(L\) codes are investigated, their relations with ordinary codes are established.