http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
최적의 상관 특성과 큰 선형 복잡도를 갖는 새로운 p-진 수열군
장지용,김영식,노종선,Tor Helleseth 한국통신학회 2003 韓國通信學會論文誌 Vol.28 No.9C
For an odd prime p and integer n, m and k such that n=(2m+1)ㆍk, a new family of p-ary sequences of period p$^{n}$ -1 with optimal correlation property is constructed using the p-ary Helleseth-Gong sequences with ideal autocorrelation, where the size of the sequence family is p$^{n}$ . That is, the maximum nontrivial correlation value R$_{max}$ of all pairs of distinct sequences in the family does not exceed p$^{n}$ 2/ +1, which means the optimal correlation property in terms of Welch's lower bound. It is also derived that the linear span of the sequences in the family is (m+2)ㆍn except for the m-sequence in the family.
Seokbeom Hong,Hosung Park,Jong-Seon No,Helleseth, Tor,Young-Sik Kim IEEE 2014 IEEE transactions on information theory Vol.60 No.6
<P>In this paper, a new class of (N, K) near-optimal partial Hadamard codebooks is proposed. The construction of the proposed codebooks from Hadamard matrices is based on binary row selection sequences, which are generated by quadratic have parameters N = p<SUP>n</SUP> and K = (p - 1/2 p)(N + √N) + 1 for an odd prime p and an even positive integer n. We prove that the maximum magnitude of inner products between the code vectors of the proposed codebooks asymptotically achieves the Welch bound equality for sufficiently large p and derive their inner product distribution.</P>