Generation of good edit codes from classical Hamming distance codes

MaRDI QIDQ3616667zbMATH OpenFDO

Authors Robert Flack, Sheridan Houghten

Publication date 26 March 2009

zbMATH Keywords

Genetic AlgorithmsLevenshtein DistanceOptimal Codes

Mathematics Subject Classification ID

Combinatorics on words (68R15) Linear codes (general theory) (94B05)

Recommendations

• Optimal variable-length insertion-deletion correcting codes and edit metric codes
• Properties of optimal and near optimal edit metric error correcting codes
• A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
• String editing under a combination of constraints
• How hard is to compute the edit distance

Cited in

(3)

• Properties of optimal and near optimal edit metric error correcting codes
• LMAS: the key to enumerating 2-spheres over the edit metric
• Optimal variable-length insertion-deletion correcting codes and edit metric codes

This page was built for publication: Generation of good edit codes from classical Hamming distance codes

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