Two classes of ternary codes and their weight distributions


 Dennis Harper
 3 years ago
 Views:
Transcription
1 Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight and weight distribution, and prove their properties We also present four classes of 1designs that are based on the classes of ternary codes Keywords Group character codes, ternary codes, designs 1 Introduction Ternary codes have been studied by many authors, see, for example, Bogdanova and Boukliev [2], Hamada, Helleseth and Ytrehus [5], Hill and Newton [, 7], van Eupen [1, 14, 15], and van Eupen and van Lint [1] Much of the study was concentrated on ternary codes of small dimensions A class of [2 n, k i=0 ( n i), 2 n r ] group character codes C q (r, n) over GF (q), where q is odd, is described and analyzed by Ding, Kohel and Ling [] This class of codes contains the ternary codes C (1, n) In this paper, we describe a new class of [2 n, n + 1] ternary codes and a class of [2 n, n + 2] ternary codes, and determine their weight distributions The supports of the minimum weight codewords of these codes give 1designs under certain conditions The supports of all codewords of some other weight also give 1designs As byproducts we present here four classes of 1designs that are based on the ternary codes C Ding is with the Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore T Kløve is with the Department of Informatics, University of Bergen, HIB, N5020 Bergen, Norway F Sica is with the Department of Computer Science, National University of Singapore, Lower Kent Ridge Road, Singapore
2 2 The class of ternary codes C (r, n) Note that (GF (2) n, +) is an additive Abelian group of exponent 2 and order N = 2 n, with 0 as the identity element From now on we assume that n 2 Let M denote the multiplicative group of characters from GF (2) n to GF () The group M is isomorphic noncanonically to GF (2) n [12, Chapter VI] In particular we have M = GF (2) n = N = 2 n The set GF (2) n may be identified with the set of integers {i : 0 i 2 n 1}: the element (i 0, i 1,, i n 1 ) of GF (2) n is identified with i = i 0 + i i n 1 2 n 1, where each i j is 0 or 1 We also say that (i 0, i 1,, i n 1 ) is the binary representation of i We define f i (y) = ( 1) i 0y 0 +i 1 y 1 + +i n 1 y n 1, (1) where y = (y 0, y 1,, y n 1 ) GF (2) n, and (i 0, i 1,, i n 1 ) is the binary representation of i It is easy to check that, for all i with 0 i 2 n 1, this gives all the 2 n characters from GF (2) n to GF () with f 0 as the trivial character, so M = {f 0, f 1,, f 2 n 1} Since we identify i and y with their respective binary representation, we have f i (y) = f y (i) For any subset X of GF (2) n, the group character code C X over GF () described by Ding, Kohel and Ling [] is: C X = { (c 0, c 1,, c N 1 ) GF () N : N 1 i=0 } c i f i (x) = 0 for all x X Let X = {x 0, x 1,, x t 1 } be a subset of GF (2) n and let X c be the complement of X in GF (2) n, indexed such that GF (2) n = {x 0, x 1,, x N 1 } Proposition 1 [] Let X be as above For 0 i N 1, let v i denote the vector (f 0 (x i ), f 1 (x i ),, f N 1 (x i )) Then the set {v 0, v 1,, v N 1 } is linearly independent In particular, H = [ ] f j 1 (x i 1 ) 1 i t, 1 j N has rank t and is a parity check matrix of C X, [ ] G = f j 1 (x t 1+i ) 1 i N t, 1 j N has rank N t and is a generator matrix for C X, so C X is an [N, N t] linear code over GF () Moreover, H is a generator matrix for C X c and C X C X c = GF () N 2
3 The Hamming weight of a vector a of GF (2) n, denoted wt(a), is defined to be the number of its nonzero coordinates For 1 r n, let X(r, n) = {a GF (2) n : wt(a) > r}, and let C (r, n) denote the code C X(r,n) over GF () For a word c = (c 0,, c 2 n 1) in GF () 2n, let the support of c be defined as Supp(c) = {i : 0 i < 2 n, and c i 0} By convention we define the minimum distance of the zero code to be, which we represent by any integer larger than the block length of the code Proposition 2 [] The following properties of the codes C (r, n) are known: (A) C (r, n) is a [2 n, r j=0 ( n j), 2 n r ] ternary code (B) The minimum nonzero weight codewords generate C (r, n) (C) The dual code C (r, n) is equivalent to C (n r 1, n) In the sequel we define v 0 = (1, 1,, 1) GF () n and v i = (f 0 (e i ), f 1 (e i ),, f N 1 (e i )) for all 1 i n, where e i is the vector of GF (2) n whose ith coordinate is 1 and other coordinates are all zero Proposition [4] For any integer 1 m n + 1, in the code C (1, n) there are ( n+1) m 2 m codewords of the form m 1 j=0 a jv ij which have the same Hamming weight w(m) := 2 n m+1 2m ( 1) m, (2) where all a j GF (), and 0 i 0 < i 1 < < i m 1 n The n weights w(m) in (2) are pairwise distinct and satisfy w(2) < w(4) < w() < < w(2 n/2 ) < w(2 (n 1)/2 + 1) < < w(2 (n 1)/2 1) < < w(5) < w() < w(1) For a ternary [N, K] code C, let A i = A i (C), i = 0, 1,, N, be its weight distribution and let N A C (x) = A i (C)x i i=0 be its weight distribution function Then A C (x) and A C (x) are related by the MacWilliams identity (see eg [11, p 88]) A C (x) = 1 K N i=0 A i (C) (1 x) i (1 + 2x) N i = 1 ( 1 x ) K (1 + 2x)N A C () 1 + 2x
4 From Proposition we get A C (1,n)(x) = 1 + n+1 m=1 ( ) n m x w(m) m Combining this with () we get A C (1,n) (x) The explicit expressions for A i (C (1, n) ) are quite complicated in general However, we get A i (C (1, n) ) = 0 for 1 i (as we should since the code has minimum distance 4 by Proposition ) and A 4 (C (1, n) ) = n 2 4 n + 2 n (4) 4 In the rest of this section, we prove some auxiliary results for later sections and present a class of new 1designs The following lemma is a wellknown result, known as the orthogonality relations in character theory [12, Chapter VI, Proposition 4] Lemma 4 Let A be a finite additive Abelian group of order N and let M be the group of characters of A For characters f, g in M and elements x, y in A, we have: 1 x A f(x)g(x) = { N if f = g 1 0 if f g 1 2 f M f(x)f(y) = { N if x = y 0 if x y Define e 0 to be the zero vector of GF (2) n For each i with 1 i n, e i is defined as before Let e n+1, e n+2,, e 2 n 1 denote the elements of GF (2) n \ {e 0, e 1,, e n } with any order Define v i = (f 0 (e i ), f 1 (e i ),, f N 1 (e i )) for all 0 i 2 n 1 By Lemma 4, the vectors v 0, v 1,, v 2 n 1 are linearly independent over GF () Take any n+1 vectors v j0, v j1,, v jn, where 0 j 0 < j 1 < < j n 2 n 1, we use T j0,j 1,,j n to denote the ternary code generated by v j0, v j1,, v jn Proposition 5 If 1 j 1 < j 2 < < j n 2 n 1 and e j1, e j2,, e jn are linearly independent, then T 0,j1,,j n is equivalent to C (1, n) and has thus the same parameters and weight distribution as C (1, n) That is, for any integer 1 m n + 1, in the code T 0,j1,j 2,,j n there are ( n+1) m 2 m codewords of the form m 1 l=0 a lv jil which have the same Hamming weight w(m), where 1 i 0 < i 1 < < i m 1 n 4
5 Proof: Note that C (1, n) = T 0,1,,n To prove the equivalence, we will show that by some column permutations a generator matrix of T 0,j1,,j n gives a generator matrix of T 0,1,,n Consider the following matrices and M(j 1,, j n ) := [e l e ji ] 1 i n, 0 l 2 n 1 G(j 1,, j n ) := [( 1) e le ji ]0 i n, 0 l 2 n 1, where e j1, e j2,, e jn are linearly independent, and e 0 e j1 denotes the standard inner product Since e j1, e j2,, e jn are linearly independent over GF (2), every vector of GF (2) n appears exactly once as column vectors of the matrix M(j 1,, j n ) Hence by some column permutations, M(j 1,, j n ) can be rearranged into M(1,, n) Therefore the generate matrix G(j 1,, j n ) of T 0,j1,,j n can be rearranged into the generator matrix G(1,, n) of T 0,1,,n by the same column permutations This proves the equivalence Example 1 Consider the case n = We take e j1 = (1, 0, 0), e j2 = (0, 1, 0), and e j = (1, 1, 1) The three vectors are linearly independent Then the code T 0,j1,j 2,j has parameters [8, 4, 4] and generator matrix The weight enumerator of this code is x 4 + 1x 5 + 2x + 8x 8 This code is one of the best possible codes of this length and dimension Remark: The condition that e j1, e j2,, e jn are linearly independent in Proposition 5 is necessary to ensure that the minimum weight of the code T 0,j1,,j n is 2 n 1 For example, in the case n = if we take e j1 = (0, 1, 0), e j2 = (0, 0, 1), and e j = (0, 1, 1) The three vectors are linearly dependent Then the code T 0,j1,j 2,j has parameters [8, 4, 2] and generator matrix The weight enumerator of this code is 1 + 8x x 4 + 2x + 1x 8 minimum distance is less than 2 n 1 So the 5
6 Proposition The set of supports of the minimum nonzero weight codewords of T 0,j1,j 2,,j n in Proposition 5 is a 1(2 n, 2 n 1, n(n + 1)/2) design Proof: This can be proved similarly as Corollary 17 in [] It is interesting to note that the code T 0,j1,j 2,,j n in Proposition 5 has only one odd weight w(n + 1) Only codewords of form n i=0 a i v i have this odd weight, where each a i 0 We now prove that the supports of these codewords give 1designs First we quote an old result of C Ramus from 184 which will be needed in the proof and also later Lemma 7 [10, p 70] Let m and µ be positive integers and 0 i < µ Then µ,i (m) def = 0 j m j i mod µ ( ) m = 1 j µ µ 1 ( l=0 2 cos lπ ) m l(m 2i)π cos µ µ Proposition 8 The set of supports of all the codewords n i=0 a i v i, where each a i 0, in the code T 0,j1,j 2,,j n of Proposition 5, is a 1(2 n, (2 n+1 ( 1) n+1 )/, λ) design, where λ = 2 n+1 +( 1) n/ 2 if n 0 (mod ), 2 n+1 ( 1) (n 1)/ if n 1 (mod ), 2 n+1 +( 1) (n 2)/ if n 2 (mod ) Proof: A codeword covers another one if and only if the set of supports of the former contains that of the latter We first prove that a codeword x := n i=0 a i v i covers another one y := n i=0 b i v i if and only if one is a nonzero multiple of the other, where each a i and b i are nonzero We need only to prove one direction of this claim as the other is obvious Assume now that x covers y Then x covers both x ± y Let h denote the Hamming distance between (a 0,, a n ) and (b 0,, b n ) If h = n + 1 or h = 0, then x is a multiple of y Suppose that h 0 and h n + 1 Then x y is a linear combination of h vectors v i and x + y is a linear combination of n h vectors v i If n is odd, one of h and n h is odd If h is odd, by Proposition 5 the weight of x y is larger than that of x, so x cannot cover x y If h is even, then x cannot cover x + y If n is even, similarly we can prove that x cannot cover at least one of x ± y This leads to a contradiction So h must be equal to one of 0 and n + 1 and x must be a nonzero multiple of y Hence all the codewords of the form n i=0 a i v i, where a 0 = 1, give 2 n different supports The weight of such a codeword is w(n + 1) = 2n+1 ( 1) n+1 We now
7 consider the function F d1,,d n (x) := 1 + d 1 x 1 + d 2 x d n x n from (GF () ) n to GF (), where each d i is a nonzero element of GF () and x = (x 1,, x n ) The weight of F d1,,d n (x) is defined to be the number of nonzero elements of GF () this function takes on when x ranges over all elements of (GF () ) n Since each d i and x i can be written in the form ( 1) y, where y GF (2), the weight of F d1,,d n (x) does not depend on d i It then follows from the definition of these v i that the set of supports of all these codewords is a 1(2 n, w(n + 1), λ) design It remains to determine λ To this end, we need to consider the weight of F 1,,1 (x) It is seen that the weight of this function is 2 n {z GF (2) n : wt(z) 2n 1 (mod )} = 2 n,i (n) where i 2n 1 (mod ) Then the λ, which is the weight of the function F 1,,1 (x), is given by Lemma 7 This completes the proof of this proposition Another class of [2 n, n + 1] ternary codes Let e 2 n 1 denote the allone vector (1, 1,, 1) of GF (2) n, and let v 2 n 1 = (f 0 (e 2 n 1), f 1 (e 2 n 1),, f 2 n 1(e 2 n 1)) Let e 1, e 2,, e n be the n vectors as before We use T 1,2,,n,2 n 1 to denote the linear code generated by v 1, v 2,, v n and v 2 n 1 By Lemma 4, T 1,2,,n,2 n 1 has dimension n + 1 We now determine the minimum weight and the weight distribution of this code Proposition 9 The code T 1,2,,n,2 n 1 is a [2 n, n + 1, d] ternary code, where d is given below If n is even, then the minimum weight d of this code is 2 n 1, and the weight distribution in this code is given in Table 1 weight frequency codewords ( w(m) n+1 ) m 2 m m 1 l=0 a lv jl, where 1 m n where j l {1,, n, 2 n 1}, 2 n n+1 ni=1 a i v i + av 2 n 1, a i 0, a 0 Table 1: Weight distribution in T 1,2,,n,2 n 1 when n is even If n is odd, then the minimum weight d of this code is { [ min 2 n 1, 2 n+1 1 (n+1)/2] } /, and the weight distribution in this code is given in Table 2 7
8 weight frequency codewords ( w(m) n+1 ) m 2 m m 1 l=0 a lv jl, where 1 m n where j l {1,, n, 2 n 1}, 2 n+1 1 ( ) (n+1)/2 2 n ni=1 a i v i + av 2 n 1 where wt(h) even, a i 0, a 0 2 n+1 1+( ) (n+1)/2 2 n ni=1 a i v i + av 2 n 1 where wt(h) odd, a i 0, a 0 Table 2: Weight distribution in T 1,2,,n,2 n 1 when n is odd Case I Since u and au have the same Hamming weight if a 0, we consider the weight of the following codeword u := m 2 l=0 where j l {1, 2,, n}, m 1 n, and each a l 0 Subcase I1 a l v jl + v 2 n 1, (5) We consider the vector u of (5) under the condition that m 1 < n a l = ( 1) h l, where h l = {0, 1} We now consider the following matrix e 0 e j0 + h 0 e 1 e j0 + h 0 e 2 n 1e j0 + h 0 e 0 e j1 + h 1 e 1 e j1 + h 1 e 2 L := n 1e j1 + h 1 e 0 e jm 2 + h m 2 e 1 e jm 2 + h m 2 e 2 n 1e jm 2 + h m 2 Each Since e j0, e j1,, e jm 2 are linearly independent, each vector of GF (2) m 1 appears exactly 2 n (m 1) times as column vectors of L Let j m 1, j m,, j n 1 be the elements of {1, 2,, n} \ {j 0, j 1,, j m 2 } Consider now the following matrix 8
9 L 1 := e 0 e j0 + h 0 e 1 e j0 + h 0 e 2 n 1e j0 + h 0 e 0 e j1 + h 1 e 1 e j1 + h 1 e 2 n 1e j1 + h 1 e 0 e jm 2 + h m 2 e 1 e jm 2 + h m 2 e 2 n 1e jm 2 + h m 2 e 0 e jm 1 e 1 e jm 1 e 2 n 1e jm 1 e 0 e jn 1 e 1 e jn 1 e 2 n 1e jn 1 Since e j0, e j1,, e jn 1 are linearly independent, each vector of GF (2) m 1 appears exactly once as a column vector of L 1 Let s 0, s 1,, s 2 m 1 1 be all the vectors of GF (2) m 1, and we let t 0, t 1,, t 2 n (m 1) 1 be all the vectors of GF (2)n (m 1) By permutations on columns, L 1 can be rearranged into the following matrix L 2 : [ ] s0 s 1 s 2 m 1 1 s 0 s 1 s 2 m 1 1 t 0 t 0 t 0 t 2 n (m 1) 1 t 2 n (m 1) 1 t 2 n (m 1) 1 The weight of the codeword u in (5) can be determined by looking at the first m 1 rows of the matrix L 2 However, all the vectors s i and t i are needed to determine the corresponding coordinates of v 2 n 1 This is because by definition f x (e 2 n 1) = ( 1) x 0+x 1 + +x n 1, where (x 0, x 1,, x n 1 ) is the binary representation of the integer x Define r = m mod We use y to denote one of the vectors s i and x to denote one of the vectors t i Then (y T, x T ) T ranges over all column vectors of L 2 when y and x run over all vectors of GF (2) m 1 and GF (2) n (m 1) respectively, where y T denotes the transpose of y Let w be the Hamming weight of y Suppose that y and x are in the ith column of L 2, then (m 1 2w) mod is the corresponding entry of the codeword m 2 l=0 a lv jl, and (m 1 2w + ( 1) w+wt(x) ) mod is the corresponding entry of the codeword m 2 l=0 a lv jl + v 2 n 1 It is then seen that Table gives the distribution of the elements {r, r 1, r 2} of GF () in the codeword u of (5) By Table, we have the following frequency of appearance of the elements of GF () in the codeword u: r GF () frequency r r 1 [,0 (m 1) +,5 (m 1) +,2 (m 1) +, (m 1)]2 n m [,1 (m 1) +,2 (m 1) +,4 (m 1) +,5 (m 1)]2 n m () r 2 [, (m 1) +,4 (m 1) +,0 (m 1) +,1 (m 1)]2 n m By Lemma 7 and (), the frequency of appearance of the elements of GF () in the codeword u is given in Table 4 9
10 w := wt(y) g entries of u entries of u frequency wt(x) even wt(x) odd w 0 (mod ) r 1 r r 2 2 n m,0 (m 1) w 1 (mod ) r r 1 r 2 2 n m,1 (m 1) w 2 (mod ) r 2 r 1 r 2 n m,2 (m 1) w (mod ) r 1 r 2 r 2 n m, (m 1) w 4 (mod ) r r 2 r 1 2 n m,4 (m 1) w 5 (mod ) r 2 r r 1 2 n m,5 (m 1) Table : Distribution of elements of GF () in u, where g := (m 1 2w) mod m 1 = k m 1 = k + 1 m 1 = k + 2 r r 1 r 2 2 m +( 1) k 2 n m 2 m ( 1) k 2 2 n m 2 m +( 1) k 2 n m 2 m ( 1) k 2 n m 2 m ( 1) k 2 n m 2 m +( 1) k 2 2 n m 2 m ( 1) k 2 2 n m 2 m +( 1) k 2 n m 2 m +( 1) k 2 n m Table 4: The frequency distribution of the elements of GF () in u With Table 4, we obtain that wt(u) = 2m+1 +( 1) k 2 2 n m if m 1 = k, wt(u) = 2m+1 ( 1) k 2 2 n m if m 1 = k + 1, wt(u) = 2m+1 +( 1) k 2 2 n m if m 1 = k + 2 It is then easy to check that wt(u) = w(m) Subcase I2 We consider the codeword u of (5) under the condition that m 1 = n Let a l = ( 1) h l, where h l {0, 1} Define h = (h 0, h 1,, h m 2 ) To determine the weight of u, we need the values of some,i (n) +,j (n) given in Lemma 7 With an argument similar to that in Subcase I1, we obtain the weight of u given in Table 5 Case II For any codeword u := m 1 l=0 a l v jl, (7) 10
11 wt(u) (wt(h) even) 2 n even n+1 +1 n odd 2 n+1 1 ( ) (n+1)/2 wt(u) (wt(h) odd) 2 n n+1 1+( ) (n+1)/2 Table 5: The weight of u in Subcase I2 where j l {1, 2,, n}, the weight of u is w(m) as described in Proposition 5 Summarizing the discussion in the two cases proves the conclusion of this proposition Lemma 10 If n 1 and n is odd, then [ 2 n 1 < 2 n+1 1 (n+1)/2] / If n 8 and n is even, then 2 n 1 < [ 2 n+2 1 (n+2)/2] / Proof: The two inequalities can be easily proved by induction on n Remark: If n is even, then A T1,2,,n,2 n 1 (x) = A C (1,n)(x) In particular, the minimum weight of the code T 1,2,,n,2 n 1 is 2 n 1 and the minimum weight of the dual code is 4 When n is odd, the minimum weight of the code T 1,2,,n,2 n 1 is { { [ d = min 2 n 1, 2 n+1 1 (n+1)/2] } < 2 n 1 if n 11, / = = 2 n 1 if n 1 Using MacWilliams identity, we get A 1 (T 1,2,,n,2 n 1) = 0, A 2 (T 1,2,,n,2 n 1) = 2 n In particular, the minimum weight of the dual code is 2 Proposition 11 If n is even or if n 1 is odd, then the minimum weight codewords of T 1,2,,n,2 n 1 generate this code 11
12 Proof: By Proposition 9 and Lemma 10, in both cases the minimum weight codewords are of the form av i + bv j, where i < j Thus it suffices to prove that v 2 n 1 + v j1, v 2 n 1 + v j2,, v 2 n 1 + v jn, and v 2 n 1 v jn are linearly independent This can be easily proved as v 2 n 1, v 0, v 1,, v n are linearly independent Proposition 12 The set of supports of the minimum nonzero weight codewords of T 1,2,,n,2 n 1 is a 1(2 n, 2 n 1, n(n + 1)/2) design when n is even or n 1 is odd Proof: Note that the minimum weight codewords of T 1,2,,n,2 n 1 must be of the form av i + bv i, where i j, a 0, and b 0, when n is even or n 1 is odd This proposition can then be proved similarly as Corollary 17 in [] Example 2 Consider the case n = 4 We take e ji = e i for i = 1, 2,, 4 The four vectors are linearly independent Then the code T j1,j 2,j,j 4,2 4 1 has parameters [1, 5, 8] and generator matrix The weight enumerator of this code is x x x x x 1 The best ternary codes of length 1 and dimension 5 have minimum distance 9 So this is almost the best code of these parameters 4 A class of [2 n, n + 2] ternary codes Let T 0,1,2,,n,2 n 1 denote the code generated by v 0, v 1,, v n and v 2 n 1 Clearly, it has dimension n + 2 The minimum distance and weight distribution of this code is given in the following proposition Proposition 1 The code T 0,1,2,,n,2 n 1 is a [2 n, n + 2, d] ternary code, where d is given below If n is even, then the minimum weight d of this code is { min 2 n 1, 1 [2 n+2 1 () (n+2)/2]} and the weight distribution in this code is given in Table 12
13 weight frequency codewords ( w(m) n+2 ) m 2 m m 1 l=0 a lv jl, where 1 m n where j l {0, 1,, n, 2 n 1}, w(n + 1) (n + 1)2 n+1 nl=0 a l v jl, j 0 = 0, j l {0, 1,, n, 2 n 1} 2 n n+1 ni=1 a i v i + av 2 n 1 2 n+2 1+( ) n/2 2 n+1 nl=0 a l v l + av 2 n 1 2 n+2 1 ( ) n/2 2 n+1 nl=0 a l v l + av 2 n 1 Table : Weight distribution in T 0,1,2,,n,2 n 1 when n is even, where all a i and a are nonzero If n is odd, then the minimum weight d of this code is { } min 2 n 1, (2 n+1 1 (n+1)/2 )/, and the weight distribution in this code is given in Table 7 weight frequency codewords ( w(m) n+2 ) m 2 m m 1 l=0 a lv jl, where 1 m n where j l {0, 1,, n, 2 n 1}, w(n + 1) (n + 1)2 n+1 nl=0 a l v jl, j 0 = 0, j l {0, 1,, n, 2 n 1} 2 n+1 1 ( ) (n+1)/2 2 n ni=1 a i v i + av 2 n 1 2 n+1 1+( ) (n+1)/2 2 n ni=1 a i v i + av 2 n 1 2 n+2 +1+( ) (n+1)/2 2 n+1 nl=0 a l v l + av 2 n 1 2 n+2 +1 ( ) (n+1)/2 2 n+1 nl=0 a l v l + av 2 n 1 Table 7: Weight distribution in T 0,1,2,,n,2 n 1 when n is odd, where all a l and a are nonzero Proof: Note that T 0,1,2,,n,2 n 1 contains both T 0,1,2,,n and T 1,2,,n,2 n 1 as subcodes We need only to consider the codewords m 2 u := a 0 v 0 + a l v l + av 2 n 1, l=1 where a l 0 and a 0 If m 2 < n, with an argument similar to Subcase I1 of Section, we can prove that wt(u) = w(m) If m 2 = n, similarly we can prove the following: 1
14 (1) If n is even, wt(u) takes on 2n+2 1+( ) n/2 for 2 n+1 codewords u respec (2) If n is odd, wt(u) takes on 2n+2 +1+( ) (n+1)/2 tively for 2 n+1 codewords u and 2n+2 1 ( ) n/2 respectively and 2n+2 +1 ( ) (n+1)/2 Combining these two conclusions and Propositions 5 and 9 proves this proposition Remarks: 1 Combining Proposition 1 and MacWilliams identity we get that the code (T 0,1,2,,n,2 n 1) has minimum weight 4 and A 4 ((T 0,1,2,,n,2 n 1) ) = { ( n 8 4 n n )/1 if n is even, ( n 8 4 n n )/1 if n is odd 2 By Lemma 10, if n 8 and n is even or if n 1 and n is odd, T 0,1,2,,n,2 n 1 has minimum distance d = 2 n 1 Thus the code T 0,1,2,,n,2 n 1 is better than T 1,2,,n,2 n 1 and T 0,1,2,,n except for a few n s Proposition 14 If n 8 is even or if n 1 is odd, then the minimum weight codewords of T 0,1,2,,n,2 n 1 generate this code Proof: The proof of Proposition 11 applies here Proposition 15 The set of supports of the minimum nonzero weight codewords of T 0,1,2,,n,2 n 1 is a 1(2 n, 2 n 1, (n + 2)(n + 1)/2) design when n 8 is even or n 1 is odd Proof: Note that all the minimum weight codewords of T 0,1,2,,n,2 n 1 must be of the form av i + bv j, where i j, a 0, and b 0, when n 8 is even or n 1 is odd Then this proposition can be proved similarly as Corollary 17 in [] 5 Using the codes for error detection Let C be a ternary [N, K, d] code The probability of undetected error when the code is used purely for error detection on a ternary symmetric channel is given by N ( p ) i(1 P ue (C, p) = A i (C) p) N i, 2 i=d 14
15 where p is the symbol error probability, see eg Kløve and Korzhik [9] In particular, P ue (C, 2/) = ( K 1)(1/) N < K N (8) The error probability threshold of C, introduced in Kløve [8], is defined by θ(c) = max { p [0, 2/] P ud (C, p) P ud (C, 2/) for all p [0, p ] } A code C is called good for error detection (in the technical sense) if and only if θ(c) = 2/ However, for practical applications the important things are that P ue (C, 2/) is small (that is, N K is large) and that θ(c) is above the range of actual values of p It is therefore of interest to estimate θ(c) It turns out that the performances on error detection of the codes described in this paper are very similar Therefore, we will only discuss C = C (1, n) in detail For this code we have N = 2 n, K = n + 1 and d = 2 n 1 Proposition 1 For all n 2 we have 1 < θ(c (1, n)) < 1 + n 2 n 2 Proof: First we note that for fixed p (0, 2/), the expression ( 2(1 p) )i decreases with increasing i Hence P ue (C, p) = (1 p) N N i=d < (1 p) N N = i=d ( p ) i A i (C) 2(1 p) ( p ) d A i (C) 2(1 p) ( p(1 p) ) N/2( K 1) 2 Further, we note that p(1 p) is increasing on the interval (0, 1/2) Hence, if p 1/, then ( P ue (C, p) P ue C, 1 ) ( 1 ) N/2( ( 1 N( ( < K 1) = 9 ) K 1) = P ue C, 2 ) p Hence θ(c) > 1 A direct calculation of θ(c) for n 9 gives the following values: n 2,, 4, θ(c) 2/ / + n/2 n > 2/
16 In particular, the upper bound is true for n 9 To prove the upper bound for n 10, we first note that A d (C) Let p be the root in the interval (0, 1/2) of the equation ( ) p(1 p) 2 n 1 = n, 2 2n that is Then p = 9 8 n/2n 1 P ue (C, p) A d ( p 2 ) 2 n 1(1 p) 2n 1 Hence Simple calculus shows that ( p(1 p) > 2 ) 2 n 1 = n+1 2n > P ue (C, 2/) θ(c) < p for 1 < x < 112 Hence for n x p < 1 + < log (x) n 2 n Proposition 1 shows that C (1, n) is good for practical error detection (even if it is not good in the technical sense) A similar proof shows that also the other codes have a threshold close to 1/ (for most n) Now, consider the dual codes Proposition 17 For all n 1 we have Proof: We have Let θ(c (1, n) ) < 18 n/4 P ue (C, 2/) = 2n n 1 1 2n < 1 n+1 p = 18 n/4 1
17 We have p < 2/ for n 4 By (4) we have for all n 1 P ue (C, p) P ue (C, 2/) ( p ) 4(1 > A 4 (C ) p) 2 n 4 n+1 2 = 24 ( ( 2 ) n ( ))(1 ) 2n 4 > 1 18 n/4 Proposition 17 shows that C (1, n) is not very useful for error detection except possibly for some very moderate values of n The upper bound on θ(c (1, n) ) can be improved by some factor by the same method, eg θ(c (1, n) ) < for n 28 18n/4 However, it is of less interest to determine precise bounds on θ(c (1, n) ) since it is very small in any case Concluding remarks The code T 1,2,,n,2 n 1 can not be equivalent to T 0,1,,n when n is odd This is because T 1,2,,n,2 n 1 has only even weights when n is odd, while T 0,1,,n has always one odd weight w(n + 1) The class of codes T 1,2,,n,2 n 1 described here have the same codeword length, dimension and minimum weight as the firstorder binary ReedMuller codes [1], [8], if and only if n is even However, their weight distributions are quite different The firstorder ReedMuller codes are twoweight codes, while T 1,2,,n,2 n 1 has many weights w(m) When n 1, the minimum weight of T 1,2,,n,2 n 1 is still 2 n 1 When n 8 is even or n 1 is odd, the ternary code T 0,1,2,,n,2 n 1 has length 2 n and minimum weight 2 n 1 But its dimension is n+2 So T 0,1,2,,n,2 n 1 is better than the firstorder binary ReedMuller code as the former has one more dimension while they have the same codeword length and minimum weight References [1] I F Blake and R C Mullin, The Mathematical Theory of Coding New York: Academic Press, 1975 [2] G T Bogdanova and I G Boukliev, New linear codes of dimension 5 over GF (), in Proc 4th Int Workshop on Algebraic and Combinatorial Coding Theory, 1994, pp
18 [] C Ding, D R Kohel and S Ling, Elementary 2group character codes, Preprint [4] C Ding, D R Kohel and S Ling, Secret sharing with a class of ternary codes, submitted manuscript, May 1999 [5] N Hamada, T Helleseth and Ø Ytrehus, The nonexistence of [51, 5, ; ] codes, Ars Combinatoria, Vol 25, pp 25 2, 199 [] R Hill and D E Newton, Some optimal ternary linear codes, Ars Combinatoria, Vol 25A, pp 1 72, 1988 [7] R Hill and D E Newton, Optimal ternary linear codes, Designs, Codes, and Cryptography, Vol 2, pp , 1992 [8] T Kløve, ReedMuller codes for error detection, the good, the bad, and the ugly, IEEE Trans Inform Theory, Vol 42, pp , 199 [9] T Kløve and V Korzhik, Error Detecting Codes, General Theory and their Application in Feedback Communication Systems Boston: Kluwer Acad Publ, 1995 [10] D E Knuth, The Art of Computer Programming, Vol 1, Second ed Reading: AddisonWesley, 197 [11] V S Pless and W C Huffman, Handbook of Coding Theory, Vol 1 Amsterdam: NorthHolland, 1998 [12] JP Serre, A Course in Arithmetic, Graduate Texts in Mathematics 7 New York: Springer, 197 [1] M van Eupen, Five new optimal ternary linear codes, IEEE Trans Inform Theory, Vol 40, No 1, p 19, 199 [14] M van Eupen, Four nonexistence results for ternary linear codes, IEEE Trans Inform Theory, Vol 41, No, pp , 1995 [15] M van Eupen, Some new results for ternary linear codes of dimension 5 and, IEEE Trans Inform Theory, Vol 41, No, pp , 1995 [1] M van Eupen and J H van Lint, On the minimum distance of ternary cyclic codes, IEEE Trans Inform Theory, Vol 9, No 2, pp ,
19 List of Tables 1 Weight distribution in T 1,2,,n,2 n 1 when n is even 7 2 Weight distribution in T 1,2,,n,2 n 1 when n is odd 8 Distribution of elements of GF () in u, where g := (m 1 2w) mod 10 4 The frequency distribution of the elements of GF () in u 10 5 The weight of u in Subcase I2 11 Weight distribution in T 0,1,2,,n,2 n 1 when n is even, where all a i and a are nonzero 1 7 Weight distribution in T 0,1,2,,n,2 n 1 when n is odd, where all a l and a are nonzero 1
SECRET sharing schemes were introduced by Blakley [5]
206 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 1, JANUARY 2006 Secret Sharing Schemes From Three Classes of Linear Codes Jin Yuan Cunsheng Ding, Senior Member, IEEE Abstract Secret sharing has
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLinear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.
Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a subvector space of V[n,q]. If the subspace of V[n,q]
More informationThe four [10,5,4] binary codes
1 Preliminaries The four [10,,] binary codes There are four distinct [10; ; ] binary codes. We shall prove this in a moderately elementary way, using the MacWilliams identities as the main tool. (For the
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationOn an algorithm for classification of binary selfdual codes with minimum distance four
Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory June 1521, 2012, Pomorie, Bulgaria pp. 105 110 On an algorithm for classification of binary selfdual codes with minimum
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationOn the representability of the biuniform matroid
On the representability of the biuniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every biuniform matroid is representable over all sufficiently large
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationINTRODUCTION TO CODING THEORY: BASIC CODES AND SHANNON S THEOREM
INTRODUCTION TO CODING THEORY: BASIC CODES AND SHANNON S THEOREM SIDDHARTHA BISWAS Abstract. Coding theory originated in the late 1940 s and took its roots in engineering. However, it has developed and
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 61, 013, Albena, Bulgaria pp. 15133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More information10. Graph Matrices Incidence Matrix
10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
More informationLinear Authentication Codes: Bounds and Constructions
866 IEEE TRANSACTIONS ON INFORMATION TNEORY, VOL 49, NO 4, APRIL 2003 Linear Authentication Codes: Bounds and Constructions Huaxiong Wang, Chaoping Xing, and Rei SafaviNaini Abstract In this paper, we
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationFacts About Eigenvalues
Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationMath 315: Linear Algebra Solutions to Midterm Exam I
Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =
More informationSeveral Classes of Codes and Sequences Derived From a 4 Valued Quadratic Form Nian Li, Xiaohu Tang, Member, IEEE, and Tor Helleseth, Fellow, IEEE
7618 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 11, NOVEMBER 2011 Several Classes of Codes Sequences Derived From a 4 Valued Quadratic Form Nian Li, Xiaohu Tang, Member, IEEE, Tor Helleseth,
More informationChapter 1. Search for Good Linear Codes in the Class of QuasiCyclic and Related Codes
Chapter 1 Search for Good Linear Codes in the Class of QuasiCyclic and Related Codes Nuh Aydin and Tsvetan Asamov Department of Mathematics, Kenyon College Gambier, OH, USA 43022 {aydinn,asamovt}@kenyon.edu
More informationDiagonal, Symmetric and Triangular Matrices
Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationAN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC
AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l4] on graphs and matroids I used definitions equivalent to the following.
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationCODING THEORY a first course. Henk C.A. van Tilborg
CODING THEORY a first course Henk C.A. van Tilborg Contents Contents Preface i iv 1 A communication system 1 1.1 Introduction 1 1.2 The channel 1 1.3 Shannon theory and codes 3 1.4 Problems 7 2 Linear
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More information1. R In this and the next section we are going to study the properties of sequences of real numbers.
+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationThe determinant of a skewsymmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14
4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with
More informationMATH 240 Fall, Chapter 1: Linear Equations and Matrices
MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS
More informationFACTORING PEAK POLYNOMIALS
FACTORING PEAK POLYNOMIALS SARA BILLEY, MATTHEW FAHRBACH, AND ALAN TALMAGE Abstract. Let S n be the symmetric group of permutations π = π 1 π 2 π n of {1, 2,..., n}. An index i of π is a peak if π i 1
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationOn Quantum Hamming Bound
On Quantum Hamming Bound Salah A. Aly Department of Computer Science, Texas A&M University, College Station, TX 778433112, USA Email: salah@cs.tamu.edu We prove quantum Hamming bound for stabilizer codes
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationResearch Article On the Rank of Elliptic Curves in Elementary Cubic Extensions
Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationAlgebraic Complexity Theory and Matrix Multiplication
Algebraic Complexity Theory and Matrix Multiplication [Handout for the Tutorial] François Le Gall Department of Computer Science Graduate School of Information Science and Technology The University of
More informationRecall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.
ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the ndimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationIntroduction to Algebraic Coding Theory
Introduction to Algebraic Coding Theory Supplementary material for Math 336 Cornell University Sarah A. Spence Contents 1 Introduction 1 2 Basics 2 2.1 Important code parameters..................... 4
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationPart V, Abstract Algebra CS131 Mathematics for Computer Scientists II Note 29 RINGS AND FIELDS
CS131 Part V, Abstract Algebra CS131 Mathematics for Computer Scientists II Note 29 RINGS AND FIELDS We now look at some algebraic structures which have more than one binary operation. Rings and fields
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationSolution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.
Solutions to Math 30 Takehome prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)
More informationVector Spaces II: Finite Dimensional Linear Algebra 1
John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition
More informationA Negative Result Concerning Explicit Matrices With The Restricted Isometry Property
A Negative Result Concerning Explicit Matrices With The Restricted Isometry Property Venkat Chandar March 1, 2008 Abstract In this note, we prove that matrices whose entries are all 0 or 1 cannot achieve
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More information4. MATRICES Matrices
4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationOn three zerosum Ramseytype problems
On three zerosum Ramseytype problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B
More informationLectures notes on orthogonal matrices (with exercises) 92.222  Linear Algebra II  Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222  Linear Algebra II  Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n realvalued matrix A is said to be an orthogonal
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationThe Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degreediameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
More informationCoding Theory Lecture Notes
Coding Theory Lecture Notes Nathan Kaplan and members of the tutorial September 7, 2011 These are the notes for the 2011 Summer Tutorial on Coding Theory. I have not gone through and given citations or
More informationLecture 11. Shuanglin Shao. October 2nd and 7th, 2013
Lecture 11 Shuanglin Shao October 2nd and 7th, 2013 Matrix determinants: addition. Determinants: multiplication. Adjoint of a matrix. Cramer s rule to solve a linear system. Recall that from the previous
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More information1.5 Elementary Matrices and a Method for Finding the Inverse
.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 1
AN INTRODUCTION TO ERROR CORRECTING CODES Part 1 Jack Keil Wolf ECE 154C Spring 2008 Noisy Communications Noise in a communications channel can cause errors in the transmission of binary digits. Transmit:
More informationIntroduction to Flocking {Stochastic Matrices}
Supelec EECI Graduate School in Control Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif sur  Yvette May 21, 2012 CRAIG REYNOLDS  1987 BOIDS The Lion King CRAIG REYNOLDS
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationSecure Network Coding on a Wiretap Network
IEEE TRANSACTIONS ON INFORMATION THEORY 1 Secure Network Coding on a Wiretap Network Ning Cai, Senior Member, IEEE, and Raymond W. Yeung, Fellow, IEEE Abstract In the paradigm of network coding, the nodes
More informationMODULAR ARITHMETIC KEITH CONRAD
MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 4. Gaussian Elimination In this part, our focus will be on the most basic method for solving linear algebraic systems, known as Gaussian Elimination in honor
More informationIntroduction to Linear Programming.
Chapter 1 Introduction to Linear Programming. This chapter introduces notations, terminologies and formulations of linear programming. Examples will be given to show how reallife problems can be modeled
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationLecture Notes: Matrix Inverse. 1 Inverse Definition
Lecture Notes: Matrix Inverse Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Inverse Definition We use I to represent identity matrices,
More informationDirect Methods for Solving Linear Systems. Matrix Factorization
Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011
More information(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map
22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find
More informationPermanents, Order Statistics, Outliers, and Robustness
Permanents, Order Statistics, Outliers, and Robustness N. BALAKRISHNAN Department of Mathematics and Statistics McMaster University Hamilton, Ontario, Canada L8S 4K bala@mcmaster.ca Received: November
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM
Acta Math. Univ. Comenianae Vol. LXXXI, (01), pp. 03 09 03 ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible
More informationTensors on a vector space
APPENDIX B Tensors on a vector space In this Appendix, we gather mathematical definitions and results pertaining to tensors. The purpose is mostly to introduce the modern, geometrical view on tensors,
More information4.6 Null Space, Column Space, Row Space
NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear
More information2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors
2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the
More informationON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
More informationCHANNEL. 1 Fast encoding of information. 2 Easy transmission of encoded messages. 3 Fast decoding of received messages.
CHAPTER : Basics of coding theory ABSTRACT Part I Basics of coding theory Coding theory  theory of error correcting codes  is one of the most interesting and applied part of mathematics and informatics.
More information