Bounded delay L codes
From MaRDI portal
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.
Recommendations
Cites work
- Ambiguity and decision problems concerning number systems
- Bases and ambiguity of number systems
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 49145 (Why is no real title available?)
- scientific article; zbMATH DE number 566083 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- It is decidable whether or not a permutation-free morphism is an l code
- L codes and number systems
- Linear numeration systems of order two
- Unique representation in number systems and L codes
Cited in
(8)- Maximal codes with bounded deciphering delay
- Retrograde codes and bounded synchronization delay
- On D0L systems with immigration
- Caractérisation results about L codes
- scientific article; zbMATH DE number 176764 (Why is no real title available?)
- scientific article; zbMATH DE number 1528667 (Why is no real title available?)
- On the construction of bounded-delay encodable codes for constrained systems
- L codes and number systems
This page was built for publication: Bounded delay L codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178694)
