Paper Info
Title
An algebra of discrete channels that involve combinations of three basic errors 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 semantics is provided for interpreting a given channel expression as a communication channel (SID channel) that permits combinations of substitutions, insertions, and deletions of symbols. Our framework permits one to generalize notions such as error correction and unique decodability, and express statements of the form “The code K can correct all errors of type ξ” and “it is decidable whether the code K is uniquely decodable for the channel described by ξ”, where ξ is any SID channel expression.
Year
DOI
Venue
2001
10.1006/inco.2001.3035
Inf. Comput.
Keywords
Field
DocType
insertion,error correction,deletion,basic errors type,error,unique decodability,substitution,code,discrete channel,channel,decidable,communication channels,mathematical model
Discrete mathematics,Error function,Of the form,Expression (mathematics),Communication channel,Algorithm,Decidability,Error detection and correction,Formal grammar,Mathematics,Bounded function
Journal
Volume
Issue
ISSN
167
2
Information and Computation
Citations 
PageRank 
References 
10
1.08
12
Authors
1
Name
Order
Citations
PageRank
Stavros Konstantinidis128331.10