On perfect deletion-correcting codes

DOI10.1002/JCD.10069MaRDI QIDQ4452468zbMATH OpenOpenAlexFDO

Authors Andreas Klein

Publication date 12 February 2004

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.10069

zbMATH Keywords

application of combinatorial designsdeletion-correcting codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Other types of codes (94B60)

Recommendations

• Existence of perfect 3-deletion-correcting codes
• Spectrum of sizes for perfect deletion-correcting codes
• On the construction of perfect deletion-correcting codes using design theory
• scientific article; zbMATH DE number 4211968
• Constructions for Perfect 5-Deletion-Correcting Codes of Length7

Cites work

• On Quadruple Systems
• Über Steinersche Systeme

Cited in

(14)

• Some combinatorial constructions for optimal perfect deletion-correcting codes
• Existence of perfect 3-deletion-correcting codes
• On the construction of perfect deletion-correcting codes using design theory
• Deletion correcting codes meet the Littlewood-Offord problem
• A group-based structure for perfect sequence covering arrays
• Constructions of multi-permutation codes correcting a single burst of deletions
• Spectrum of sizes for perfect deletion-correcting codes
• scientific article; zbMATH DE number 5302391 (Why is no real title available?)
• On Optimal k-Deletion Correcting Codes
• Burst-deletion-correcting codes for permutations and multipermutations
• On perfect sequence covering arrays
• A polynomial construction of perfect sequence covering arrays
• Packing designs with large block size
• Excess coverage arrays and Levenshtein's conjecture

This page was built for publication: On perfect deletion-correcting codes

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