On perfect deletion-correcting codes

DOI10.1002/JCD.10069zbMATH Open1035.94019OpenAlexW1994636999MaRDI QIDQ4452468FDOQ4452468

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

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
• Constructions for Perfect 5-Deletion-Correcting Codes of Length$7$

zbMATH Keywords

deletion-correcting codesapplication of combinatorial designs

Mathematics Subject Classification ID

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

Cites Work

• On Quadruple Systems
• Über Steinersche Systeme

Cited In (11)

• On perfect sequence covering arrays
• Deletion correcting codes meet the Littlewood-Offord problem
• On Optimal k-Deletion Correcting Codes
• Burst-deletion-correcting codes for permutations and multipermutations
• Title not available (Why is that?)
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• Constructions of multi-permutation codes correcting a single burst of deletions
• A group-based structure for perfect sequence covering arrays
• A polynomial construction of perfect sequence covering arrays
• Spectrum of sizes for perfect deletion-correcting codes
• On the construction of perfect deletion-correcting codes using design theory

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)