Insertion/deletion correction with spectral nulls

DOI10.1109/18.556130MaRDI QIDQ4340346zbMATH OpenOpenAlexFDO

Authors

Publication date 20 July 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.556130

zbMATH Keywords

balanced Levenshtein codesconstrained codesinsertion/deletion correcting codes

Mathematics Subject Classification ID

Synchronization error-correcting codes (94B50)

Recommendations

• On multiple insertion/deletion correcting codes
• scientific article; zbMATH DE number 605666
• A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
• Codes correcting a single insertion/deletion of a zero or a single peak-shift

Cited in

(2)

• Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
• A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes

This page was built for publication: Insertion/deletion correction with spectral nulls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340346)