Cargando…
Semidefinite bounds for nonbinary codes based on quadruples
For nonnegative integers q, n, d, let [Formula: see text] denote the maximum cardinality of a code of length n over an alphabet [q] with q letters and with minimum distance at least d. We consider the following upper bound on [Formula: see text] . For any k, let [Formula: see text] be the collection...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6743707/ https://www.ncbi.nlm.nih.gov/pubmed/31564769 http://dx.doi.org/10.1007/s10623-016-0216-5 |