scientific article; zbMATH DE number 4211968
From MaRDI portal
Publication:3360124
Recommendations
- Spectrum of sizes for perfect deletion-correcting codes
- Embedding in a perfect code
- A survey of perfect codes
- Codes for perfectly correcting errors of limited size
- A product construction for perfect codes over arbitrary alphabets (Corresp.)
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
- scientific article; zbMATH DE number 5054189
- scientific article; zbMATH DE number 3926802
- scientific article; zbMATH DE number 6516526
- On the reconstruction of perfect codes
Cited in
(14)- On the construction of perfect deletion-correcting codes using design theory
- Sequence Covering Arrays and Linear Extensions
- Spectrum of sizes for perfect deletion-correcting codes
- LMAS: the key to enumerating 2-spheres over the edit metric
- A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes
- On perfect deletion-correcting codes
- Spectrum of sizes for perfect 2-deletion-correcting codes of length 4
- Optimal variable-length insertion-deletion correcting codes and edit metric codes
- Efficient reconstruction of sequences from their subsequences of supersequences
- On perfect sequence covering arrays
- A polynomial construction of perfect sequence covering arrays
- Partitions into perfect codes in the Hamming and Lee metrics
- Improved Bounds for Codes Correcting Insertions and Deletions
- Excess coverage arrays and Levenshtein's conjecture
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 Q3360124)
