Spectrum of sizes for perfect deletion-correcting codes
From MaRDI portal
Abstract: One peculiarity with deletion-correcting codes is that perfect -deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius with respect to the Levenshteu{i}n distance may be of different sizes. There is interest, therefore, in determining all possible sizes of a perfect -deletion-correcting code, given the length and the alphabet size~. In this paper, we determine completely the spectrum of possible sizes for perfect -ary 1-deletion-correcting codes of length three for all , and perfect -ary 2-deletion-correcting codes of length four for almost all , leaving only a small finite number of cases in doubt.
Recommendations
Cited in
(6)- Some combinatorial constructions for optimal perfect deletion-correcting codes
- On the construction of perfect deletion-correcting codes using design theory
- The existence of the perfect deletion code with mixed length {4,5,6}
- scientific article; zbMATH DE number 4211968 (Why is no real title available?)
- On perfect deletion-correcting codes
- Spectrum of sizes for perfect 2-deletion-correcting codes of length 4
This page was built for publication: Spectrum of sizes for perfect deletion-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084211)