On maximal synchronous codes.

DOI10.1016/S0304-3975(03)00097-5zbMATH Open1045.94008MaRDI QIDQ1426041FDOQ1426041

Yannick Guesnet

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

variable-length codesmaximal synchronous codessynchronous pair

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

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 (3)

• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• Completing circular codes in regular submonoids
• Limited semaphore codes

Recommendations

• Maximal Prefix-Synchronized Codes 👍 👎
• On the construction of maximal prefix-synchronized codes 👍 👎
• On maximal codes with bounded synchronization delay 👍 👎
• Codes with bounded synchronization delay 👍 👎
• On the construction of statistically synchronizable codes 👍 👎
• On maximal codes with a finite interpreting delay. 👍 👎
• Optimal synchronous coding 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)