Finite maximal solid codes
From MaRDI portal
Publication:5958127
DOI10.1016/S0304-3975(00)00277-2zbMath0983.68096MaRDI QIDQ5958127
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (7)
FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ When variable-length codes meet the field of error detection ⋮ Topologies for error-detecting variable-length codes ⋮ Automata for solid codes ⋮ Synchronization ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Error-detecting properties of languages
Cites Work
- Completion of recognizable bifix codes
- On completion of codes with finite deciphering delay
- Completing biprefix codes
- Solid codes and disjunctive domains
- Each regular code is included in a maximal regular code
- Sur un algorithme donnant les codes bipréfixes finis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finite maximal solid codes