Binary sequences derived from ML-sequences over rings I: periods and minimal polynomials
Journal of Cryptology
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
Quaternary Codes
Z8-Kerdock codes and pseudorandom binary sequences
Journal of Complexity - Special issue on coding and cryptography
Quaternary Codes and Biphase Sequences from \mathbb{Z}_8-Codes
Problems of Information Transmission
Finite Fields And Galois Rings
Finite Fields And Galois Rings
Weighted degree trace codes for PAPR reduction
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Improved binary codes and sequence families from Z4-linear codes
IEEE Transactions on Information Theory
On the existence and construction of good codes with low peak-to-average power ratios
IEEE Transactions on Information Theory
Random properties of the highest level sequences of primitive sequences over Z(2e)
IEEE Transactions on Information Theory
Dentist 2: 00On codes with low peak-to-average power ratio for multicode CDMA
IEEE Transactions on Information Theory
The most significant bit of maximum-length sequences over Z2l: autocorrelation and imbalance
IEEE Transactions on Information Theory
Low-Correlation, High-Nonlinearity Sequences for Multiple-Code CDMA
IEEE Transactions on Information Theory
Quaternary quadratic residue codes and unimodular lattices
IEEE Transactions on Information Theory
An upper bound for Weil exponential sums over Galois rings and applications
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We survey our constructions of pseudo random sequences (binary, Z8, Z2l,...) from Galois rings. Techniques include a local Weil bound for character sums, and several kinds of Fourier transform. Applications range from cryptography (boolean functions, key generation), to communications (multi-code CDMA), to signal processing (PAPR reduction).