Error-correction, and finite-delay decodability
From MaRDI portal
Recommendations
Cited in
(16)- Retrograde codes and bounded synchronization delay
- Error-detecting properties of languages
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
- Language equations, maximality and error-detection
- Variable-length codes independent or closed with respect to edit relations
- Implementation of code properties via transducers
- Computing maximal error-detecting capabilities and distances of regular languages
- Generalizations of code languages with marginal errors
- State complexity of neighbourhoods and approximate pattern matching
- State complexity of neighbourhoods and approximate pattern matching
- Descriptional complexity of error detection
- Picture codes and deciphering delay
- Quasi-distances and weighted finite automata
- Maximal error-detecting capabilities of formal languages
- Regular expressions and transducers over alphabet-invariant and user-defined labels
- Synchronization
This page was built for publication: Error-correction, and finite-delay decodability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422240)