Message Authentication Codes with Error Correcting Capabilities
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
New Sequences with Low Correlation and Large Family Size
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Triple-error-correcting BCH-like codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Generalized modified Gold sequences
Designs, Codes and Cryptography
Crosscorrelation properties of binary sequences with ideal two-level autocorrelation
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the triple-error-correcting cyclic codes with zero set {1, 2i + 1, 2i + 1}
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
| Hi-index | 754.84 |
In a previous paper, No, Golomb, Gong, Lee and Gaal (see ibid., vol.44, p.814-17, 1998) conjectured that certain binary sequences having a simple trace description possess the ideal autocorrelation property. In the present paper it is shown that each such sequence is balanced and, moreover, that the dual of the linear cyclic code generated by the sequence and its cyclic shifts, is a triple-error correcting code having the same weight distribution as the triple-error correcting Bose-Chaudhuri-Hocquenghem (BCH) code. This cyclic code also contains a cyclic subcode that yields a new family of sequences having the same size and correlation parameters as does the family of Gold sequences