Maximal codes with bounded deciphering delay
Theoretical Computer Science
Decoders with initial state invariance for multivalued encodings
Theoretical Computer Science
Coding and information theory
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1
Aspects of classical language theory
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
Journal of Automata, Languages and Combinatorics
An algebra of discrete channels that involve combinations of three basic errors types
Information and Computation
Theoretical Computer Science
Foundations of Coding Theory
Theory of Codes
Error Corrections for Channels with Substitutions, Insertions, and Deletions
Selected Papers from the 4th Canadian Workshop on Information Theory and Applications II
Asymptotically optimal low-cost solid codes
Journal of Automata, Languages and Combinatorics
Language equations, maximality and error-detection
Journal of Computer and System Sciences
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Block Substitutions and Their Properties
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
The language property of error-detection ensures that the communications medium cannot transform a word of the language to another word of the language. In this paper we provide some insights on the notion of error-detection from a language theoretic point of view. We define certain error-detecting properties of languages and codes including the notion of error-detection with finite delay which is a natural extension of unique decodability with finite delay. We obtain results about the error-detecting capabilities of regular and other languages, and of known classes of codes. Moreover, we consider the problem of estimating the optimal redundancy of infinite languages with the property of detecting errors of the deletion type.