On maximal synchronous codes.
From MaRDI portal
Publication:1426041
DOI10.1016/S0304-3975(03)00097-5zbMATH Open1045.94008MaRDI QIDQ1426041FDOQ1426041
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- On maximal codes with bounded synchronization delay
- Maximal Prefix-Synchronized Codes
- On the construction of maximal prefix-synchronized codes
- scientific article
- On maximal prefix codes.
- On maximal codes with a finite interpreting delay.
- On the construction of statistically synchronizable codes
- Codes with bounded synchronization delay
- scientific article; zbMATH DE number 3910299
- Optimal synchronous coding
Cites Work
- Title not available (Why is that?)
- On codes having no finite completions
- Each regular code is included in a maximal regular code
- Completing codes
- On completion of codes with finite deciphering delay
- On maximal codes with bounded synchronization delay
- On maximal codes with a finite interpreting delay.
- Maximal bifix codes
- Extended synchronizing codewords for \(q\)-ary complete prefix codes
Cited In (7)
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- Completing circular codes in regular submonoids
- An embedding algorithm for supercodes and sucypercodes
- T-shift synchronization codes
- Title not available (Why is that?)
- Each regular code is included in a maximal regular code
- Limited semaphore codes
This page was built for publication: On maximal synchronous codes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426041)
