Wordt geladen...
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...
Bewaard in:
| Gepubliceerd in: | Entropy (Basel) |
|---|---|
| Hoofdauteur: | |
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
MDPI
2019
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7514547/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e21121202 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|