The existence of the perfect deletion code with mixed length {4,5,6}

MaRDI QIDQ2992091zbMATH OpenFDO

Authors Haibo Liu, Qunying Liao

Publication date 10 August 2016

zbMATH Keywords

Levenshtein distancedirected pair-wise balanced designperfect deletion error-correcting code

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorial codes (94B25)

Recommendations

• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)
• Existence of perfect 4-deletion-correcting codes with length six
• Existence of perfect 3-deletion-correcting codes
• Spectrum of sizes for perfect deletion-correcting codes
• A combinatorial construction for perfect deletion-correcting codes

Cited in

(5)

• Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$
• Spectrum of sizes for perfect deletion-correcting codes
• Existence of perfect 4-deletion-correcting codes with length six
• Constructions of perfect deletion-correcting codes of length \(\{3,4,5\}\)
• A combinatorial construction for perfect deletion-correcting codes

This page was built for publication: The existence of the perfect deletion code with mixed length {4,5,6}

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