Optimal Large Linear Complexity Frequency Hopping Patterns Derived from Polynomial Residue Class Rings
暂无分享,去创建一个
[1] A. Kempner. Polynomials and their residue systems , 1921 .
[2] B. Gordon,et al. Some New Difference Sets , 1962, Canadian Journal of Mathematics.
[3] Abraham Lempel,et al. Families of sequences with optimal Hamming-correlation properties , 1974, IEEE Trans. Inf. Theory.
[4] B. R. McDonald. Finite Rings With Identity , 1974 .
[5] Laurence B. Milstein,et al. Spread-Spectrum Communications , 1983 .
[6] R. Scholtz,et al. GMW sequences (Corresp.) , 1984 .
[7] James L. Massey,et al. Linear Complexity in Coding Theory , 1986, Coding Theory and Applications.
[8] P. Vijay Kumar,et al. Frequency-hopping code sequence designs having large linear span , 1988, IEEE Trans. Inf. Theory.
[9] John J. Komo,et al. Maximal Length Sequences for Frequency Hopping , 1990, IEEE J. Sel. Areas Commun..
[10] Leopold Bömer,et al. Complex sequences over GF(pM) with a two-level autocorrelation function and a large linear span , 1992, IEEE Trans. Inf. Theory.
[11] P. Vijay Kumar,et al. 4-phase Sequences with Near-optimum Correlation Properties , 1992, IEEE Trans. Inf. Theory.
[12] N. J. A. Sloane,et al. Modular andp-adic cyclic codes , 1995, Des. Codes Cryptogr..
[13] Mohammad Umar Siddiqi,et al. Optimal biphase sequences with large linear complexity derived from sequences over Z4 , 1996, IEEE Trans. Inf. Theory.
[14] Christine Bachoc,et al. Applications of Coding Theory to the Construction of Modular Lattices , 1997, J. Comb. Theory A.
[15] Mohammad Umar Siddiqi,et al. Optimal and Suboptimal Quadriphase Sequences Derived from Maximal Length Sequences over Z _{{\bf 4}} , 1998, Applicable Algebra in Engineering, Communication and Computing.