nach oben

Designs, Codes and Cryptography

Erschienen in:

16.02.2019 | Correction

Correction to: Improved Singleton bound on frequency hopping sequences and optimal constructions

verfasst von: Xing Liu, Liang Zhou

Erschienen in: Designs, Codes and Cryptography | Ausgabe 8/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Excerpt

The original version of this article contains an error. The presentation of Eq. (14) and an expression in Lemma 4 are incorrect. The correct version is given below. …

Vorheriger Artikel Improved Singleton bound on frequency hopping sequences and optimal constructions

Nächster Artikel Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices

Titel: Correction to: Improved Singleton bound on frequency hopping sequences and optimal constructions
verfasst von: Xing Liu
Liang Zhou
Publikationsdatum: 16.02.2019
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 8/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-019-00618-9

Springer Professional

Correction to: Improved Singleton bound on frequency hopping sequences and optimal constructions

Excerpt

Premium Partner

Springer Professional

Excerpt

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 8/2019

Cameron–Liebler sets of k-spaces in

At most three-weight binary linear codes from generalized Moisio’s exponential sums

Nearly optimal robust secret sharing

Additive perfect codes in Doob graphs

Optimal binary constant weight codes and affine linear groups over finite fields

Uniqueness of codes using semidefinite programming

Premium Partner