scientific article; zbMATH DE number 525969
From MaRDI portal
Publication:4284975
zbMATH Open0787.94023MaRDI QIDQ4284975FDOQ4284975
Authors: Vladimir Levenshtein 
Publication date: 19 April 1994
Title of this publication is not available (Why is that?)
Cited In (21)
- On the Varshamov-Tenengolts construction on binary strings
- Construction of single-deletion-correcting DNA codes using CIS codes
- Perfect codes in the discrete simplex
- An algebra of discrete channels that involve combinations of three basic error types
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Reconstructing Words from Right-Bounded-Block Words
- Natural metrics and their properties. I: Submetrics and overmetrics
- Algorithms for subsequence combinatorics
- Shattering \(k\)-sets with permutations
- On Optimal k-Deletion Correcting Codes
- Insdel codes from subspace and rank-metric codes
- A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes
- Smallest defining sets of directed triple systems
- Some combinatorial constructions for optimal perfect deletion-correcting codes
- Reconstructing words from right-bounded-block words
- Applications of Gaussian binomials to coding theory for deletion error correction
- Constructions of multi-permutation codes correcting a single burst of deletions
- Perfect sequence covering arrays
- A group-based structure for perfect sequence covering arrays
- Growth of the perfect sequence covering array number
- A survey on maximum distance holey packings
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)
