Combinatorial properties of codes with degree \(n\) (Q1395008)

The authors study the very thin codes of degree \(n\). The combinatorial properties of synchronizing codes are extended to the codes of degree \(n\geq 2\). By using a very thin code of degree \(n\), it is shown that it is possible to localize the \(n\) positions of the coded message and that the decoding of the message must pass through one of these positions. It is also proved that the degree of the finite maximal prefix codes can be determined by the gcd of the orders of their letters. The properties of codes of degree 2 are studied in particular.