Cargando…
Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming
The size of the largest binary single deletion code has been unknown for more than 50 years. It is known that Varshamov–Tenengolts (VT) code is an optimum single deletion code for block length [Formula: see text]; however, only a few upper bounds of the size of single deletion code are proposed for...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2019
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514547/ http://dx.doi.org/10.3390/e21121202 |