A note on double insertion/deletion correcting codes

Authors:
T. G. Swart;H. C. Ferreira
Affiliations:
Dept. of Electr. & Electron. Eng., Rand Afrikaans Univ., Auckland Park, South Africa;-
Venue:
IEEE Transactions on Information Theory
Year:
2003

Citing 0
Cited 3

Algorithms for subsequence combinatorics

Theoretical Computer Science
Undetected errors in quasi-cyclic LDPC codes caused by receiver symbol slips

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Spectrum of Sizes for Perfect Deletion-Correcting Codes

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	754.84

Visualization

Abstract

By using a run-length representation of sequences, ways to determine suband supersequences are discussed. This is then used in determining the number of sub- and supersequences of a sequence after double insertions or deletions. It is also used in creating subsequence/supersequence books that are searched to find new double insertion/deletion correcting code books with higher cardinalities than those already known.