On the p-ranks and Characteristic Polynomials of Cyclic Difference Sets

Size: px
Start display at page:

Download "On the p-ranks and Characteristic Polynomials of Cyclic Difference Sets"

Transcription

1 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 School of Electrical Engineering and Computer Science, Seoul National University, Seoul , Korea DONG-JOON SHIN Division of Electrical and Computer Engineering, Hanyang University, Seoul , Korea TOR HELLESETH Department of Informatics, University of Bergen, N-5020 Bergen, Norway Communicated by: D. Jungnickel Received February 15, 2001; Revised September 24, 2002; Accepted October 9, 2002 Abstract. In this paper, the p-ranks and characteristic polynomials of cyclic difference sets are derived by expanding the trace expressions of their characteristic sequences. Using this method, it is shown that the 3-ranks and characteristic polynomials of the Helleseth Kumar Martinsen (HKM) difference set and the Lin difference set can be easily obtained. Also, the p-rank of a Singer difference set is reviewed and the characteristic polynomial is calculated using our approach. Keywords: cyclic difference set, characteristic polynomial, p-rank AMS Classification: 05B10, 11B50 1. Introduction It is well-known that a cyclic difference set with Singer parameters ð2 n 1; 2 n 1 1; 2 n 2 1Þ [7,17] is equivalent to a binary sequences of period 2 n 1 with ideal autocorrelation [4,5,14 16]. Recently, nonbinary sequences with ideal autocorrelation have been investigated. Helleseth et al. [8] found ternary sequences with ideal autocorrelation that turned out to be cyclic difference sets with Singer parameters ðð3 3k 1Þ=ð3 1Þ; ð3 3k 1 1Þ=ð3 1Þ; ð3 3k 2 1Þ=ð3 1ÞÞ [9,13]. Lin [12] found a new family of ternary sequences of period 3 n 1 and conjectured that it has the ideal autocorrelation property, when n ¼ 2m þ 1. Under this assumption, a cyclic difference set (Lin difference set) with Singer parameters ðð3 n 1Þ= ð3 1Þ; ð3 n 1 1Þ=ð3 1Þ; ð3 n 2 1Þ=ð3 1ÞÞ can be obtained [9,13]. In this paper, the p-ranks and characteristic polynomials of cyclic difference sets are derived by expanding the trace expressions of their characteristic sequences. Using this method, it is shown that the 3-ranks and characteristic polynomials of the Helleseth Kumar Martinsen (HKM) difference set and the Lin difference set can be

2 24 NO ET AL. easily obtained. Also, the p-rank of a Singer difference set is reviewed and its characteristic polynomial is calculated using our approach. 2. Preliminaries Let D be a ðv; k; lþ difference set [3,10] defined as a set of k distinct residues modulo v expressed by D ¼fc 1 ; c 2 ; c 3 ;...; c k g: ð1þ Then each non-zero residue occurs exactly l times among the kðk 1Þ differences c i c j ; i 6¼ j and thus it satisfies lðv 1Þ ¼kðk 1Þ: The complementary difference set of D is a ðv; v k; v 2k þ lþ difference set defined as D ¼ Z v nd; where Z v is the ring of integers modulo v. Then for integers a and b, a set ad þ b is defined as ad þ b ¼fa? c 1 þ b; a? c 2 þ b; a? c 3 þ b;...; a? c k þ bg; where a? c i þ b is taken modulo v. For integers a and b, two ðv; k; lþ difference sets D 1 and D 2 are said to be inequivalent if D 1 is distinct from ad 2 þ b for any integer a and b, 1 a v 1, 0 b v 1, where a is relatively prime to v. The characteristic sequence of a cyclic difference set D in (1) is defined as the binary sequence 1; if t [ D; sðtþ ¼ 0; if t 6[ D; and the characteristic sequence of its complementary difference set D is defined as 1; if t [ D; s c ðtþ ¼ 0; if t 6[ D; ¼ 1 sðtþ: The characteristic polynomial of a cyclic difference set D is defined as a leastdegree linear recursion equation over F p of the characteristic sequence sðtþ of D. The p-rank [6] of a cyclic difference set D is defined as the degree of characteristic polynomial of the cyclic difference set D. In order to prove the inequivalence of two cyclic difference sets, the p-rank is often used. However, it is very difficult to find the p-ranks of cyclic difference sets.

3 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 25 Let n ¼ e? m > 1 for some positive integers e and m. Then the trace function tr n m ð? Þ is the mapping from the finite field F p n to its subfield F pm defined by Lidl and Niederreiter [11] tr n mðxþ ¼e 1 x? pm i ; where x is an element in F p n. It is easy to check that the trace function satisfies the following: i. tr n m ðax þ byþ ¼atrn m ðxþþbtrn m ð yþ, for all a; b [ F p m; x; y [ F p n. ii. tr n m ðxpm Þ¼tr n m ðxþ, for all x [ F p n. iii. tr n 1 ðxþ ¼trm 1 ðtrn m ðxþþ, for all x [ F p n. Using the trace function, a p-ary m-sequence mðtþ of period p n 1 can be expressed as mðtþ ¼tr n 1 ðat Þ; ð2þ where p is a prime and a is a primitive element of F p n. 3. p-ranks and Characteristic Polynomials of Cyclic Difference Sets As will be given in the following theorem and lemma, the characteristic sequences of a cyclic difference set and its complementary difference set can be expressed by using the trace expressions and the p-rank can be calculated by counting the number of terms in the trace expression. Moreover, by finding the minimal polynomials corresponding to this trace expression, we can easily obtain the characteristic polynomial. This method will be used to find the 3-ranks and characteristic polynomials of the HKM and the Lin difference sets in the following sections. Let f ðtþ be a function from the finite field F p n to its subfield F p m. Then we have the following relation: ½ f ðtþš pm 1 ¼ 1; if f ðtþ 6¼ 0; 0; if f ðtþ ¼0: Therefore, using this relation, the characteristic sequence of a cyclic difference set is given in the following theorem. THEOREM 1. Assume that a ðv; k; lþ cyclic difference set D and its complementary difference set D are defined as D ¼ft j f ðtþ ¼0; 0 t < vg; D ¼ft j f ðtþ 6¼ 0; 0 t < vg; ð3þ ð4þ

4 26 NO ET AL. where f(t) is given as a summation of the trace function from the finite field F p n to its subfield F p m, that is f ðtþ ¼ b a? tr n m ðaat Þ; a [ I for some index set I; b a [ F p m and a primitive elements a in F p n. Then the characteristic sequences of the cyclic difference set D and its complementary difference set D can be expressed as and sðtþ ¼1 s c ðtþ; 0 t < v; s c ðtþ ¼½f ðtþš pm 1 ; 0 t < v: ð5þ In order to find the p-rank of the cyclic difference set D, we have to expand the trace expression in (5) as given in the following lemma. LEMMA 2. Let D and Dbeaðv; k; lþ cyclic difference set and its complementary difference set defined by (3) and (4), respectively. Suppose that the trace expression of the characteristic sequence s c ðtþ of D can be expanded as s c ðtþ ¼½fðtÞŠ pm 1 " # p m 1 ¼ a [ I b a? tr n m ðaat Þ ¼ c j a jt ; j [ J ð6þ where J is an index set and c j [ Fp. Then the p-rank of the complementary difference set D is given as jjj, which means that the degree of the characteristic polynomial of Dis jjj. Further, the p-rank of the cyclic difference set D is given as jjjþ1, if jdj ¼v kis divisible by p. Proof. Let gðxþ and g c ðxþ be the characteristic polynomials over F p of a cyclic difference set D and its complementary difference set D, respectively. Since there is the relationship between s c ðtþ and sðtþ given as sðtþ ¼1 s c ðtþ; their characteristic polynomials are related as aðxþ gðxþ ¼ 1 bðxþ x 1 g c ðxþ ¼ g cðxþ ðx 1ÞbðxÞ ; ðx 1Þ? g c ðxþ

5 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 27 where the polynomials aðxþ and bðxþ are relatively prime to gðxþ and g c ðxþ, respectively. If jdj ¼v k is divisible by p, then the number of 1 s in one period of the characteristic sequence of the cyclic difference set D is a multiple of p. Therefore, the polynomial expression of the characteristic sequence possesses the factor x 1 and this cancels the factor x 1 in the characteristic polynomial, which means that the characteristic polynomial g c ðxþ is not divisible by x 1. Therefore, the polynomial g c ðxþ ðx 1ÞbðxÞ is relatively prime to ðx 1Þg c ðxþ and we obtain gðxþ ¼ðx 1Þg c ðxþ; ð7þ if jdj ¼v k is divisible by p. Therefore, the p-rank of the cyclic difference set D is jjjþ1, if jdj ¼v k is divisible by p. & If (6) is expressed as a summation of trace functions as ½ f ðtþš pm 1 ¼ k j n;k>1 c ak? tr k 1 ðaakt k Þ; a k [ J k where c ak [ Fp ; J k s are index sets and a k is a primitive element of F p k, the characteristic polynomials of the cyclic difference set D and its complementary difference set D can be expressed as in the following theorem. THEOREM 3. If the characteristic sequence of a cyclic difference set D is expressed as s c ðtþ ¼ c ak? tr k 1 ðaakt k Þ; a k [ J k kjn;k>1 where c ak [ Fp and if jdj ¼v l is divisible by p, then the characteristic polynomials gðxþ and g c ðxþ of the cyclic difference set D and its complementary difference set D are given as follows: gðxþ ¼ðx 1Þ? g c ðxþ; g c ðxþ ¼ Y Y M ak ðxþ; a k [ J k kjn;k>1 ð8þ ð9þ where M ak ðxþ is the minimal polynomial of the element a a k k [ F p k. Note that the p-rank of D is one bigger than that of D. For the cyclic difference set with Singer parameters ððq n 1Þ=ðq 1Þ; ðq n 1 1Þ=ðq 1Þ; ðq n 2 1Þ=ðq 1ÞÞ, where q ¼ p m ; v k ¼ q n 1 ¼ p mðn 1Þ is divisible by p. Therefore, the above theorem can be applied to find the p-ranks and characteristic polynomials of the cyclic difference set with Singer parameters and its complementary difference set.

6 28 NO ET AL Ranks and Characteristic Polynomials of HKM Difference Sets Recently, Helleseth et al. [8] introduced a new ternary sequence ð p ¼ 3Þ with ideal autocorrelation. It turned out to be a cyclic difference set (HKM difference set) with Singer parameters [9,13] and the p-ranks of the HKM difference set and its complementary difference set are derived in the following theorem. THEOREM 4. The HKM difference set with parameters ðð3 n 1Þ=ð3 1Þ; ð3 n 1 1Þ= ð3 1Þ; ð3 n 2 1Þ=ð3 1ÞÞ is defined as D ¼ tjtr n 1 ðat Þþtr n 1 ðadt Þ¼0; 0 t < 3n 1 ; ð10þ 3 1 where n ¼ 3k > 3, d ¼ 3 2k 3 k þ 1, and a is a primitive element of F 3 n. Then the 3-ranks of the HKM difference set D and its complementary difference set D are given as 2n 2 2n þ 1 and 2n 2 2n, respectively. Proof. Let x ¼ a t. Then we can expand the square of the trace function as tr n 2 1 ðat Þ ¼ tr n 2 1 ðxþ ¼ tr n 1 ðxþ? trn 1 ðxþ ¼ tr n 1 ðx? trn 1 ðxþþ ¼ tr n 1 ðx? ðx þ x3 þ x 32 þþx 3n 1 ÞÞ ¼ n 1 tr n 1 ðx1þ3i Þ ¼ tr n 1 ðx1þ1 Þþ n 1 tr n 1 Þ ðx1þ3i 8 >< tr n 1 ðx1þ1 Þþ2? ¼ >: ðn 1Þ=2 P tr n 1 ðx1þ3i Þ; tr n 1 ðx1þ1 Þþ2? tr n=2 1 ðx 1þ3ðn=2Þ Þþ2? ðn=2þ 1 P for n ¼ odd; tr n 1 ðx1þ3i Þ; for n ¼ even: The characteristic sequence of the cyclic difference set D is given as tr n 2: 1 ðxþþtrn 1 ðxd Þ ð11þ Using the expansion of the square of trace function, we can also expand (11) as follows.

7 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 29 (i) n ¼ 2m þ 1 (odd case) tr n 2 1 ðxþþtrn 1 ðxd Þ ¼ tr n 2 1 ðxþ þ tr n 1 ðx d 2 Þ þ 2? tr n 1 ðxþ? tr n 1 ðxd Þ Since we have Using we obtain Therefore, ¼ tr n 1 ðx1þ1 Þþ2? þ 2? ðn 1Þ=2 ¼ tr n 1 ðx1þ1 Þþ2? þ 2? ðn 1Þ=2 ðn 1Þ=2 tr n 1 ðx1þ3i Þþtr n 1 ðxð1þ1þd Þ tr n 1 ðxð1þ3i Þd Þþ2? tr n 1 ðxd? tr n 1 ðxþþ ðn 1Þ=2 tr n 1 ðx1þ3i Þþtr n 1 ðxð1þ1þd Þ tr n 1 Þd ðxð1þ3i Þþ2? n 1 tr n 1 ðxdþ3i Þ: d? ð3 k þ 1Þ ¼3 3k þ 1 ¼ 3 3k 1 þ 2 : 2 modð3 3k 1Þ; tr n 1 ðxð1þ3k Þd Þ¼tr n 1 ðx1þ1 Þ: d þ 3 k ¼ 3 2k þ 1; tr n 1 ðxdþ3k Þ¼tr n 1 ðx32k þ1 Þ¼tr n 1 ðx3k þ1 Þ: tr n 2 m 1 ðxþþtrn 1 ðxd Þ ¼ 2? þ 2? ; i6¼k n 1 ; i6¼k tr n 1 ðx1þ3i Þþtr n 1 ðxð1þ1þd Þþ2? tr n 1 ðxdþ3i Þþtr n 1 ðx1þ3k Þ: m ;i6¼k tr n 1 ðxð1þ3i Þd Þ It is easy to prove that for n > 3, all exponents belong to different cyclotomic coset of size n. Therefore, the 3-rank of D is ðm 1Þn þ n þðm 1Þn þðn 1Þn þ n ¼ 2? nðn 1Þ; and the 3-rank of the HKM difference set D is therefore 2n 2 2n þ 1. ð12þ

8 30 NO ET AL. (ii) n ¼ 2m (even case): Similar to the odd case, we expand tr n 2 1 ðxþþtrn 1 ðxd Þ ¼ tr n 2 1 ðxþ þ tr n 1 ðx d 2 Þ þ 2? tr n 1 ðxþ? tr n 1 ðxd Þ ¼ tr n 1 ðx1þ1 Þþ2? tr m 1 ðx1þ3m Þþ2? m 1 tr n 1 ðx1þ3i Þ Using we have and since we get þ tr n 1 ðxð1þ1þd Þþ2? tr m 1 Þd ðxð1þ3m Þþ2? m 1 tr n 1 Þd ðxð1þ3i Þ þ 2? n 1 tr n 1 ðxdþ3i Þ: ð1 þ 3 k Þ? d ¼ 2 mod ð3 3k 1Þ; tr n 1 ðxð1þ3k Þd Þ¼tr n 1 ðx2 Þ; d þ 3 k ¼ 3 2k þ 1; tr n 1 ðxdþ3k Þ¼tr n 1 ðx1þ32k Þ¼tr n 1 ðx1þ3k Þ: Adding up the same trace terms, we have tr n 2 1 ðxþþtrn 1 ðxd Þ ¼ 2? tr m 1 ðx ð1þ3mþ Þþ2? m 1 ;i6¼k tr n 1 ðx1þ3i Þ þ tr n 1 ðxð1þ1þd Þþ2? tr m 1 ðxð1þ3m Þd Þþ2? þ 2? n 1 ;i6¼k tr n 1 ðxdþ3i Þþtr n 1 ðx1þ3k Þ: m 1 ;i6¼k tr n 1 ðxdð1þ3iþ Þ It can be shown that all exponents belong to different cosets of size n or m. Therefore the 3-rank of the difference set D is m þðm 2Þn þ n þ m þðm 2Þn þðn 1Þn þ n ¼ 2? nðn 1Þ; and from (8), the 3-rank of the HKM difference set D is therefore 2n 2 2n þ 1. & ð13þ

9 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 31 Note: Using (12), for n ¼ 3, it can be easily derived that the 3-ranks of the HKM difference set D and its complementary difference set D are 7 and 6, respectively. From (12) and (13), we can derive the characteristic polynomials of the HKM difference set and its complementary difference set as in the following theorem. THEOREM 5. Let D be the HKM difference set with parameters ðð3 n 1Þ=ð3 1Þ; ð3 n 1 1Þ=ð3 1Þ; ð3 n 2 1Þ=ð3 1ÞÞ defined in (10). Then the characteristic polynomials of the HKM difference set D and its complementary difference set D are: For n ¼ 2m þ 1: gðxþ ¼ðx 1Þg c ðxþ; g c ðxþ ¼M 2d ðxþm 1þ3 kðxþ Ym 6 Ym ;i6¼k ;i6¼k M ð1þ3i ÞdðxÞ Yn 1 M 1þ3 iðxþ ;i6¼k M dþ3 iðxþ: For n ¼ 2m: gðxþ ¼ðx 1Þg c ðxþ; g c ðxþ ¼M 2d ðxþm 1þ3 mðxþm ð1þ3m ÞdðxÞM 1þ3 kðxþ Ym 1 6 Ym 1 ;i6¼k M ð1þ3 i ÞdðxÞ Y n 1 ; i6¼k M dþ3 iðxþ: ;i6¼k M 1þ3 iðxþ Note: For n ¼ 3, the characteristic polynomials of the HKM difference set D and its complementary difference set D are derived as ðx 1ÞM 4 ðxþm 8 ðxþ and M 4 ðxþm 8 ðxþ, respectively Ranks and Characteristic Polynomials of Lin Difference Sets Lin [12] has conjectured that the family of ternary sequences cðtþ ¼tr n 1 ðat Þþtr n 1 ðadt Þ has the ideal autocorrelation property, where n ¼ 2m þ 1andd ¼ 2? 3 m þ 1. If this is true, then it gives a cyclic difference set (Lin difference set) with Singer parameters [9,13]. Under this assumption, we can derive the 3-ranks and characteristic polynomials of the Lin difference set and its complementary difference set as in the following theorems.

10 32 NO ET AL. THEOREM 6. The Lin difference set with parameters ðð3 n 1Þ=ð3 1Þ; ð3 n 1 1Þ= ð3 1Þ; ð3 n 2 1Þ=ð3 1ÞÞ is defined as D ¼ tjtr n 1 ðat Þþtr n 1 ðadt Þ¼0; 0 t < 3n 1 ; ð14þ 3 1 where n ¼ 2m þ 1 > 3, d ¼ 2? 3 m þ 1 and a is a primitive element of F 3 n. Then the 3-ranks of the Lin difference set D and its complementary difference set D are given as 2n 2 2n þ 1 and 2n 2 2n, respectively. Proof. Let x ¼ a t. Then the characteristic sequence of the difference set D is tr n 2: 1 ðxþþtrn 1 ðxd Þ ð15þ Using the expansion of the square of the trace function in the proof of the previous theorem, we can expand (15) as follows. tr n 1 ðat Þþtr n 2 1 ðadt Þ ¼½tr n 1 ðxþš 2 þ tr n 2 1 ðxd Þ þ 2? tr n 1 ðxþ? tr n 1 ðxd Þ ¼ tr n 1 ðx1þ1 Þþ2? m tr n 1 Þþtr n ðx1þ3i 1 ðxð1þ1þd Þ Since we have and using we obtain þ 2? m d þ 3 m ¼ 2? 3 m þ 1 þ 3 m ¼ 3 mþ1 þ 1; tr n 1 ðxdþ3m Þ¼tr n 1 ðx1þ3m Þ; d þ 3 n 1 ¼ 3 n 1 þ 2? 3 m þ 1; tr n 1 Þd Þþ2? n 1 tr n ðxð1þ3i 1 Þ: ðxdþ3i tr n 1 ðxdþ3n 1 Þ¼tr n? 1 ðx2 3mþ1þ3þ1 Þ ¼ tr n? 1 ðx2 ð3mþ1þ2þ Þ ¼ tr n? 1 ðx2 ð1þ2? 3mÞ Þ ¼ tr n 1 ðxð1þ1þd Þ:

11 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 33 Adding up the same trace terms, we have tr n 1 ðxþþtrn 1 ðxd Þ 2 ¼ tr n 1 ðx 1þ1 Þþ2? m 1 tr n 1 ðx1þ3i Þþtr n 1 ðx1þ3m Þ þ 2? m tr n 1 ðxð1þ3i Þd Þþ2? n 2 ;i6¼m tr n 1 ðx3i þd Þ: ð16þ It can be shown that for n > 3, all exponents belong to different cosets of size n. Therefore, the 3-rank of the difference set D is n þðm 1Þn þ n þ m? n þ nðn 2Þ ¼2nðn 1Þ; and from (8), the 3-rank of the Lin difference set D is 2n 2 2n þ 1. & Note: For n ¼ 3, the Lin difference set is identical to the HKM difference set. Therefore, the 3-ranks and characteristic polynomials of the Lin difference set D and its complementary difference set D are the same as those of the HKM difference set and its complementary difference set. From (16), we can derive the characteristic polynomials of the Lin difference set and its complementary difference set as in the following theorem. THEOREM 7. Let D be the Lin difference set with parameters ðð3 n 1Þ=ð3 1Þ; ð3 n 1 1Þ=ð3 1Þ; ð3 n 2 1Þ=ð3 1ÞÞ defined in (14). Then the characteristic polynomials of the Lin difference set D and its complementary difference set D are given as: gðxþ ¼ðx 1Þg c ðxþ; g c ðxþ ¼M 2 ðxþm 1þ3 mðxþ Ym 1 M 1þ3 iðxþ 6 Ym M ð1þ3i ÞdðxÞ Y n 2 ;i6¼m M dþ3 iðxþ: 6. Characteristic Polynomials of Singer Difference Sets The p-rank of a Singer difference set is well-known [1,2,6,18]. In this section, the p-ranks of a Singer difference set and its complementary difference set are reviewed as given in the following theorem. Also the characteristic polynomials are obtained by using our approach.

12 34 NO ET AL. THEOREM 8 [1,2,6,18]. The Singer difference set with parameters ððq n 1Þ=ðq 1Þ; ðq n 1 1Þ=ðq 1Þ; ðq n 2 1Þ=ðq 1ÞÞ is defined as D ¼ tjtr ns s ðat Þ¼0; 0 t < qn 1 ; q 1 where q ¼ p s and a is a primitive element of F q n. Then the p-ranks of the Singer difference set D and its complementary difference set D are given as s p þ n 2 þ 1 and n 1 s p þ n 2 ; n 1 respectively. The sketchy proof of Theorem 8 is given here and it will be used to derive the characteristic polynomials in the following theorem. Let x ¼ a t. Then the characteristic sequence of the difference set D is given as tr ns s ðxþ p s 1. By using p s 1 ¼ðp 1Þp s 1 þðp 1Þp s 2 þþðp 1Þp þðp 1Þ, we get where s ðxþ h p s 1 ¼ ½tr ns s ðxþšp 1 tr ns ¼ ðl i;0 ;l i;1 ;...;l i;n 1 Þ [ I 0 i p s 1 þp s 2 þþpþ1 ðl i;0 ;l i;1 ;...;l i;n 1 Þ [ I s 1 Y s 1 p 1 l i;0 ; l i;1 ;...; l i;n 1 x cðlþ ; cðlþ ¼ n 1 j¼0 s 1 js p l i; j p i ; ( ) I i ¼ ðl i;0 ; l i;1 ;...; l i;n 1 Þj n 1 l i; j ¼ p 1; l i; j 0 ; 0 i s 1: j¼0 ð17þ First, it will be shown that all cðlþ s are distinct mod q n 1. Suppose cðlþ ¼cðl 0 Þ mod q n 1. The value of cðlþ is upper-bounded by q n 1, where the equality holds if and only if l i; j ¼ p 1 for all i; j. Since this equality cannot happen, cðlþ < q n 1 and the mod q n 1 can be ignored. By comparing the coefficients l i; j and l 0 i; j of piþjs in the expansion of cðlþ and cðl 0 Þ, it is easy to show that l i; j ¼ l 0 i; j and therefore, all cðlþ s are distinct for different l. There are p þ n 2 n 1 cases satisfying P n 1 l j;i ¼ p 1 and the corresponding coefficient values are in the form

13 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 35 Y s 1 p 1 6¼ 0 mod p: l i;0 ; l i;1 ;...; l i;n 1 Therefore, the p-ranks of Singer difference set and its complementary difference set are given as s p þ n 2 þ 1 and n 1 s p þ n 2 ; n 1 respectively. From (17), we can derive the characteristic polynomials of a Singer difference set and its complementary difference set as in the following theorem. THEOREM 9. The Singer difference set with parameters ððq n 1Þ=ðq 1Þ; ðq n 1 1Þ= ðq 1Þ; ðq n 2 1Þ=ðq 1ÞÞ is defined as D ¼ tjtr ns s ðat Þ¼0; 0 t < qn 1 ; q 1 where q ¼ p s and a is a primitive element of F q n. Then the characteristic polynomials of Singer difference set D and its complementary difference set D are given as: gðxþ ¼ðx 1Þg c ðxþ; g c ðxþ ¼ Y M cðlþ ðxþ; cðlþ [ I where P I is a set of all coset leaders of the cosets including the elements s 1 P n 1 j¼0 l i; jp iþjs satisfying P n 1 j¼0 l i; j ¼ p 1; 0 i < s. Proof. From the proof of the previous theorem, we get cðlþ ¼p 0 ðl 0;0 þ l 1;0 p 1 þþl s 1;0 p s 1 Þ þ p s ðl 0;1 þ l 1;1 p 1 þþl s 1;1 p s 1 Þ.. þ p ðn 1Þs ðl 0;n 1 þ l 1;n 1 p 1 þþl s 1;n 1 p s 1 Þ; where P n 1 l j;i ¼ p 1 for all j. It is easy to show that cðlþ? p also appears as one of the valid cðl Þ s and has the same coefficient value as that of cðl Þ case. Hence, the theorem follows. & EAMPLE 10. Consider a Singer difference set with parameters ðð3 6 1Þ=ð3 2 1Þ; ð3 4 1Þ=ð3 2 1Þ; ð3 2 1Þ=ð3 2 1ÞÞ ¼ ð91; 10; 1Þ which is defined by D ¼ tjtr 6 2 ðat Þ¼0; 0 t < ¼ 91 ;

14 36 NO ET AL. where p ¼ 3 and a is a primitive element of F 3 6. Using the primitive polynomial x 6 þ 2x þ 2 ¼ 0, it can be shown that f0; 7; 19; 21; 57; 58; 63; 67; 80; 83g forms this Singer difference set. We can obtain seven cosets from cðlþ ¼l 0;0 þ l 1;0 3 þ l 0;1 3 2 þ l 1;1 3 3 þ l 0;2 3 4 þ l 1;2 3 5 where P 2 j¼0 l i; j ¼ 2; 0 i < 2. The valid values for ðl i;0 ; l i;1 ; l i;2 Þ; 0 i < 2, are among fð2; 0; 0Þ; ð0; 2; 0Þ; ð0; 0; 2Þ; ð1; 1; 0Þ; ð1; 0; 1Þ; ð0; 1; 1Þg. Therefore, the number of possible nonzero exponents cðl Þ for i ¼ 0; 1 is 666 ¼ 36 and it is the same value as 2 3 þ 3 2 : 3 1 We can select one value (coset leader) from each coset and the following values 0 1 l 0;0 l l 0;1 l 1;1 A; l 0;2 l 1;2 form seven such coset leaders < A : ; ; and the corresponding cðl Þ values are ð8; 16; 32; 40; 56; 64; 112Þ. Therefore, the characteristic polynomials of a Singer difference set with parameters ð91; 10; 1Þ and its complementary difference set are given as: where gðxþ ¼ðx 1Þg c ðxþ; g c ðxþ ¼M 8 ðxþm 16 ðxþm 32 ðxþm 40 ðxþm 56 ðxþm 64 ðxþm 112 ðxþ; M 8 ðxþ ¼x 6 þ x 4 þ x 3 þ 1; M 16 ðxþ ¼x 6 þ 2x 5 þ x 4 þ x 3 þ 2x 2 þ 1; M 32 ðxþ ¼x 6 þ x 5 þ x 4 þ 2x 3 þ x þ 1; M 40 ðxþ ¼x 6 þ x 5 þ 2x 4 þ 2x 3 þ 1; M 56 ðxþ ¼x 3 þ 2x 2 þ 2x þ 2; M 64 ðxþ ¼x 6 þ x 5 þ 2x 3 þ x 2 þ 2x þ 1; M 112 ðxþ ¼x 3 þ 2x þ 2:

15 ON THE p-ranks AND CHARACTERISTIC POLYNOMIALS 37 Acknowledgments This work was supported in part by the Korean Ministry of Information and Communications and the Norwegian Research Council. References 1. M. Antweiler and L. Bo mer, Complex sequences over GFð p M Þ with a two-level autocorrelation function and a large linear span, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp E. F. Assmus, Jr. and J. D. Key, Designs and their codes, Cambridge University Press, Cambridge (1992). 3. L. D. Baumert, Cyclic Difference Sets, Lecture Notes in Mathematics, Springer Verlag (1971). 4. J. F. Dillon, Multiplicative difference sets via additive characters, Designs, Codes and Cryptography, Vol. 17 (1999) pp J. F. Dillon and H. Dobbertin, Cyclic difference sets with Singer parameters, Preprint (1999). 6. R. Evans, H. Hollmann, C. Krattenthaler and Q. iang, Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets, Journals of Combin. Theory, Ser. A, Vol. 87 (1999) pp B. Gordon, W. H. Mills and L. R. Welch, Some new difference sets, Canad. J. Math., Vol. 14 (1962) pp T. Helleseth, P. V. Kumar and H. M. Martinsen, A new family of ternary sequences with ideal twolevel autcorrelation, Design, Codes and Cryptography, Vol. 23 (2001) pp T. Helleseth and M. Martinsen, Open problems in sequence design and correlation, Preprint (2000). 10. D. Jungnickel, Difference sets, In (J. Dinitz and D. R. Stinson eds.) Contemporary Design Theory: A Collection of Surveys, John Wiley and Sons (1992). 11. R. Lidl and H. Niederreiter, Finite Fields, Vol. 20 of Encyclopedia of Mathematics and Its Applications, Addison-Wesley, Reading, MA (1983). 12. H. A. Lin, From cyclic Hadamard difference sets to perfectly balanced sequences, Ph.D. Dissertation, University of Southern California, May (1998). 13. J. S. No, New cyclic difference sets with Singer parameters constructed from d-homogeneous functions, Preprint (2000). 14. J. S. No, H. Chung and M. S. Yun, Binary pseudorandom sequences of period 2 m 1 with ideal autocorrelation generated by the polynomial z d þðz þ 1Þ d, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp J. S. No, S. W. Golomb, G. Gong, H. K. Lee and P. Gaal, Binary pseudorandom sequences of period 2 n 1 with ideal autocorrelation, IEEE Trans. Inform. Theory, Vol. 44 (1998) pp J. S. No, K. Yang, H. Chung and H. Y. Song, On the construction of binary sequences with ideal autocorrelation property, Proceedings of 1996 IEEE International Symposium on Information Theory and Its Applications (ISITA 96), Victoria, B.C., Canada, Sept (1996) pp J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc, Vol. 43 (1938) pp K. J. C. Smith, On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry, J. Comb. Theory, Vol. 7 (1969) pp

Singer and GMW constructions (or generalized GMW constructions), little else is known about p-ary two-level autocorrelation sequences. Recently, a few

Singer 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 information

Trace Representation of Legendre Sequences

Trace 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 information

On the Cross-Correlation of a p-ary m-sequence of Period p 2m 1 and Its Decimated

On 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 information

A trace representation of binary Jacobi sequences

A 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 information

Binary Sequences with Optimal Autocorrelation

Binary 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 information

Existence of Cyclic Hadamard Difference Sets and its Relation to Binary Sequences with Ideal Autocorrelation

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 information

Almost Difference Sets and Their Sequences With Optimal Autocorrelation

Almost 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 information

Constructions of Quadratic Bent Functions in Polynomial Forms

Constructions 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 information

New Ternary and Quaternary Sequences with Two-Level Autocorrelation

New 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 information

On 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 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 information

has the two-level autocorrelation function for (2) otherwise, where the periodic unnormalized autocorrelation function of the sequence is defined as

has 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 information

A Class of Pseudonoise Sequences over GF Correlation Zone

A Class of Pseudonoise Sequences over GF Correlation Zone 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

More information

Binary Sequences with Optimal Autocorrelation

Binary 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 information

THE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1

THE 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 information

Hyperbent functions, Kloosterman sums and Dickson polynomials

Hyperbent 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 information

On the existence of cyclic difference sets with small parameters

On 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 information

On Welch-Gong Transformation Sequence Generators

On 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 information

arxiv: v1 [cs.it] 12 Jun 2016

arxiv: 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 information

Some 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 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 information

There are no Barker arrays having more than two dimensions

There 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 information

Minimal polynomials of the modified de Bruijn sequences

Minimal 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 information

EXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS

EXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS EXHAUSTIVE DETERMINATION OF (511, 255, 127)-CYCLIC DIFFERENCE SETS ROLAND B. DREIER AND KENNETH W. SMITH 1. Introduction In this paper we describe an exhaustive search for all cyclic difference sets with

More information

On the Linear Complexity of Legendre-Sidelnikov Sequences

On 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 information

On 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 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 information

Correlation of Binary Sequence Families Derived from Multiplicative Character of Finite Fields

Correlation 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 information

On a Conjectured Ideal Autocorrelation Sequence and a Related Triple-Error Correcting Cyclic Code

On 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 information

A New Characterization of Semi-bent and Bent Functions on Finite Fields

A 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 information

Decomposing Bent Functions

Decomposing 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 information

The expected value of the joint linear complexity of periodic multisequences $

The expected value of the joint linear complexity of periodic multisequences $ Journal of Complexity 19 (2003) 61 72 http://www.elsevier.com/locate/jco The expected value of the joint linear complexity of periodic multisequences $ Wilfried Meidl a and Harald Niederreiter b, * a Institute

More information

Generalized hyper-bent functions over GF(p)

Generalized 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 information

6054 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 9, SEPTEMBER 2012

6054 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 information

arxiv: v1 [cs.dm] 20 Jul 2009

arxiv: v1 [cs.dm] 20 Jul 2009 New Binomial Bent Function over the Finite Fields of Odd Characteristic Tor Helleseth and Alexander Kholosha arxiv:0907.3348v1 [cs.dm] 0 Jul 009 The Selmer Center Department of Informatics, University

More information

Difference Sets Corresponding to a Class of Symmetric Designs

Difference Sets Corresponding to a Class of Symmetric Designs Designs, Codes and Cryptography, 10, 223 236 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Difference Sets Corresponding to a Class of Symmetric Designs SIU LUN MA

More information

50 Years of Crosscorrelation of m-sequences

50 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 information

Third-order nonlinearities of some biquadratic monomial Boolean functions

Third-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 information

ON THE SEMIPRIMITIVITY OF CYCLIC CODES

ON THE SEMIPRIMITIVITY OF CYCLIC CODES ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic

More information

Integer Valued Sequences with 2-Level Autocorrelation from Iterative Decimation Hadamard Transform

Integer 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 information

A SHORT SURVEY OF P-ARY PSEUDO-RANDOM SEQUENCES. Zhaneta Tasheva

A 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 information

Hadamard ideals and Hadamard matrices with two circulant cores

Hadamard ideals and Hadamard matrices with two circulant cores Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,

More information

COMMUTATIVE SEMIFIELDS OF ORDER 243 AND 3125

COMMUTATIVE 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 information

Extended Binary Linear Codes from Legendre Sequences

Extended 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 information

Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice

Constructing 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 information

Four classes of permutation polynomials of F 2 m

Four 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 information

Hyper-bent Functions

Hyper-bent Functions Hyper-bent Functions Amr M. Youssef 1 and Guang Gong 2 1 Center for Applied Cryptographic Research Department of Combinatorics & Optimization University of Waterloo, Waterloo, Ontario N2L3G1, CANADA a2youssef@cacr.math.uwaterloo.ca

More information

Optimal Ternary Cyclic Codes From Monomials

Optimal Ternary Cyclic Codes From Monomials 5898 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 59, NO 9, SEPTEMBER 2013 Optimal Ternary Cyclic Codes From Monomials Cunsheng Ding, Senior Member, IEEE, and Tor Helleseth, Fellow, IEEE Abstract Cyclic

More information

Hyperbent functions, Kloosterman sums and Dickson polynomials

Hyperbent 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 information

On the Complexity of the Dual Bases of the Gaussian Normal Bases

On the Complexity of the Dual Bases of the Gaussian Normal Bases Algebra Colloquium 22 (Spec ) (205) 909 922 DOI: 0.42/S00538675000760 Algebra Colloquium c 205 AMSS CAS & SUZHOU UNIV On the Complexity of the Dual Bases of the Gaussian Normal Bases Algebra Colloq. 205.22:909-922.

More information

Sequences, DFT and Resistance against Fast Algebraic Attacks

Sequences, DFT and Resistance against Fast Algebraic Attacks Sequences, DFT and Resistance against Fast Algebraic Attacks Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo, Ontario N2L 3G1, CANADA Email. ggong@calliope.uwaterloo.ca

More information

Sequences and Linear Codes from Highly Nonlinear Functions

Sequences 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 information

#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS

#A30 INTEGERS 17 (2017) CONFERENCE MATRICES WITH MAXIMUM EXCESS AND TWO-INTERSECTION SETS #A3 INTEGERS 7 (27) CONFERENCE MATRICES WITH MAIMUM ECESS AND TWO-INTERSECTION SETS Koji Momihara Faculty of Education, Kumamoto University, Kurokami, Kumamoto, Japan momihara@educ.kumamoto-u.ac.jp Sho

More information

On the Number of Trace-One Elements in Polynomial Bases for F 2

On the Number of Trace-One Elements in Polynomial Bases for F 2 On the Number of Trace-One Elements in Polynomial Bases for F 2 n Omran Ahmadi and Alfred Menezes Department of Combinatorics & Optimization University of Waterloo, Canada {oahmadid,ajmeneze}@uwaterloo.ca

More information

Divisibility of Trinomials by Irreducible Polynomials over F 2

Divisibility 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 information

arxiv: v1 [cs.it] 31 May 2013

arxiv: 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 information

ON VALUES OF CYCLOTOMIC POLYNOMIALS. V

ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of

More information

New quaternary sequences of even length with optimal auto-correlation

New 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 information

New Constructions of Quaternary Hadamard Matrices

New 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 information

Periodicity and Distribution Properties of Combined FCSR Sequences

Periodicity 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 information

GENERATION OF PRIMITIVE BINARY POLYNOMIALS

GENERATION 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 information

On Boolean functions which are bent and negabent

On Boolean functions which are bent and negabent On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra

More information

Low Correlation Sequences for CDMA

Low 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 information

On The Weights of Binary Irreducible Cyclic Codes

On The Weights of Binary Irreducible Cyclic Codes On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:

More information

On the Cross-correlation of a Ternary m-sequence of Period 3 4k+2 1 and Its Decimated Sequence by (32k+1 +1) 2

On the Cross-correlation of a Ternary m-sequence of Period 3 4k+2 1 and Its Decimated Sequence by (32k+1 +1) 2 On the Cross-correlation of a Ternary m-sequence of Period 3 4k+2 1 and Its Decimated Sequence by (32k+1 +1) 2 8 Sung-Tai Choi, Tae-Hyung Lim, Jong-Seon No, 1 and Habong Chung 2 1 Department of EECS, INMC,

More information

Appendix A Finite or Galois Fields

Appendix A Finite or Galois Fields Appendix A Finite or Galois Fields Finite or Galois fields are used in the design and in the interpretation of the operation of some arithmetic and algebraic circuits. The axioms and the main properties

More information

BENT POLYNOMIALS OVER FINITE FIELDS

BENT POLYNOMIALS OVER FINITE FIELDS BENT POLYNOMIALS OVER FINITE FIELDS ROBERT S COULTER AND REX W MATTHEWS Abstract. The definition of bent is redefined for any finite field. Our main result is a complete description of the relationship

More information

Multiplicative Order of Gauss Periods

Multiplicative Order of Gauss Periods Multiplicative Order of Gauss Periods Omran Ahmadi Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, M5S 3G4, Canada oahmadid@comm.utoronto.ca Igor E. Shparlinski

More information

Some Results on the Arithmetic Correlation of Sequences

Some 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 information

Complete characterization of generalized bent and 2 k -bent Boolean functions

Complete 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 information

New Families of Triple Error Correcting Codes with BCH Parameters

New 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 information

A New Class of Bent Negabent Boolean Functions

A 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 information

Tail probability of random variable and Laplace transform

Tail probability of random variable and Laplace transform Applicable Analysis Vol. 84, No. 5, May 5, 499 5 Tail probability of random variable and Laplace transform KENJI NAKAGAWA* Department of Electrical Engineering, Nagaoka University of Technology, Nagaoka,

More information

On the Hyers-Ulam Stability Problem for Quadratic Multi-dimensional Mappings on the Gaussian Plane

On the Hyers-Ulam Stability Problem for Quadratic Multi-dimensional Mappings on the Gaussian Plane Southeast Asian Bulletin of Mathematics (00) 6: 483 50 Southeast Asian Bulletin of Mathematics : Springer-Verlag 00 On the Hyers-Ulam Stability Problem f Quadratic Multi-dimensional Mappings on the Gaussian

More information

Difference Systems of Sets and Cyclotomy

Difference Systems of Sets and Cyclotomy Difference Systems of Sets and Cyclotomy Yukiyasu Mutoh a,1 a Graduate School of Information Science, Nagoya University, Nagoya, Aichi 464-8601, Japan, yukiyasu@jim.math.cm.is.nagoya-u.ac.jp Vladimir D.

More information

A New Approach to Permutation Polynomials over Finite Fields

A New Approach to Permutation Polynomials over Finite Fields A New Approach to Permutation Polynomials over Finite Fields Xiang-dong Hou Department of Mathematics and Statistics University of South Florida Coding, Cryptology and Combinatorial Designs Singapore,

More information

Binary Sequence Pairs with Ideal Correlation and Cyclic Difference Pairs

Binary Sequence Pairs with Ideal Correlation and Cyclic Difference Pairs Binary Sequence Pairs with Ideal Correlation and Cyclic Difference Pairs Seok-Yong Jin The Graduate School Yonsei University Department of Electrical and Electronic Engineering Binary Sequence Pairs with

More information

Construction of Protographs for QC LDPC Codes With Girth Larger Than 12 1

Construction of Protographs for QC LDPC Codes With Girth Larger Than 12 1 Construction of Protographs for QC LDPC Codes With Girth Larger Than 12 1 Sunghwan Kim, Jong-Seon No School of Electrical Eng. & Com. Sci. Seoul National University, Seoul, Korea Email: {nodoubt, jsno}@snu.ac.kr

More information

A note on constructing permutation polynomials

A note on constructing permutation polynomials A note on constructing permutation polynomials Robert Coulter a, Marie Henderson b,1 Rex Matthews c a Department of Mathematical Sciences, 520 Ewing Hall, University of Delaware, Newark, Delaware, 19716,

More information

Topic 3. Design of Sequences with Low Correlation

Topic 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 information

Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.

Galois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a. Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More

More information

On Binary Cyclic Codes with Codewords of Weight Three and Binary Sequences with the Trinomial Property

On 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 information

Dickson Polynomials that are Involutions

Dickson 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 information

Cyclotomic schemes and related problems

Cyclotomic schemes and related problems momihara@educkumamoto-uacjp 16-06-2014 Definition Definition: Cayley graph G: a finite abelian group D: an inverse-closed subset of G (0 D and D = D) E := {(x, y) x, y G, x y D} (G, E) is called a Cayley

More information

An Additive Characterization of Fibers of Characters on F p

An Additive Characterization of Fibers of Characters on F p An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009

More information

THE ALGORITHM TO CALCULATE THE PERIOD MATRIX OF THE CURVE x m þ y n ¼ 1

THE ALGORITHM TO CALCULATE THE PERIOD MATRIX OF THE CURVE x m þ y n ¼ 1 TSUKUA J MATH Vol 26 No (22), 5 37 THE ALGORITHM TO ALULATE THE PERIOD MATRIX OF THE URVE x m þ y n ¼ y Abstract We show how to take a canonical homology basis and a basis of the space of holomorphic -forms

More information

Construction X for quantum error-correcting codes

Construction X for quantum error-correcting codes Simon Fraser University Burnaby, BC, Canada joint work with Vijaykumar Singh International Workshop on Coding and Cryptography WCC 2013 Bergen, Norway 15 April 2013 Overview Construction X is known from

More information

A four-class association scheme derived from a hyperbolic quadric in PG(3, q)

A four-class association scheme derived from a hyperbolic quadric in PG(3, q) Adv. Geom. 4 (24), 5 7 Advances in Geometry ( de Gruyter 24 A four-class association scheme derived from a hyperbolic quadric in PG(3, q) (Communicated by E. Bannai) Abstract. We prove the existence of

More information

DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS

DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using

More information

Design of Pseudo-Random Spreading Sequences for CDMA Systems

Design 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 information

The Array Structure of Modified Jacobi Sequences

The 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 information

ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE

ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This

More information

Plotkin s Bound in Codes Equipped with the Euclidean Weight Function

Plotkin s Bound in Codes Equipped with the Euclidean Weight Function Tamsui Oxford Journal of Mathematical Sciences 5() (009) 07-4 Aletheia University Plotkin s Bound in Codes Equipped with the Euclidean Weight Function Sapna Jain Department of Mathematics, University of

More information

Splittable Whist Tournament Designs

Splittable Whist Tournament Designs Splittable Whist Tournament Designs 1 David R. Berman Department of Computer Science University of North Carolina Wilmington Wilmington, NC 28403 bermand@uncw.edu Norman J. Finizio Department of Mathematics

More information

M 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

M 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 information

EXPLICIT EVALUATIONS OF SOME WEIL SUMS. 1. Introduction In this article we will explicitly evaluate exponential sums of the form

EXPLICIT EVALUATIONS OF SOME WEIL SUMS. 1. Introduction In this article we will explicitly evaluate exponential sums of the form EXPLICIT EVALUATIONS OF SOME WEIL SUMS ROBERT S. COULTER 1. Introduction In this article we will explicitly evaluate exponential sums of the form χax p α +1 ) where χ is a non-trivial additive character

More information

Pencils of Quadratic Forms over Finite Fields

Pencils 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 information

Finite geometry codes, generalized Hadamard matrices, and Hamada and Assmus conjectures p. 1/2

Finite geometry codes, generalized Hadamard matrices, and Hamada and Assmus conjectures p. 1/2 Finite geometry codes, generalized Hadamard matrices, and Hamada and Assmus conjectures Vladimir D. Tonchev a Department of Mathematical Sciences Michigan Technological University Houghton, Michigan 49931,

More information

Design 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 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 information

A new Kloosterman sum identity over F 2 m for odd m

A new Kloosterman sum identity over F 2 m for odd m Discrete Mathematics 268 (2003) 337 341 www.elsevier.com/locate/disc Note A new Kloosterman sum identity over F 2 m for odd m Dong-Joon Shin a; ;1, Wonjin Sung b;2 a Division of Electrical and Computer

More information

Low Correlation Zone Sequences

Low 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 information

Differentiation matrices in polynomial bases

Differentiation matrices in polynomial bases Math Sci () 5 DOI /s9---x ORIGINAL RESEARCH Differentiation matrices in polynomial bases A Amiraslani Received January 5 / Accepted April / Published online April The Author(s) This article is published

More information

New congruences for overcubic partition pairs

New congruences for overcubic partition pairs New congruences for overcubic partition pairs M. S. Mahadeva Naika C. Shivashankar Department of Mathematics, Bangalore University, Central College Campus, Bangalore-560 00, Karnataka, India Department

More information