Add to ORKGWe introduce the concepts “maximal error-correcting capability ” and “maximal error-detecting capability ” of a given formal language (set of words), with respect to a certain class of combinatorial channels. A combinatorial channel is a set of pairs of words describing all the possible input/output channel situations. This paper is mainly intended to obtain basic general results on these new concepts and discuss possible research directions with an emphasis on the problem of computing maximal error-detecting (or-correcting) capabilities of a given regular language
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-lang...
International audienceThe zero-error channel capacity is the maximum asymptotic rate that can be rea...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
A combinatorial channel is a set of pairs of words describing all the possible input-output channel ...
Abstract. A (combinatorial) channel γ consists of pairs of words representing all possible input-out...
Recently, there has been a renewed interest in the detection and the correction of errors which occu...
The effects that certain classes of errors have on formal languages are considered from the point of...
AbstractThe language property of error-detection ensures that the communications medium cannot trans...
When the words of a language are communicated via a noisy channel, the language property of error-de...
We introduce the concept of an -maximal error-detecting block code, for some parameter in (0,1), in ...
Ahlswede R, Cai N, Zhang Z. Zero-error capacity for models with memory and the enlightened dictator ...
AbstractRecently, the author introduced a nonprobabilistic mathematical model of discrete channels, ...
Ahlswede R. The maximal error capacity of arbitrarily varying channels for constant list sizes. IEEE...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
In this thesis, algebraic and combinatorial tools are used in the study and applications of error-co...
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-lang...
International audienceThe zero-error channel capacity is the maximum asymptotic rate that can be rea...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...
A combinatorial channel is a set of pairs of words describing all the possible input-output channel ...
Abstract. A (combinatorial) channel γ consists of pairs of words representing all possible input-out...
Recently, there has been a renewed interest in the detection and the correction of errors which occu...
The effects that certain classes of errors have on formal languages are considered from the point of...
AbstractThe language property of error-detection ensures that the communications medium cannot trans...
When the words of a language are communicated via a noisy channel, the language property of error-de...
We introduce the concept of an -maximal error-detecting block code, for some parameter in (0,1), in ...
Ahlswede R, Cai N, Zhang Z. Zero-error capacity for models with memory and the enlightened dictator ...
AbstractRecently, the author introduced a nonprobabilistic mathematical model of discrete channels, ...
Ahlswede R. The maximal error capacity of arbitrarily varying channels for constant list sizes. IEEE...
Ahlswede R, Gemma J. Bounds on algebraic code capacities for noisy channels. I. Information and Cont...
In this thesis, algebraic and combinatorial tools are used in the study and applications of error-co...
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-lang...
International audienceThe zero-error channel capacity is the maximum asymptotic rate that can be rea...
This paper continues the study of algebraic code capacities, which were introduced by Ahlswede (1971...