Generation of quinqueanary pulse compression sequences using FPGA
MUSP'08 Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing
Real time generation of the Quinquenary pulse compression sequence using FPGA
WSEAS Transactions on Signal Processing
FPGA implementation of the binary pulse compression sequences with good merit factor
Proceedings of the International Conference on Advances in Computing, Communication and Control
The perfect binary sequence of period 4 for low periodic and aperiodic autocorrelations
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Appended m-sequences with merit factor greater than 3.34
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
The merit factor problem for binary sequences
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A survey of the merit factor problem for binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Univariate and multivariate merit factors
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Advances in the merit factor problem for binary sequences
Journal of Combinatorial Theory Series A
| Hi-index | 754.84 |
M.J.E. Golay (ibid., vol.IT-23, no.1, p.43-51, 1977) has used the ergodicity postulate to calculate that the merit factor F of a Legendre sequence offset by a fraction f of its length has an asymptotic value given by 1/F=(2/3)-4|f|+8f 2, |f|⩽1/2, which gives F=6 for |f |=1/4. Here this is proved without using the ergodicity postulate