Skip to main content

Cryptography and Communications

Ausgabe 5/2019

Inhalt (20 Artikel)

A construction of Abelian non-cyclic orbit codes

Joan-Josep Climent, Verónica Requena, Xaro Soler-Escrivà

On Boolean functions with several flat spectra

Gaofei Wu, Matthew Geoffrey Parker

New lower bounds on q-ary error-correcting codes

Antti Laaksonen, Patric R. J. Östergård

New linear codes over non-prime fields

Nuh Aydin, Ghada Bakbouk, Jonathan G. G. Lambrinos

New bounds for linear codes of covering radii 2 and 3

Daniele Bartoli, Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco

A novel maximum distance separable code to generate universal identifiers

Ismael Gutiérrez García, Daladier Jabba Molinares, Ivan Molina Naizir

Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight

Yana Liang, Jiali Cao, Xingfa Chen, Shiping Cai, Xiang Fan

Further results on permutation trinomials with Niho exponents

Libo Wang, Baofeng Wu, Xiaoqiang Yue, Yanbin Zheng

Integer codes correcting sparse byte errors

Aleksandar Radonjic, Vladimir Vujicic

A concatenated construction of linear complementary pair of codes

Cem Güneri, Ferruh Özbudak, Elif Saçıkara

Absorbing sets of codes from finite geometries

Allison Beemer, Kathryn Haymaker, Christine A. Kelley

Premium Partner