scientific article; zbMATH DE number 525969
From MaRDI portal
Publication:4284975
Cited in
(25)- Some combinatorial constructions for optimal perfect deletion-correcting codes
- Smallest defining sets of directed triple systems
- A survey on maximum distance holey packings
- An algebra of discrete channels that involve combinations of three basic error types
- A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes
- Applications of Gaussian binomials to coding theory for deletion error correction
- Construction of single-deletion-correcting DNA codes using CIS codes
- Perfect sequence covering arrays
- Perfect codes in the discrete simplex
- Algorithms for subsequence combinatorics
- A group-based structure for perfect sequence covering arrays
- Growth of the perfect sequence covering array number
- Constructions of multi-permutation codes correcting a single burst of deletions
- On the Varshamov-Tenengolts construction on binary strings
- Natural metrics and their properties. I: Submetrics and overmetrics
- On Optimal k-Deletion Correcting Codes
- Reconstructing words from right-bounded-block words
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Insdel codes from subspace and rank-metric codes
- Reconstructing Words from Right-Bounded-Block Words
- Shattering k-sets with permutations
- Packing designs with large block size
- Rate-improved multi-permutation codes for correcting a single burst of stable deletions
- Diametric problem for permutations with the Ulam metric (optimal anticodes)
- New lower bounds for permutation codes in the Ulam metric
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284975)
