On the construction of perfect deletion-correcting codes using design theory

DOI10.1007/BF01390767zbMath0866.94023MaRDI QIDQ1894266

Patrick A. H. Bours

Publication date: 24 July 1995

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

perfect code; \(t\)-deletion/insertion-correcting code; ordered block-design

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory

94B25: Combinatorial codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On balanced incomplete block designs with blocks having five elements
• Nonbinary codes, correcting single deletion or insertion (Corresp.)
• The Existence and Construction of Balanced Incomplete Block Designs
• Synchronization and substitution error-correcting codes for the Levenshtein metric
• A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
• Near-optimal, single-synchronization-error-correcting code
• A family of codes for the correction of substitution and synchronization errors
• Some general results of coding theory with applications to the study of codes for the correction of synchronization errors
• An Embedding Theorem for Balanced Incomplete Block Designs