Insertion/deletion correction with spectral nulls

Ferreira, H.C.; Clarke, W.A.; Helberg, A.S.J.; Abdel-Ghaffar, Khaled; Vinck, A. J. Han

doi:10.1109/18.556130

Cited by 39 publications

(23 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…in marker 1111 Never marker schemes have been used to identify synchronisation errors in literature [9], [10]. For this simulation, the codebook C add is represented by (155,105) Reed-Solomon code.…”

Section: Simulationmentioning

confidence: 99%

Partitioned moment balancing template and the influence of partition distribution thereon

Palunčić

Clarke

Ferreira

2008

2008 IEEE Information Theory Workshop

View full text Add to dashboard Cite

A partitioned moment balancing template (systematic encoding of some number theoretic codes) is presented that can correct a single insertion/deletion. Instead of dispersing the moment balancing bits across the template, they are grouped together. Moment balancing templates are used to add insertion/deletion correcting capability to an additive-error-correcting code. The effect of using a particular additive-error-correcting code on the minimum number of moment balancing bits is investigated.

show abstract

Section: Simulationmentioning

confidence: 99%

Partitioned moment balancing template and the influence of partition distribution thereon

Palunčić

Clarke

Ferreira

2008

2008 IEEE Information Theory Workshop

View full text Add to dashboard Cite

show abstract

“…As an example, consider the channel ( ) s s s(2; 5) that permits a total of up to two substitutions and deletions in any factor of length 5 of the message. As 101000 obtains from w = 0000000 by deleting w [7] and substituting w [3] …”

Section: B( )mentioning

confidence: 99%

On a simple method for detecting synchronization errors in coded messages

Konstantinidis

Perron

Wilcox-O'Hearn

2003

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We investigate the problem of designing pairs ( ) of words with the property that, if each word of a coded message is prefixed by and suffixed by , the resulting set of coded messages is error detecting with finite delay. We consider (combinatorial) channels permitting any combination of the substitution, insertion, and deletion (SID) error types, and address the cases of both scattered and burst errors. A pair ( ) with the above property is evaluated in terms of three parameters: redundancy, delay of decoding, and frequency of the detectable errors. In the case of SID channels with burst errors, we provide a complete and explicit characterization of their error-detecting pairs ( ), which involves the period of the word .Index Terms-Burst errors, decoding delay, deletion, error detection, insertion, period of word.

show abstract

“…Subsequently, a combination of markers with number-theoretic codes were proposed in [6]- [8]. However, this boundary problem prompted others to search for alternate solutions that are independent of number-theoretic constructions.…”

Section: Introductionmentioning

confidence: 97%

“…In this paper we will show how insertion/deletion detecting codes provide a different perspective on the boundary problem of number-theoretic codes. In particular, we will concentrate on the schemes in [6] and [9], and indicate how insertion/deletion detecting codes can be used to improve and/or extend these schemes.…”

Section: Introductionmentioning

confidence: 99%

Insertion/Deletion Detecting Codes and the Boundary Problem

Palunčić

Abdel-Ghaffar

Ferreira

2013

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Insertion/deletion detecting codes were introduced by Konstantinidis et al. In this paper we define insertion/deletion detecting codes in a slightly different manner, and based on this definition, we introduce multiple deletion and multiple insertion detecting codes. It is shown that these codes, which are systematic, are optimal in the sense that there exists no other systematic multiple deletion (insertion) detecting codes with a better rate. One of the limitations of number-theoretic code constructions intended to correct insertion/deletion errors, e.g., the Levenshtein code, is that they require received codeword boundaries to be known in order to successfully decode. In literature, a number of schemes have been proposed to deal with this problem. We show how insertion/deletion detecting codes as presented in this paper can be used to improve and/or extend some of these schemes.

show abstract

Insertion/deletion correction with spectral nulls

Cited by 39 publications

References 14 publications

Partitioned moment balancing template and the influence of partition distribution thereon

Partitioned moment balancing template and the influence of partition distribution thereon

On a simple method for detecting synchronization errors in coded messages

Insertion/Deletion Detecting Codes and the Boundary Problem

Contact Info

Product

Resources

About