A Class of Pseudonoise Sequences over GF Correlation Zone
|
|
- Holly Gray
- 5 years ago
- Views:
Transcription
1 1644 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 b 1. The index set I must be of the form I A [ B [ C where A f1g B fz 1j z 2 C 0; z 12 C 0g and C f0z j z 2 C 1; z 12 C 1g: Observe that these three sets are pairwise-disjoint. Therefore, [18] M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications. Rockville, MD: Computer Science Press, 1985, vol. 1. Revised edition: New York: McGraw-Hill, [19] T. Storer, Cyclotomy and Difference Sets (Lecture Notes in Advanced Mathematics). Chicago, IL: Markham, [20] Mobile Station Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System, TIA-EIA-IS-95, Telecommun. Ind. Assoc. as a North American 1.5 MHz Cellular CDMA Air-Interface Std., July jij 1jBj jcj 1(N4 0 1) N4 N2: The other cases can be treated similarly. ACKNOWLEDGMENT The authors wish to thank the anonymous referee for careful review of the original manuscript and helpful comments. Double-check of the computer work by S.-E. Park and C.-Y. Yum at Yonsei University and independently by S.-H. Kim at Seoul National University are greatly appreciated. REFERENCES [1] L. D. Baumert, Cyclic Difference Sets (Lecture Notes in Mathematics). Berlin, Germany: Springer-Verlag, [2] J. F. Dillon, Multiplicative difference sets via additive characters, report, preprint, [3] H. Dobbertin, Kasami power functions, permutation polynomials and cyclic difference sets, in Proc. NATO Advanced Study Institute Workshop: Difference Sets, Sequences and their Correlation Properties, Bad Windshiem, Germany, August 3 14, [4] S. W. Golomb, Shift-Register Sequences. San Francisco, CA: Holden-Day, revised edition: Laguna Hills, CA: Aegean Park, [5] J.-H. Kim and H.-Y. Song, Existence of cyclic Hadamard difference sets and its relation to binary sequences with ideal autocorrelation, J. Commun. and Networks, vol. 1, no. 1, pp , Mar [6] A. Lempel, M. Cohn, and W. L. Eastman, A class of binary sequences with optimal autocorrelation properties, IEEE Trans. Inform. Theory, vol. IT-23, pp , Jan [7] R. Lidl and H. Niederreiter, Finite fields, in Encyclopedia of Mathematics and Its Applications. Reading, MA: Addison-Wesley, 1983, vol. 20. [8] F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, [9] J.-S. No, Generalization of GMW sequences and No sequences, IEEE Trans. Inform. Theory, vol. 42, pp , Jan [10] J.-S. No, H. Chung, and M.-S. Yun, Binary pseudorandom sequences of period 2 01 with ideal autocorrelation generated by the polynomial z (z 1), IEEE Trans. Inform. Theory, vol. 44, pp , May [11] J.-S. No, S. W. Golomb, G. Gong, H.-K. Lee, and P. Gaal, Binary pseudorandom sequences of period 2 01 with ideal autocorrelation, IEEE Trans. Inform. Theory, vol. 44, pp , Mar [12] J.-S. No, H.-K. Lee, H. Chung, H.-Y. Song, and K. Yang, Trace representation of Legendre sequences of Mersenne prime period, IEEE Trans. Inform. Theory, vol. 42, pp , Nov [13] J.-S. No, H.-Y. Song, H. Chung, and K. Yang, Extension of binary sequences with ideal autocorrelation property, paper, preprint, [14] D. V. Sarwate, Comments on A class of balanced binary sequences with optimal autocorrelation properties, IEEE Trans. Inform. Theory, vol. IT-24, Jan [15] D. V. Sarwate and M. B. Pursley, Crosscorrelation properties of pseudorandom and related sequences, Proc. IEEE, vol. 68, pp , May [16] R. A. Scholtz and L. R. Welch, GMW sequences, IEEE Trans. Inform. Theory, vol. IT-30, pp , May [17] V. M. Sidelnikov, Some k-valued pseudo-random sequences and nearly equividistant codes, Probl. Pered. Inform., vol. 5, no. 1, pp , English translation in: Probl. Inform. Transm.. A Class of Pseudonoise Sequences over GF Correlation Zone with Low Xiaohu H. Tang and Pingzhi Z. Fan, Senior Member, IEEE Abstract In this correspondence, a new class of pseudonoise sequences over GF ( ), based on Gordon Mills Welch (GMW) sequences, is constructed. The sequences have the property that, in a specified zone, the out-of-phase autocorrelation and cross-correlation values are all equal to 1. Such sequences with low correlation zone (LCZ) are suitable for approximately synchronized code-division multiple-access (CDMA) system. Index Terms ACF, CCF, Gordon Mills Welch (GMW) sequence, low correlation zone (LCZ), zero correlation zone (ZCZ). I. INTRODUCTION The pseudonoise sequences with low out-of-phase autocorrelation and cross-correlation values are required for direct-sequence (DS) code-division multiple-access (CDMA) (DS-CDMA) system to reduce the multiple-access interference (MAI). M -sequences, Gold sequences, Kasami sequences, and Gordon Mills Welch (GMW) sequences are well known for their good periodic correlation [1]. A survey on the binary pseudonoise sequences was given in [2], and the related p-ary sequences were introduced by [3], [4]. Recently, an approximately synchronized (AS) CDMA (AS-CDMA) system was proposed by Suehiro [5], where the synchronization among users can be controlled within permissible time difference. AS-CDMA system without cochannel interference can be realized by using the sequences with zero correlation zone (ZCZ) [6], [7]. On the other hand, AS-CDMA system with low cochannel interference can be realized by using the sequences with low correlation zone (LCZ), as it is the case of [8]. The binary LCZ sequences introduced in [8] is based on GMW sequences. The correlation values of the sequences are almost all equal to 01 except for a few values. In this correspondence, we have extended the sequences from binary to p-ary with the same correlation property. It is shown that the binary sequence set in [8] is only a special case of our result. In the following sections, we will first present the main result of this correspondence, then give a proof of the main result, and finally conclude by an illustrative construction example. Manuscript received July 13, 1999; revised October 16, This work was supported by the National Science Foundation of China (NSFC) under Grants and The authors are with the Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, Sichuan , China ( xhutang@sina. com; p.fan@ieee.org). Communicated by S. W. Golomb, Associate Editor for Sequences. Publisher Item Identifier S (01) /01$ IEEE
2 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY II. CONSTRUCTION OF p-ary LCZ SEQUENCES Similar to ZCZ concept proposed in [6], we can ine LCZ as follows. Definition: Given a sequence set A over GF (p), each sequence having length N, let a, b 2 A, a (a 0 ;a 1 ;...;a N01), b (b 0;b 1;...;b N01), and be a constant, then the LCZ L cz is ined as L cz maxfl jjr a; b ( )j ; where (j j <L and a 6 b) where R a; b ( ) N01 i0 and 3 denotes complex conjugation and ^a i exp or (0 < j j <L and a b)g ^a i^b 3 i j 2 p ai and ^b i exp j 2 p bi where gcd(r; ) gcd(s; ) 1, and r 6 sp j mod for j 2 Z(m 0 1). Similarly, one can get two corresponding m-sequences a 0 and b 0 over GF (p m ) a 0 fa 0 ig Tr m 1 ( ri ) b 0 fb 0 ig Tr m 1 ( si ) which will be used to determine the correlation spectrum of the new sequences. 3) From sequences a and b, we can obtain the following p-ary sequence set: A a; a 0 S T b;...;a0 S ()T b; a 0 S (p 01)T b where S j denotes left-shift operator and S j b denotes j-shift version of sequence b. We will prove in the next section the following main result. Theorem 1: Let x; y 2 A, then their periodic correlation function R x; y ( ) is given by and the subscript addition i is performed modulo N. Normally, it is required that the constant should be as low as possible, for example, 0,or1, or2, etc. When 0, the LCZ L cz becomes LCZ Z cz. Moreover, a sequence with LCZ property is called LCZ sequence, a sequence set A is called LCZ sequences set if all the sequences are LCZ sequences. In this correspondence, a new class of pseudonoise LCZ sequences over GF (p) with 01 will be presented. Before the construction is given, some notations need to be explained. In order to describe the new construction, we need a p-ary GMW sequence ined by R x; y( ) N; if 0and x y 01; if 0and x 6 y p n0m 0 1 p n0m R u; v (T); if 6 0 and 0 mod T 01; if 6 0 mod T and (x a or y a) p n02m (1 R b ;a (l 1 )) (1 R b ;a (l 2)) 0 1; if 6 0 mod T; x a 0 S l T b and y a 0 S l T b a i Tr m 1 Tr n m( i ) r : Where is a primitive root of the finite field GF (p n ), and r is an integer with gcd(r; ) 1. Tr n m(x) is the trace function, and with n divisible by m, maps GF (p n ) into subfield GF (p m ) according to the relation nm01 Trm(x) n x p : Let f (x) be a primitive polynomial of with degree n, Z(n) denote the set f0; 1;...;n0 1g, and T pn 0 1 i0 and T : where the sequences u and v are ined as u a0 ; if x a a 0 0 S l b 0 ; if x a 0 S lt b v a0 ; if y a a 0 0 S l b 0 ; if y a 0 S lt b: Since the periodic correlation property of the set A is determined by the related p-ary m-sequences a 0 and b 0, by limiting the range of the left-shift operator, we can obtain the following LCZ sequences. Construction II: 2) This step is identical to Construction I. 3) Compute R b ;a, suppose there exist M 01 time shifts, such that R b ;a (l 1)R b ;a (l 2)111 R b ;a (l M01) 01 Construction I: 2) The first step of our method is to construct two GMW sequences a fa i g Tr m 1 Trm( n i r ) b fb ig m Tr 1 Trm( n i s ) then one can obtain a class of p-ary sequences A a; a 0 S l T b; a 0 S l T b;...;a0 S l T b : By Theorem 1, which is our main result, we have the following corollary.
3 1646 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 Corollary 1: Let x; y 2 A; then their periodic correlation function is given by R x; y( ) N; if 0and x y p n0m 0 1 p n0m R u; v (T); if 6 0and 0modT 01; else. Obviously, A is an LCZ sequence set with length N p n 0 1,low correlation value 01, and LCZ L cz T (p n 0 1)(): As for set size M, it can be shown in the next section that, for two special cases, we have M p m 0 p m0f and M (p m 0 p m2 )2; f will be explained later. It should be noted that the spreading codes presented in [8] is only a special case for p 2. III. PROOF OF THE MAIN RESULT In this section, we will give a proof of the main theorem presented in the last section. The well-known GMW sequence was presented in 1962 by three scholars [9]. Later, the cross-correlation function of GMW sequences was analyzed by Games [10], and the cross-correlation function of the corresponding p-ary GMW sequences were investigated in [11]. For k 2 Z(p n 0 1), ine e k 1; if Trn m( k )0 e; if Tr n m( k ) e the sequence e fe 0 ;e 1 ;...;e g is called the shift sequence associated with the primitive polynomial f (x). The following lemma is quoted from [11, Theorem 19]. Lemma: Let P ((a; b); k) be the number of i s satisfying b i Tr n m(a i ) a, b ik Tr n m(a ik ) b, a; b 2 GF (p m ), and 0 i p n 0 2. Then we have P ((a; b); k) p n02m ; p n02m 0 1; p n0m ; p n0m 0 1; if k 6 0 mod T and (a; b) 6 (0; 0) if k 6 0 mod T and (a; b) (0; 0) if k 0modT and (a; b) (a; k a); a6 0 if k 0modT and (a; b) (0; 0). The following corollary can be easily derived from the lemma. Corollary 2: Let e fe 0;e 1;...;e g be the shift sequence associated with the primitive polynomial f (x). For fixed k 2 Z(p n 0 1), k 6 0 mod T, the list of difference (e jk 0 e j (mod): j 2 Z(T )) contains each element of Z() exactly p n02m times. Based on the above corollary, we now prove the main theorem: Proof: Let x; y 2 A. There are three cases to consider: 2) x a and y a 0 S lt b; 3) x a 0 S lt b and y a; 4) x a 0 S l T b and y a 0 S l T b; where l 1, l 2 2 Z(). Here, we only consider case 3), the rest are similar. The periodic correlation function between sequence x and y is R x; y( ) i0 i0 ^x i ^y 3 i exp T 01 p Trm 1 Tr n m( i ) r 0 Tr n m il T s 0 Tr n m( i ) r Tr n m( il T ) s p Trm 1 ri Tr n m( i ) r 0 s(i l ) Tr n m( i ) s 0 ri Tr n m( i ) r s(i l ) Tr n m( i ) s (1) with i i 1 i 2T, i 1 2 Z(T ) and i 2 2 Z(). 1) 0 mod T : By trace function property, Tr n m(a k )0occurs exactly (p n0m 0 1)() times when k ranges over Z(T ). So, (1) can be simplified as the following form: R x; y ( )p n0m 0 1p n0m p Trm 1 r(i dt) s(i l dt) 0 p n0m 0 1p n0m R u; v (T) where Tr n m( i ) d, d 2 Z(). Since 0 r(i d) s(i l d) R u; v (0) R b ;b (l 2 0 l 1 )01; when l 1 6 l 2 we get R x; y (0) 01 when x 6 y. 2) 6 0 mod T : Through the Lemma, for fixed, we can get A i 1jTr n m and Tr n m i 0;i 1 2 Z(T ) kak p n02m 0 1 B i 1jTrm n and Trm( n i ) 6 0;i 1 2 Z(T ) kbk pn0m 0 p n02m C i 1 jtrm n i 60 and Trm( n i )0;i 1 2 Z(T ) kck pn0m 0 p n02m D i 1 jtrm n i Trm n i 60;i 1 2 Z(T ) kdk p n02m ():
4 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY The cross correlation is given by R x; y( ) where T01 R(i 1 ;i 2 )exp R A R B T01 T01 R(i 1;i 2jA) R(i 1 ;i 2 jc) T01 T01 p Trm 1 ri Tr n m i T01 pn0m 0 p n02m r R(i 1;i 2jB) R(i 1 ;i 2 jd) 0 s(i l ) Tr n m i s 0 ri Tr n m i r s(i l ) Tr n m i s R(i 1 ;i 2 ja) p n02m 0 1 R(i 1;i 2jB) p Trm 1 ri Tr n m( i ) r p n02m exp p n02m Rb 3 ;a (l 1 ) p n02m R b ;a (l 1) 0 s(i l ) Tr n m( i ) s p Trm r(i d) 1 s(i l d) 0 where Tr n m( i ) d, d 2 Z(), and R b ;a () is realvalued (see [11, Theorem 1]). R C T 01 pn0m 0 p n02m R(i 1;i 2jC) p Trm 1 0 ri Tr n m( i ) r s(i l ) Tr n m( i ) s Let Tr n m( i ) d and Tr n m( i ) d : For i 1 2 Z(T ), applying Corollary 2, w d 2 0 d 1 contains each element of Z() exactly p n02m times. So, we have where and R D Hence, T 01 p n02m w0 R(i 1 ;i 2 jd) p Trm 1 r(i d w) s(i l d w) 0 p n02m w0 p n02m w0 ^u(w) 0 r(i d ) s(i l d ) ^u(i 2 w)^v 3 (i 2) w0 p n02m R b ;a (l 1)R b ;a (l 2) ^v 3 (w) u Tr m 1 ( ri 0 s(l i) ) v Tr m 1 ( ri 0 s(l i) ) : R x; y ( )R A R B R C R D p n02m 0 1p n02m R b ;a (l 1) p n02m R b ;a (l 2) p n02m R b ;a (l 1)R b ;a (l 2) p n02m (1 R b ;a (l 1 )) (1 R b ;a (l 2 )) 0 1: According to the above induction, we complete the proof. Q.E.D. The size of the LCZ sequence set is determined by the spectrum of the cross correlation between a 0 and b 0. So far, we only know the two cases [12], [13]: Theorem 2 (Trachtenberg): Let f gcd(m; k) with mf odd and g p k 1; if p even (p 2k 1)2; if p odd or p 2k 0 p k 1; for any p with g 6 p j mod. Let s grp l mod, then the cross correlation take the following values: p n02m exp p n02m R b ;a (l 2) p Trm 1 0 r(i d) s(i l d) 01 p (mf)2 occurs (p m0f p (m0f)2 )2 times, 01 occurs (p m 0 p m0f 0 1) times, 01 0 p (mf)2 occurs (p m0f 0 p (m0f)2 )2 times. where Tr n m( i ) d, d 2 Z(). Applying the result to Corollary 1, we have size M p m 0 p m0f.
5 1648 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY 2001 TABLE I LCZ SEQUENCES OF LENGTH N 80, SIZE M 3, AND LCZ L 9 Theorem 3 (Helleseth): Let p be an odd prime, m be even, p m2 6 2mod3, and g 2p m Let s grp l mod, then the cross correlation take the following values: 01 0 p m2 occurs (p m 0 p m2 )3 times, 01 occurs (p m 0 p m2 0 2)2 times, 01 p m2 occurs p m2 times, 01 2p m2 occurs (p m 0 p m2 )6 times. By choosing r 1and s 7 gcd (r; ) gcd(s; ) 1 r 6 sp j mod for j 2 Z(m 0 1), and a primitive root a of GF (3 4 ) which satisfies a 4 a 2 2 0, we can obtain two GMW sequences Applying the result to Corollary 1, we have size M (p m 0 p m2 )2: According to [14], the size M of the LCZ sequence set A satisfying ML cz N 1 1 where N p n 0 1 is the length of the sequence. On the basis of the discussion, when the size M p m 0 p m01,we have ML cz (p m 0 p m0f ) N 1 p 01 p 01 p n pf 0 1 p f < 1: When p!1, the ratio ML cz N 1! 1, sequences set tends to be optimal. By Theorem 2, we have a fa i g Tr 2 1 Tr2( 4 i ) f1; 0; 0; 0; 1; 0; 0; 2; 1; 0; 1; 1; 1; 2; 0; 0; 2; 2; 0; 1; 0; 2; 2; 1; 1; 0; 1; 0; 1; 2; 1; 2; 2; 1; 2; 0; 1; 2; 2; 2; 2; 0; 0; 0; 2; 0; 0; 1; 2; 0; 2; 2; 2; 1; 0; 0; 1; 1; 0; 2; 0; 1; 1; 2; 2; 0; 2; 0; 2; 1; 2; 1; 1; 2; 1; 0; 2; 1; 1; 1g b fb i g Tr 2 1 Tr 4 2( i ) 7 f1; 0; 0; 0; 2; 0; 0; 2; 2; 0; 2; 2; 2; 1; 0; 0; 1; 1; 0; 2; 0; 2; 2; 1; 2; 0; 1; 0; 2; 2; 2; 1; 1; 2; 2; 0; 2; 1; 2; 1; 2; 0; 0; 0; 1; 0; 0; 1; 1; 0; 1; 1; 1; 2; 0; 0; 2; 2; 0; 1; 0; 1; 1; 2; 1; 0; 2; 0; 1; 1; 1; 2; 2; 1; 1; 0; 1; 2; 1; 2g and two corresponding m-sequences a 0 Tr1( 2 10i ) f2; 1; 0; 1; 1; 2; 0; 2g b 0 Tr1( 2 70i ) f2; 2; 0; 2; 1; 1; 0; 1g ML cz N 1 50%; when m is odd 75%; when m 2(mod4). with R b ;a ()f2; 04; 01; 04; 5; 2; 01; 2g: Moreover, when m 3k(k 2; 3;...), we even take f k in Theorem 2, so that 1 ML czn 1 (p 3k 0 p 2k )p 3k 10 1p k in this case, MLczN 1! 1 with m!1. IV. AN ILLUSTRATIVE EXAMPLE Let p 3, m 2, n 4,wehave Because there are two 01 s in the spectrum, i.e., R b ;a (2) R b ;a (6) 01 we have l 1 2, l 2 6. Therefore, we obtain an LCZ sequence set with N , L cz T 10, and M ( )23, i.e., A fa; a 0 S l T b; a 0 S l T bg fa; a 0 S 20 b; a 0 S 60 bg T pn : as shown in Table I. The ACFs and CCFs of these LCZ sequences are shown in Tables II and III.
6 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 4, MAY TABLE II ACFS OF THE LCZ SEQUENCES TABLE III CCFS OF THE LCZ SEQUENCES TABLE IV LIST OF PARAMETERS OF THE LCZ SEQUENCES Finally, a list of parameters of the LCZ sequences, i.e., p; m; n; length N; low correlation zone L cz ; and size M, is shown in Table IV. REFERENCES [1] P. Z. Fan and M. Darnell, Sequence Design for Communications Applications. New York: Wiley, [2] D. V. Sarwate and M. B. Pursley, Crosscorrelation properties of pseudonoise and realted sequences, Proc. IEEE, vol. 68, pp , [3] S. C. Liu and J. Komo, Nonbinary Kasami sequences over GF (p), IEEE Trans. Inform. Theory, vol. 38, pp , July [4] M. Antweiler and L. Bomer, Complex sequences over GF (p ) with two level autocorrelation function and large linear span, IEEE Trans. Inform. Theory, vol. 38, pp , Jan [5] N. Suehiro, Approximately synchronized CDMA system without cochannel using pseudo-periodic sequences, in Proc. Int. Symp. Personal Communications 93, Nanjing, China, July 1994, pp [6] P. Z. Fan, N. Suehiro, N. Kuroyanagi, and X. M. Deng, A class of binary sequences with zero correlation zone, Electron. Lett., vol. 35, pp , [7] P. Z. Fan, N. Suehiro, and N. Kuroyanagi, A novel interference-free CDMA system, in PIMRC 99, Osaka, Japan, [8] B. Long, P. Zhang, and J. Hu, A generalized QS-CDMA system and the design of new spreading codes, IEEE Trans. Veh. Technol., vol. 47, pp , Nov [9] B. Gordon, W. H. Mills, and L. R. Welch, Some new different sets, Can. J. Math., vol. 14, pp , [10] R. A. Games, Crosscorrelation of m-sequences and GMW sequences with the same primitive polynomial, Discr. Appl. Math., vol. 16, pp , [11] M. Antweiler, Cross-correlation of p-ary GMW sequences, IEEE Trans. Inform. Theory, vol. 40, pp , July [12] H. M. Trachtenberg, On the cross-correlation function of maximal linear recurring sequences, Ph.D. disseration, Dep. Elec. Eng., Univ. Southern California, Los Angeles, Jan [13] T. Helleseth, Some results about the cross-correlation function between two maximal linear sequences, Discr. Math., vol. 16, pp , [14] X. H. Tang, P. Z. Fan, and S. Matsufuji, Lower bounds on correlation of spreading sequence set with low or zero correlation zone, Electron. Lett., vol. 36, pp , Mar
Existence of Cyclic Hadamard Difference Sets and its Relation to Binary Sequences with Ideal Autocorrelation
14 JOURNAL OF COMMUNICATIONS AND NETWORKS, VOL.1, NO.1, MARCH 1999 Existence of Cyclic Hadamard Difference Sets and its Relation to Binary Sequences with Ideal Autocorrelation Jeong-Heon Kim and Hong-Yeop
More informationTrace Representation of Legendre Sequences
C Designs, Codes and Cryptography, 24, 343 348, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Trace Representation of Legendre Sequences JEONG-HEON KIM School of Electrical and
More informationOn the Cross-Correlation of a p-ary m-sequence of Period p 2m 1 and Its Decimated
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 3, MARCH 01 1873 On the Cross-Correlation of a p-ary m-sequence of Period p m 1 Its Decimated Sequences by (p m +1) =(p +1) Sung-Tai Choi, Taehyung Lim,
More informationAlmost Difference Sets and Their Sequences With Optimal Autocorrelation
2934 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 7, NOVEMBER 2001 Almost Difference Sets Their Sequences With Optimal Autocorrelation K. T. Arasu, Cunsheng Ding, Member, IEEE, Tor Helleseth,
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA July 2004 The Autocorrelation Function The autocorrelation of a binary sequence {s(t)} of period N at shift w is C s (w) = ( 1) s(t+w) s(t). N 1 t=0 The
More informationSinger and GMW constructions (or generalized GMW constructions), little else is known about p-ary two-level autocorrelation sequences. Recently, a few
New Families of Ideal -level Autocorrelation Ternary Sequences From Second Order DHT Michael Ludkovski 1 and Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo,
More informationLow Correlation Zone Sequences
Low Correlation Zone Sequences Jung-Soo Chung and Jong-Seon No Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul 151-744,
More informationA SHORT SURVEY OF P-ARY PSEUDO-RANDOM SEQUENCES. Zhaneta Tasheva
JOURNAL SCIENCE EDUCATION INNOVATION, VOL. 2. 2014 Association Scientific and Applied Research International Journal Original Contribution ISSN 1314-9784 A SHORT SURVEY OF P-ARY PSEUDO-RANDOM SEQUENCES
More informationNew quaternary sequences of even length with optimal auto-correlation
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2018, Vol. 61 022308:1 022308:13 doi: 10.1007/s11432-016-9087-2 New quaternary sequences of even length with optimal auto-correlation Wei SU
More informationNew Ternary and Quaternary Sequences with Two-Level Autocorrelation
New Ternary and Quaternary Sequences with Two-Level Autocorrelation Honggang Hu Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1, Canada Email. h7hu@uwaterloo.ca
More informationDesign of Pseudo-Random Spreading Sequences for CDMA Systems
Design of Pseudo-Random Spreading Sequences for CDMA Systems Jian Ren and Tongtong Li Department of Electrical and Computer Engineering Michigan State University, 2120 Engineering Building East Lansing,
More informationEven Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions
Even Periodic and Odd Periodic Complementary Sequence Pairs from Generalized Boolean Functions Yang Yang 1,2,3 Xiaohu Tang 1 and Guang Gong 2 1 Institute of Mobile Communications, Southwest Jiaotong University
More informationOn GMW designs and a conjecture of Assmus and Key Thomas E. Norwood and Qing Xiang Dept. of Mathematics, California Institute of Technology, Pasadena,
On GMW designs and a conjecture of Assmus and Key Thomas E. Norwood and Qing iang Dept. of Mathematics, California Institute of Technology, Pasadena, CA 91125 June 24, 1998 Abstract We show that a family
More informationConstructions of Quadratic Bent Functions in Polynomial Forms
1 Constructions of Quadratic Bent Functions in Polynomial Forms Nam Yul Yu and Guang Gong Member IEEE Department of Electrical and Computer Engineering University of Waterloo CANADA Abstract In this correspondence
More informationhas the two-level autocorrelation function for (2) otherwise, where the periodic unnormalized autocorrelation function of the sequence is defined as
1530 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 3, MARCH 2011 Trace Representation Linear Complexity of Binary eth Power Residue Sequences of Period p Zongduo Dai, Guang Gong, Hong-Yeop Song,
More informationOn a Conjectured Ideal Autocorrelation Sequence and a Related Triple-Error Correcting Cyclic Code
680 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 2, MARCH 2000 [13] B. R. McDonald, Finite Rings with Identity. New York: Marcel Dekker, 1974. [14] F. J. MacWilliams and N. J. A. Sloane, The Theory
More informationBinary Sequences with Optimal Autocorrelation
Cunsheng DING, HKUST, Kowloon, HONG KONG, CHINA September 2008 Outline of this talk Difference sets and almost difference sets Cyclotomic classes Introduction of binary sequences with optimal autocorrelation
More informationA trace representation of binary Jacobi sequences
Discrete Mathematics 309 009) 1517 157 www.elsevier.com/locate/disc A trace representation of binary Jacobi sequences Zongduo Dai a, Guang Gong b, Hong-Yeop Song c, a State Key Laboratory of Information
More informationOn the Binary Sequences of Period 2047 with Ideal Autocorrelation Seok-Yong Jin
On the Binary Sequences of Period 2047 with Ideal Autocorrelation Seok-Yong Jin The Graduate School Yonsei University Department of Electrical and Electronic Engineering On the Binary Sequences of Period
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationCorrelation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields
Correlation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields Zilong Wang and Guang Gong Department of Electrical and Computer Engineering, University of Waterloo Waterloo,
More informationFPGA Implementation of Pseudo Noise Sequences based on Quadratic Residue Theory
FPGA Implementation of Pseudo Noise Sequences based on Quadratic Residue Theory A. Rajagopal Dept. of E&C, K.L. Sudha Dept.of E&C, Dundi Ajay Dept. of E&C, ABSTRACT Pseudo Noise (PN) sequences are defined
More informationI. INTRODUCTION. A. Definitions and Notations
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 7, JULY 2010 3605 Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes Cunsheng Ding, Senior Member, IEEE, Yang Yang, Student Member,
More informationOn the p-ranks and Characteristic Polynomials of Cyclic Difference Sets
Designs, Codes and Cryptography, 33, 23 37, 2004 # 2004 Kluwer Academic Publishers. Manufactured in The Netherlands. On the p-ranks and Characteristic Polynomials of Cyclic Difference Sets JONG-SEON NO
More informationLarge Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences
Large Zero Autocorrelation Zone of Golay Sequences and 4 q -QAM Golay Complementary Sequences Guang Gong 1 Fei Huo 1 and Yang Yang 2,3 1 Department of Electrical and Computer Engineering University of
More informationOn the Linear Complexity of Legendre-Sidelnikov Sequences
On the Linear Complexity of Legendre-Sidelnikov Sequences Ming Su Nankai University, China Emerging Applications of Finite Fields, Linz, Dec. 12 Outline Motivation Legendre-Sidelnikov Sequence Definition
More informationNew Constructions of Quaternary Hadamard Matrices
New Constructions of Quaternary Hadamard Matrices Ji-Woong Jang 1, Sang-Hyo Kim 1, Jong-Seon No 1, and Habong Chung 2 1 School of Electrical Engineering and Computer Science, Seoul National University,
More informationHyperbent functions, Kloosterman sums and Dickson polynomials
Hyperbent functions, Kloosterman sums and Dickson polynomials Pascale Charpin INRIA, Codes Domaine de Voluceau-Rocquencourt BP 105-78153, Le Chesnay France Email: pascale.charpin@inria.fr Guang Gong Department
More informationDecomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
More informationStatistical Properties of the Arithmetic Correlation of Sequences. Mark Goresky School of Mathematics Institute for Advanced Study
International Journal of Foundations of Computer Science c World Scientific Publishing Company Statistical Properties of the Arithmetic Correlation of Sequences Mark Goresky School of Mathematics Institute
More informationOn the Correlation Distribution of Delsarte Goethals Sequences
On the Correlation Distribution of Delsarte Goethals Seuences Kai-Uwe Schmidt 9 July 009 (revised 01 December 009) Abstract For odd integer m 3 and t = 0, 1,..., m 1, we define Family V (t) to be a set
More informationImproved Upper Bounds on Sizes of Codes
880 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 4, APRIL 2002 Improved Upper Bounds on Sizes of Codes Beniamin Mounits, Tuvi Etzion, Senior Member, IEEE, and Simon Litsyn, Senior Member, IEEE
More informationTHE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1
J. Appl. Math. & Informatics Vol. 31(2013), No. 1-2, pp. 179-188 Website: http://www.kcam.biz THE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1 JI-MI YIM, SUNG-JIN CHO, HAN-DOO KIM, UN-SOOK CHOI
More informationThird-order nonlinearities of some biquadratic monomial Boolean functions
Noname manuscript No. (will be inserted by the editor) Third-order nonlinearities of some biquadratic monomial Boolean functions Brajesh Kumar Singh Received: April 01 / Accepted: date Abstract In this
More informationOn Binary Cyclic Codes with Codewords of Weight Three and Binary Sequences with the Trinomial Property
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 1, JANUARY 2001 421 [4] A. A. Davydov, Constructions and families of covering codes and saturated sets of points in projective geometry, IEEE Trans.
More information50 Years of Crosscorrelation of m-sequences
50 Years of Crosscorrelation of m-sequences Tor Helleseth Selmer Center Department of Informatics University of Bergen Bergen, Norway August 29, 2017 Tor Helleseth (Selmer Center) 50 Years of Crosscorrelation
More information6054 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 9, SEPTEMBER 2012
6054 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 9, SEPTEMBER 2012 A Class of Binomial Bent Functions Over the Finite Fields of Odd Characteristic Wenjie Jia, Xiangyong Zeng, Tor Helleseth, Fellow,
More informationTopic 3. Design of Sequences with Low Correlation
Topic 3. Design of Sequences with Low Correlation M-sequences and Quadratic Residue Sequences 2 Multiple Trace Term Sequences and WG Sequences 3 Gold-pair, Kasami Sequences, and Interleaved Sequences 4
More informationOn Welch-Gong Transformation Sequence Generators
On Welch-Gong Transformation Sequence Generators G. Gong and A.M. Youssef Center for Applied Cryptographic Research, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario
More informationFour classes of permutation polynomials of F 2 m
Finite Fields and Their Applications 1 2007) 869 876 http://www.elsevier.com/locate/ffa Four classes of permutation polynomials of F 2 m Jin Yuan,1, Cunsheng Ding 1 Department of Computer Science, The
More informationConstructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice
Noname manuscript No. (will be inserted by the editor) Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice Chunming Tang Yanfeng Qi Received: date
More informationNew chaotic binary sequences with good correlation property using logistic maps
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735. Volume 5, Issue 3 (Mar. - Apr. 013), PP 59-64 New chaotic binary with good correlation property using
More informationInteger Valued Sequences with 2-Level Autocorrelation from Iterative Decimation Hadamard Transform
Integer Valued Sequences with 2-Level Autocorrelation from Iterative Decimation Hadamard Transform Guang Gong Department of Electrical and Computer Engineering University of Waterloo CANADA
More informationConstruction of Frequency Hopping Sequence Set Based upon. Generalized Cyclotomy
1 Construction of Frequency Hopping Sequence Set Based upon Generalized Cyclotomy Fang Liu, Daiyuan Peng, Zhengchun Zhou, and Xiaohu Tang Abstract: Frequency hopping (FH) sequences play a key role in frequency
More informationMinimal polynomials of the modified de Bruijn sequences
Discrete Applied Mathematics 156 (2008) 1549 1553 www.elsevier.com/locate/dam Minimal polynomials of the modified de Bruijn sequences Gohar M. Kyureghyan Department of Mathematics, Otto-von-Guericke University
More informationSome results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences
Some results on cross-correlation distribution between a p-ary m-sequence and its decimated sequences A joint work with Chunlei Li, Xiangyong Zeng, and Tor Helleseth Selmer Center, University of Bergen
More informationHelleseth, T. & Kumar, P.V. Pseudonoise Sequences Mobile Communications Handbook Ed. Suthan S. Suthersan Boca Raton: CRC Press LLC, 1999
Helleseth, T. & Kumar, P.V. Pseudonoise Sequences Mobile Communications Handbook Ed. Suthan S. Suthersan Boca Raton: CRC Press LLC, 1999 c 1999byCRCPressLLC Pseudonoise Sequences Tor Helleseth University
More informationThere are no Barker arrays having more than two dimensions
There are no Barker arrays having more than two dimensions Jonathan Jedwab Matthew G. Parker 5 June 2006 (revised 7 December 2006) Abstract Davis, Jedwab and Smith recently proved that there are no 2-dimensional
More informationComplete characterization of generalized bent and 2 k -bent Boolean functions
Complete characterization of generalized bent and k -bent Boolean functions Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng 1 Abstract In this paper we investigate properties of generalized bent Boolean
More informationNew Families of Triple Error Correcting Codes with BCH Parameters
New Families of Triple Error Correcting Codes with BCH Parameters arxiv:0803.3553v1 [cs.it] 25 Mar 2008 Carl Bracken School of Mathematical Sciences University College Dublin Ireland May 30, 2018 Abstract
More informationarxiv: v1 [cs.it] 31 May 2013
Noname manuscript No. (will be inserted by the editor) A Note on Cyclic Codes from APN Functions Chunming Tang Yanfeng Qi Maozhi Xu arxiv:1305.7294v1 [cs.it] 31 May 2013 Received: date / Accepted: date
More informationGENERATION OF PRIMITIVE BINARY POLYNOMIALS
INTERNATIONAL CONFERENCE ON ALGEBRA, LOGIC AND DISCRETE MATHEMATICS April 14-16, 1995 Niš GENERATION OF PRIMITIVE BINARY POLYNOMIALS Miodrag Živković Let F q denote the finite field of order q = p n, where
More informationDe Bruijn Sequences from Nonlinear Feedback Shift Registers
De Bruijn Sequences from Nonlinear Feedback Shift Registers Ming Li and Dongdai Lin State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing
More informationDivision of Trinomials by Pentanomials and Orthogonal Arrays
Division of Trinomials by Pentanomials and Orthogonal Arrays School of Mathematics and Statistics Carleton University daniel@math.carleton.ca Joint work with M. Dewar, L. Moura, B. Stevens and Q. Wang
More informationDesign of Signal Sets with Low Intraference for CDMA Applications in Networking Environment
Design of Signal Sets with Low Intraference for CDMA Applications in Networking Environment Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1,
More informationNew Single Asymmetric Error-Correcting Codes
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO. 5, SEPTEMBER 1997 1619 New Single Asymmetric Error-Correcting Codes Sulaiman Al-Bassam, Ramachandran Venkatesan, Senior Member, IEEE, and Sultan Al-Muhammadi
More informationTransform Domain Analysis of DES. Guang Gong and Solomon W. Golomb. University of Southern California. Tels and
Transform Domain Analysis of DES Guang Gong and Solomon W. Golomb Communication Sciences Institute University of Southern California Electrical Engineering-Systems, EEB # 500 Los Angeles, California 90089-2565
More informationLow Correlation Sequences for CDMA
Indian Institute of Science, Bangalore International Networking and Communications Conference Lahore University of Management Sciences Acknowledgement Prof. Zartash Afzal Uzmi, Lahore University of Management
More informationCOMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125
COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125 ROBERT S. COULTER AND PAMELA KOSICK Abstract. This note summarises a recent search for commutative semifields of order 243 and 3125. For each of these two orders,
More informationOn the existence of cyclic difference sets with small parameters
Fields Institute Communications Volume 00, 0000 On the existence of cyclic difference sets with small parameters Leonard D. Baumert 325 Acero Place Arroyo Grande, CA 93420 Daniel M. Gordon IDA Center for
More informationBinary GH Sequences for Multiparty Communication. Krishnamurthy Kirthi
Binary GH Sequences for Multiparty Communication Krishnamurthy Kirthi Abstract This paper investigates cross correlation properties of sequences derived from GH sequences modulo p, where p is a prime number
More informationDiscrete Applied Mathematics 105 (2000) On (n; k)-sequences. Received 7 April 1999; revised 21 December 1999; accepted 22 December 1999
Discrete Applied Mathematics 105 (2000) 183 192 On (n; k)-sequences Hong-Yeop Song a;, June Bok Lee b a Department of Electrical and Computer Engineering, Yonsei University, Seoul 120-749, South Korea
More informationarxiv: v1 [cs.it] 5 Aug 2008
Generalized Cross-correlation Properties of Chu Sequences arxiv:0808.0544v1 [cs.it] 5 Aug 2008 Jae Won Kang, Younghoon Whang, Hyo Yol Park and Kwang Soon Kim, Senior Member, IEEE Department of Electrical
More informationThe Array Structure of Modified Jacobi Sequences
Journal of Mathematics Research; Vol. 6, No. 1; 2014 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education The Array Structure of Modified Jacobi Sequences Shenghua Li 1,
More informationSome Results on the Arithmetic Correlation of Sequences
Some Results on the Arithmetic Correlation of Sequences Mark Goresky Andrew Klapper Abstract In this paper we study various properties of arithmetic correlations of sequences. Arithmetic correlations are
More informationA construction of optimal sets of FH sequences
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 50 2011, Pages 37 44 A construction of optimal sets of FH sequences Bin Wen Department of Mathematics Changshu Institute of Technology Changshu 215500, Jiangsu
More informationResearch Article Z-Complementary Sets Based on Sequences with Periodic and Aperiodic Zero Correlation Zone
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 29, Article ID 4826, 9 pages doi:/29/4826 Research Article Z-Complementary Sets Based on Sequences with Periodic
More informationCome on Down! An Invitation to Barker Polynomials
Come on Down! An Invitation to Barker Polynomials 5.0 4.5 4.0 3.5 I c e r m 3.0 2.5 0.0 0.1 0.2 0.3 0.4 0.5 Michael Mossinghoff Davidson College Introduction to Topics Summer@ICERM 2014 Brown University
More informationM 2 + s 2. Note that the required matrix A when M 2 + s 2 was also obtained earlier by Gordon [2]. (2.2) x -alxn-l-aex n-2 an
SIAM J. ALG. DISC. METH. Vol. 1, No. 1, March 1980 1980 Society for. Industrial and Applied Mathematics 0196-52/80/0101-0014 $01.00/0 ON CONSTRUCTION OF MATRICES WITH DISTINCT SUBMATRICES* SHARAD V. KANETKAR"
More informationwith Good Cross Correlation for Communications and Cryptography
m-sequences with Good Cross Correlation for Communications and Cryptography Tor Helleseth and Alexander Kholosha 9th Central European Conference on Cryptography: Trebíc, June 26, 2009 1/25 Outline m-sequences
More informationSNR i = 2E b 6N 3. Where
Correlation Properties Of Binary Sequences Generated By The Logistic Map-Application To DS-CDMA *ZOUHAIR BEN JEMAA, **SAFYA BELGHITH *EPFL DSC LANOS ELE 5, 05 LAUSANNE **LABORATOIRE SYSCOM ENIT, 002 TUNIS
More informationPeriodicity and Distribution Properties of Combined FCSR Sequences
Periodicity and Distribution Properties of Combined FCSR Sequences Mark Goresky 1, and Andrew Klapper, 1 Institute for Advanced Study, Princeton NJ www.math.ias.edu/~goresky Dept. of Computer Science,
More informationSequences and Linear Codes from Highly Nonlinear Functions
Sequences and Linear Codes from Highly Nonlinear Functions Chunlei Li Dissertation for the degree of philosophiae doctor(phd) at the University of Bergen 2014 Dissertation date: June 16th A C K N O W
More informationBinary construction of quantum codes of minimum distances five and six
Discrete Mathematics 308 2008) 1603 1611 www.elsevier.com/locate/disc Binary construction of quantum codes of minimum distances five and six Ruihu Li a, ueliang Li b a Department of Applied Mathematics
More informationHyperbent functions, Kloosterman sums and Dickson polynomials
Hyperbent functions, Kloosterman sums and Dickson polynomials Pascale Charpin Guang Gong INRIA, B.P. 105, 78153 Le Chesnay Cedex, France, Pascale.Charpin@inria.fr Department of Electrical and Computer
More informationF ple-access communication system, it is desirable to
IEEE TANSACTIONS ON INFOMATION THEOY, VOL. 35, NO. 2, MACH 1989 A New Family of Binary Pseudorandom Sequences Having Optimal Periodic Correlation Properties and Large Linear Span 371 Abstract-A collection
More informationNew Polyphase Complementary Sequence Sets for Wireless Communication Systems
Vol.7 o. (04) pp.47-56 http://dx.doi.org/0.457/ijhit.04.7.. ew Polyphase Complementary Sequence Sets for Wireless Communication Systems Fanxin Zeng Xiaoping Zeng Zhenyu Zhang and Guixin Xuan Chongqing
More informationLinear Cellular Automata as Discrete Models for Generating Cryptographic Sequences
Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences A Fúster-Sabater P Caballero-Gil 2 Institute of Applied Physics, CSIC Serrano 44, 286 Madrid, Spain Email: amparo@ieccsices
More informationFourier Spectra of Binomial APN Functions
Fourier Spectra of Binomial APN Functions arxiv:0803.3781v1 [cs.dm] 26 Mar 2008 Carl Bracken Eimear Byrne Nadya Markin Gary McGuire March 26, 2008 Abstract In this paper we compute the Fourier spectra
More informationStream Ciphers and Number Theory
Stream Ciphers and Number Theory Revised Edition Thomas W. Cusick The State University of New York at Buffalo, NY, U.S.A. Cunsheng Ding The Hong Kong University of Science and Technology China Ari Renvall
More informationPencils of Quadratic Forms over Finite Fields
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 2004 Pencils of Quadratic Forms over Finite Fields Robert W. Fitzgerald Southern Illinois University Carbondale,
More informationExtended Binary Linear Codes from Legendre Sequences
Extended Binary Linear Codes from Legendre Sequences T. Aaron Gulliver and Matthew G. Parker Abstract A construction based on Legendre sequences is presented for a doubly-extended binary linear code of
More informationA New Characterization of Semi-bent and Bent Functions on Finite Fields
A New Characterization of Semi-bent and Bent Functions on Finite Fields Khoongming Khoo DSO National Laboratories 20 Science Park Dr S118230, Singapore email: kkhoongm@dso.org.sg Guang Gong Department
More informationOn the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers
On the distinctness of binary sequences derived from primitive sequences modulo square-free odd integers Qun-iong Zheng, Wen-Feng Qi and Tian Tian y August 2, 20 Abstract Let M be a square-free odd integer
More informationA New Class of Bent Negabent Boolean Functions
A New Class of Bent Negabent Boolean Functions Sugata Gangopadhyay and Ankita Chaturvedi Department of Mathematics, Indian Institute of Technology Roorkee Roorkee 247667 INDIA, {gsugata, ankitac17}@gmail.com
More informationRON M. ROTH * GADIEL SEROUSSI **
ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS RON M. ROTH * AND GADIEL SEROUSSI ** ABSTRACT It is shown that every q-ary primitive BCH code of designed distance δ and sufficiently
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More informationDivisibility of Trinomials by Irreducible Polynomials over F 2
Divisibility of Trinomials by Irreducible Polynomials over F 2 Ryul Kim Faculty of Mathematics and Mechanics Kim Il Sung University, Pyongyang, D.P.R.Korea Wolfram Koepf Department of Mathematics University
More informationOn the k-error linear complexity for p n -periodic binary sequences via hypercube theory
1 On the k-error linear complexity for p n -periodic binary sequences via hypercube theory Jianqin Zhou Department of Computing, Curtin University, Perth, WA 6102 Australia Computer Science School, Anhui
More informationA New Algorithm to Compute Terms in Special Types of Characteristic Sequences
A New Algorithm to Compute Terms in Special Types of Characteristic Sequences Kenneth J. Giuliani 1 and Guang Gong 2 1 Dept. of Mathematical and Computational Sciences University of Toronto at Mississauga
More informationBinary De Bruijn sequences for DS-CDMA systems: analysis and results
RESEARCH Open Access Binary sequences for DS-CDMA systems: analysis and results Susanna Spinsante *, Stefano Andrenacci and Ennio Gambi Abstract Code division multiple access (CDMA) using direct sequence
More informationPAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
359 PAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes Ching-Lung CHR a),szu-linsu, Members, and Shao-Wei WU, Nonmember SUMMARY A low-complexity step-by-step decoding algorithm
More informationNew Construction of Single Cycle T-function Families
New Construction of Single Cycle T-function Families Shiyi ZHANG 1, Yongjuan WANG, Guangpu GAO Luoyang Foreign Language University, Luoyang, Henan Province, China Abstract The single cycle T-function is
More informationClosed Form Designs of Complex Orthogonal. Space-Time Block Codes of Rates (k + 1)=(2k) for
Closed Form Designs of Complex Orthogonal Space-Time Block Codes of Rates (k + 1)(k) for k 1 or k Transmit Antennas Kejie Lu, Shengli Fu, Xiang-Gen Xia Abstract In this correspondence, we present a systematic
More informationMultilevel Distance Labelings for Paths and Cycles
Multilevel Distance Labelings for Paths and Cycles Daphne Der-Fen Liu Department of Mathematics California State University, Los Angeles Los Angeles, CA 90032, USA Email: dliu@calstatela.edu Xuding Zhu
More informationDickson Polynomials that are Involutions
Dickson Polynomials that are Involutions Pascale Charpin Sihem Mesnager Sumanta Sarkar May 6, 2015 Abstract Dickson polynomials which are permutations are interesting combinatorial objects and well studied.
More information1-Resilient Boolean Function with Optimal Algebraic Immunity
1-Resilient Boolean Function with Optimal Algebraic Immunity Qingfang Jin Zhuojun Liu Baofeng Wu Key Laboratory of Mathematics Mechanization Institute of Systems Science, AMSS Beijing 100190, China qfjin@amss.ac.cn
More informationQUADRATIC RESIDUE CODES OVER Z 9
J. Korean Math. Soc. 46 (009), No. 1, pp. 13 30 QUADRATIC RESIDUE CODES OVER Z 9 Bijan Taeri Abstract. A subset of n tuples of elements of Z 9 is said to be a code over Z 9 if it is a Z 9 -module. In this
More informationThe Dimension and Minimum Distance of Two Classes of Primitive BCH Codes
1 The Dimension and Minimum Distance of Two Classes of Primitive BCH Codes Cunsheng Ding, Cuiling Fan, Zhengchun Zhou Abstract arxiv:1603.07007v1 [cs.it] Mar 016 Reed-Solomon codes, a type of BCH codes,
More informationof how many there are
Windmill Generators A generalization and an observation of how many there are B.J.M. Smeets') W.G. Chambers') '1 Dept of Inform. Theory University of Lund Box 118, S-222 46, Lund, Sweden 2, Dept of Eletronic
More information