2001
DOI: 10.1006/inco.2001.3035
|View full text |Cite
|
Sign up to set email alerts
|

An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types

Abstract: Recently, the author introduced a nonprobabilistic mathematical model of discrete channels, the BEE channels, that involve the error-types substitution, insertion, and deletion. This paper defines an important class of BEE channels, the SID channels, which include channels that permit a bounded number of scattered errors and, possibly at the same time, a bounded burst of errors in any segment of predefined length of a message. A formal syntax is defined for generating channel expressions, and appropriate seman… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2002
2002
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…We now deÿne a certain class of SID-channels-see [10] for the full class of SIDchannels. Although the formal deÿnition is not required for the proofs in the present paper, it is included here so that the reader can clearly understand how these channels a ect messages.…”
Section: Basic Notation and Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…We now deÿne a certain class of SID-channels-see [10] for the full class of SIDchannels. Although the formal deÿnition is not required for the proofs in the present paper, it is included here so that the reader can clearly understand how these channels a ect messages.…”
Section: Basic Notation and Backgroundmentioning
confidence: 99%
“…To keep the basic deÿnitions general, we use the framework of P-channels (see [9]) restricted to the case of ÿnite words. This channel model is very general and includes the case of SID-channels which were presented in [8] and further extended in [10]. SID-channels are discrete channels represented by formal expressions that describe the type of errors permitted and the frequency of those errors.…”
Section: Introductionmentioning
confidence: 99%
“…Then the minimal spanning sets are less related to independent sets. Secondly, Konstantinidis [9] provided a general framework of discrete channels such that one can express various error situations in a systematic manner. The notion of bounded error effects plays an important role for modelling communication channels.…”
Section: Introductionmentioning
confidence: 99%