Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes
Designs, Codes and Cryptography
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
New Sequences with Low Correlation and Large Family Size
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Galois rings and pseudo-random sequences
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Multiplicative characters, the weil bound, and polyphase sequence families with low correlation
IEEE Transactions on Information Theory
Improved p-ary codes and sequence families from Galois rings
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Weighted degree trace codes for PAPR reduction
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
An Upper Bound for the Extended Kloosterman Sums over Galois Rings
Finite Fields and Their Applications
| Hi-index | 754.90 |
A bound on exponential sums over Galois rings is used to construct a nested chain of Z4-linear binary codes and binary sequences. When compared with the chain of Delsarte-Goethals'(1975) codes, the codes in the new chain offer a larger minimum distance for the same code size. The binary sequence families constructed also make use of Nechaev's (1991) construction of a cyclic version of the Kerdock code. For a given value of maximum correlation, the binary sequences are shown to have a family size considerably larger than the best sequence families known