Acquisition sequences in PPM communications
暂无分享,去创建一个
[1] Costas N. Georghiades. Joint Baud and Frame Synchronization in Direct Detection Optical Communications , 1985, IEEE Trans. Commun..
[2] J. Singer. A theorem in finite projective geometry and some applications to number theory , 1938 .
[3] Solomon W. Golomb,et al. Backtrack Programming , 1965, JACM.
[4] B. Linström,et al. An inequality for B2-sequences , 1969 .
[5] Solomon W. Golomb,et al. Two-dimensional synchronization patterns for minimum ambiguity , 1982, IEEE Trans. Inf. Theory.
[6] P. F. Panter. Modulation, noise, and spectral analysis , 1965 .
[7] J. J. Stiffler,et al. Theory of synchronous communications , 1971 .
[8] P. Erdös. On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum , 1944 .
[9] S. Golomb,et al. Constructions and properties of Costas arrays , 1984, Proceedings of the IEEE.
[10] Solomon W. Golomb,et al. Numbered complete graphs, unusual rulers, and assorted applications , 1978 .
[11] P. Erdös,et al. On a problem of sidon in additive number theory, and on some related problems , 1941 .
[12] Arthur J. Bernstein,et al. A class of binary recurrent codes with limited error propagation , 1967, IEEE Trans. Inf. Theory.
[13] John P. Robinson. Optimum Golomb Rulers , 1979, IEEE Transactions on Computers.
[14] S. W. GOLOMB,et al. Generalized Barker sequences , 1965, IEEE Trans. Inf. Theory.