On maximal synchronous codes.
From MaRDI portal
Publication:1426041
DOI10.1016/S0304-3975(03)00097-5zbMath1045.94008MaRDI QIDQ1426041
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
94A45: Prefix, length-variable, comma-free codes
Related Items
FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS, Completing circular codes in regular submonoids
Cites Work
- Unnamed Item
- On completion of codes with finite deciphering delay
- On codes having no finite completions
- On maximal codes with bounded synchronization delay
- Maximal bifix codes
- On maximal codes with a finite interpreting delay.
- Each regular code is included in a maximal regular code
- Completing codes
- Extended synchronizing codewords for \(q\)-ary complete prefix codes