main-content

## Designs, Codes and Cryptography OnlineFirst articles

21-01-2021

### The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude

In 2008, a class of binary sequences of period $$N=4(2^k-1)(2^k+1)$$ N = 4 ( 2 k - 1 ) ( 2 k + 1 ) with optimal autocorrelation magnitude has been presented by Yu and Gong based on an m-sequence, the perfect sequence (0, 1, 1, 1) of period 4 and …

19-01-2021

### Generalized Hadamard full propelinear codes

Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full propelinear …

19-01-2021

### Characterization and classification of optimal LCD codes

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $$\mathbb {F}_q$$ F q having large minimum weights for $$q \in \{2,3\}$$ q ∈ { 2 , 3 } . Using the …

19-01-2021

### Grain-like structures with minimal and maximal period sequences

Nonlinear feedback shift registers (NFSRs) are important building blocks for stream ciphers. The cascade connection of an n-stage full-length linear feedback shift register (LFSR) into an m-stage NFSR is called a Grain-like structure. In this …

19-01-2021

### Roulette games and depths of words over finite commutative rings

In this paper, we propose three new turn-based two player roulette games and provide positional winning strategies for these games in terms of depths of words over finite commutative rings with unity. We further discuss the feasibility of these …