7 papers
Decoding Algorithms for MDS Array Codes
Sara D. Cardell, Gustavo Terra Bastos, Cintya Wink de Oliveira Benedito
We study decoding procedures for a family of MDS array codes previously constructed from the Kronecker product of a superregular matrix and a non-singular matrix over a finite fiel…
Weight Distributions of Single Parity-Check Product Codes via Character Sums
Makson Miller Alves Ribeiro, Sara D. Cardell
We investigate structural and enumerative properties of binary single parity-check product codes. For each , denotes the binary single parity-check…
Construction of Generalized Weighing-Hadamard Matrices over Finite Fields
Gustavo T. Bastos, Miguel Beltrá, Sara D. Cardell +1
The existence, several properties, and constructions of Generalized Weighing-Hadamard (GWH) matrices over finite fields are addressed in this work. We study the subset of invertibl…
Binomial sequences over prime fields
Miguel Beltrá, Sara D. Cardell, Verónica Requena
The binary binomial sequences correspond to the diagonals of the Pascal's triangle modulo 2. They have interesting properties such as they form a basis of the linear space of all b…
Cellular Automata as Generators of Interleaving Sequences
Sara D. Cardell
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream…
A New Representation of Binary Sequences by means of Boolean Functions
S. D. Cardell, A. Fúster-Sabater, V. Requena +1
Boolean functions and binary sequences are main tools used in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary se…
Recovering decimation-based cryptographic sequences by means of linear CAs
Sara D. Cardell, Amparo Fúster-Sabater
The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. Thes…