Answering a Question of Pott on Almost Perfect Sequences
Designs, Codes and Cryptography
Rapid sequence homology assessment by subsampling the genome space using difference sets
IEEE Transactions on Information Theory - Special issue on information theory in molecular biology and neuroscience
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
A novel method for constructing almost perfect polyphase sequences
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Almost-perfect and odd-perfect ternary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Sequences and functions derived from projective planes and their difference sets
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
| Hi-index | 754.84 |
Shows that almost perfect autocorrelation sequences are the same as certain cyclic divisible difference sets. The authors apply known theorems on divisible difference sets to simplify and strengthen results by J. Wolfmann [1992]. In particular, they answer two questions which were posed by Wolfman