A Variable Length Approach to Moment Balancing

Palunčić, Filip; Ferreira, H.C.; Clarke, W.A.

doi:10.1109/tit.2010.2059970

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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: 99%

Insertion/Deletion Detecting Codes and the Boundary Problem

Palunčić

Abdel-Ghaffar

Ferreira

2013

IEEE Trans. Inform. Theory

Self Cite

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

Section: Introductionmentioning

confidence: 99%