The following pages link to Completing biprefix codes (Q790624):
Displaying 14 items.
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- Completion of recognizable bifix codes (Q673111) (← links)
- Finite biprefix sets of paths in a graph (Q1105386) (← links)
- On maximal codes with bounded synchronization delay (Q1275457) (← links)
- Maximal bifix codes (Q1292485) (← links)
- On the degree of finite maximal biprefix codes (Q1322583) (← links)
- Completing comma-free codes (Q1399997) (← links)
- Completion of codes with finite bi-decoding delays. (Q1426443) (← links)
- A property of biprefix codes (Q3793748) (← links)
- Completing codes (Q3823514) (← links)
- (Q4421573) (← links)
- A completion algorithm for codes with bounded synchronization delay (Q4571942) (← links)
- Finite maximal solid codes (Q5958127) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)