Pages that link to "Item:Q757324"
From MaRDI portal
The following pages link to On completion of codes with finite deciphering delay (Q757324):
Displayed 19 items.
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- Maximal codes with bounded deciphering delay (Q1177932) (← links)
- On maximal codes with bounded synchronization delay (Q1275457) (← links)
- Combinatorial properties of codes with degree \(n\) (Q1395008) (← links)
- Completing comma-free codes (Q1399997) (← links)
- On maximal synchronous codes. (Q1426041) (← links)
- Completion of codes with finite bi-decoding delays. (Q1426443) (← links)
- On maximal codes with a finite interpreting delay. (Q1605334) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Completing circular codes in regular submonoids (Q2474228) (← links)
- On codes having no finite completion (Q4341033) (← links)
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS (Q4464961) (← links)
- A completion algorithm for codes with bounded synchronization delay (Q4571942) (← links)
- On codes having no finite completion (Q4763927) (← links)
- On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)
- Finite maximal solid codes (Q5958127) (← links)
- When variable-length codes meet the field of error detection (Q6108733) (← links)
- Topologies for error-detecting variable-length codes (Q6186320) (← links)