GROUP CODES WITH COMPLEX PERMUTATION GROUPS
|
|
- Gwendolyn Robinson
- 5 years ago
- Views:
Transcription
1 GROUP CODES WITH COMPLEX PERMUTATION GROUPS HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER In memory of Wes Peterson. Abstract. Group codes that use certain complex matrix groups are analyzed. These groups are complex analogues of the real Coxeter reflection groups. It is shown that some types of complex permutation groups have good properties for use in coding, while others do not. 1. Introduction Permutation group codes originated in unpublished memos of David Slepian in the 1950 s. These codes are derived by choosing a point on an n-dimensional sphere and acting on it with a group of operations consisting of permutations of the coordinates and reversals of the signs of coordinates. This work was published in 1965 [1], and soon extended by Slepian to include other groups of isometries [2]. See the survey of Ingemarsson [3] and Ericson [4] for some earlier work on group codes. The generalizations of permutation group codes developed thus far have concentrated on using real reflection groups (Coxeter groups), which have a well-understood structure and action. The 1996 paper of Mittelholzer and Lahtonen [5] is particularly comprehensive. These algorithms were refined recently by Fossorier, Nation and Peterson [6]. Real reflection groups act on the unit sphere in a real vector space R n. Wes Peterson was always curious to know what other groups might have an action that lends itself well to coding. This note extends the group codes using the real permutation groups A n, B n, D n to codes based on complex permutation groups G(r,k,n) acting on the unit sphere in C n. Some care is necessary with the modifications involved, and this led us to carry out an analysis of the desirable properties for a group coding scheme. It turns out that the groups G(r,1,n) have good coding properties, while the groups G(r,k,n) with k > 1 do not. 2. Description of the algorithm The outline of a general group coding algorithm is straightforward. The setup involves selecting a particular group G of isometries acting on a vector Date: January 5,
2 2 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER space V. Then find an appropriate sequence of subgroups {I} = G 0 < G 1 < G 2 < < G m = G and (left) coset leaders for consecutive pairs of subgroups, G k over G k 1, with I as the coset leader for G k 1. Then every element of G has a unique expression as a product of coset leaders, g = c m...c 1, with each c k a coset leader for G k over G k 1. This may be regarded as a sort of canonical form for group elements. Now choose an initial vector x 0 on the unit sphere in V. Let us assume that the group G acts faithfully on x 0, though there are some interesting codes where this is not the case. The code consists of Gx 0 = {gx 0 : g G}. One should also establish a correspondence between messages and group elements, γ : M G. The details of this correspondence do not concern us here, and indeed we can just regard the canonical expression of an element g as its message. All the above things appear as subroutines or parameters in the implementation, which goes thusly. The message m to be sent corresponds to a group element g = γ(m). The element g has a canonical expression g = c m...c 1 as a product of coset leaders. The vector x = g 1 x 0 = c c 1 m x 0 is then transmitted. The received vector has the form r = x + n where n represents channel noise. Hopefully, r will be close to x, i.e., the (euclidean) distance r x 0 will be small. Now decode by iteratively finding the sequence of coset leaders d 1,...,d m such that, for each k, the element h k = d k... d 1 minimizes the distance hr x 0 over all h G k. (This amounts to a greedy algorithm, and it only works for certain carefully selected groups and subgroup sequences.) Thus the final element g = d m...d 1 minimizes the distance hr x 0 over all h G. Then decode by taking the received message as m = γ 1 (g ). As in the case of real reflection groups, the subgroups G k in our sequence will be determined by specifying a set of generators for each. Given a group G, a subgroup H G, and a set X of generators for G, the coset leader graph Γ for G over H is formed as follows. The vertices of Γ are the (left) coset leaders for G over H. Let us assume that the coset leaders are chosen so that (1) the identity I is a coset leader, and (2) if v I is a coset leader, then there exist a generator a X and a coset leader u such that v = au. In Γ, there is a directed edge from u to v whenever v = au for some generator a. Label such an edge by a, so that the transformation v can be reconstructed by tracing a path from I to v and reading the edge labels in order. Such a path need not be unique. However, as shown for example in [6], by ordering the generators it is possible to identify a canonical path from I to each coset leader v, and this determines a spanning tree T in Γ. For the subgroup sequences in permutation groups considered here, the coset leader graphs
3 GROUP CODES WITH COMPLEX PERMUTATION GROUPS 3 for consecutive pairs of subgroups will be trees or cycles, and issues that arise in more complicated groups play no role. (See Property 4 below.) 3. Necessary and desirable properties Let us catalogue the properties that the group, subgroup sequence and initial vector should have in order for the group coding algorithm to work and/or work well. Some of the nice features of real reflection groups are not automatic here, so we procede carefully Basic assumptions. Concerning the group: G is a (finite) group of isometries acting on R n or C n Parameters at our disposal. These can be adjusted. The subgroup sequence. The initial vector x 0 with x 0 = 1. The sequence is not essential for coding, but rather a basic source of efficiency. The subgroup sequence and initial vector will be subjected to various conditions below. These parameters are related to the subgroup sequence and initial vector. Generating sets X for G and Y k for G k (so Y m = X). Coset leaders CL k for G k over G k 1. Neighbors N k (x 0 ) = {hx 0 : I h G k and hx 0 x 0 gx 0 x 0 whenever I g G k }. Let N(x 0 ) = N m (x 0 ). The corresponding group elements N k = {h G k : hx 0 N k (x 0 )} and N = {h G : hx 0 N(x 0 )}. Coset leader graphs Γ k. Spanning trees T k for Γ k. A branch order on each T k. The last three pertain to the details of decoding, as in [6] Initial vector property. The choice of the initial vector determines a lot of things, including the neighbor sets N k (x 0 ). The minimum distance d min of a group code is min g g gx 0 g x 0, or equivalently min g I gx 0 x 0. Property 1. The group should act faithfully on the initial vector, and it should be chosen so as to make the minimum distance large. Group coding can be done with isotropy subgroups that fix x 0. Let us avoid that complication, for now at least. Note that it is not necessary to maximize the minimum distance in order for the decoding to work, but rather desirable that it be large for the code to work better. Part of the point of using complex unitary groups is that it allows a larger minimum distance for the same dimension. A later section will deal with some of the difficulties attending the choice of the initial vector.
4 4 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER 3.4. Coset leaders. Given the subgroup sequence, we must choose the coset leaders, the coset leader graphs and their spanning trees. When the subgroup sequence is given in terms of its generating sets, there is a standard way to do this, as in [6]. The only modification is that, if the generators are not involutions, then we must allow their inverses into the scheme. The next property has already been mentioned. Property 2. The coset leaders for consecutive subgroups in the subgroup sequence should be chosen so that, for each k, (1) the identity I is in CL k, and (2) if v I is a coset leader, then there exist a generator a Y k and u CL k such that v = au or v = a 1 u Navigation. A crucial part of the decoding algorithm is to navigate through the coset leader trees Γ i for G i over G i 1. The next property, written generically, is to be applied to consecutive terms G i 1 G i of the subgroup sequence. Property 3. Let H G and let x be a vector such that x x 0 < hx x 0 whenever I h H. Then there is an efficient way to find a coset leader c such that cx x 0 < dx x 0 for all coset leaders d c. Generally speaking, one moves through the coset leader tree downward from its root at I, each step getting closer to the initial vector, ceasing when further steps take you further away again. It is desirable in a group code that gx 0 x 0 be roughly proportional to the (minimum) length of g as a word in generators and their inverses. However, we leave open the possibility that there are ways to improve the process. For example, one can shortcut the process for rotations, where the coset leader graph is a cycle. So the next property is superfluous for permutation groups, but it was definitely needed for the real exceptional reflection group case. Otherwise, decoding is done incorrectly. So let s keep it in the list. Within the spanning trees, a branch order should be given on the edges eminating from a each vertex v, to determine the order in which the successors of v will be considered. The branch orders must satisfy a technical property that is crucial to the decoding algorithm. Property 4. Let u and w be vertices in the coset leader graph Γ. If there is a path in Γ going from u to w, then the (unique) path from u to w in the spanning tree T goes through the successor of u that is least in the branch order and lies on some path from u to w Subgroup decoding property. Temporarily ignore noise, and let us find a condition to ensure that a received vector sufficiently close to g 1 x 0 will be decoded correctly. Recall that the fundamental decoding region of G is given by FDR = {x : x x 0 < gx x 0 for all g I}.
5 GROUP CODES WITH COMPLEX PERMUTATION GROUPS 5 These are the vectors that would decode to I. The vectors that would decode to g G are DR(g) = {x : x g 1 x 0 < hx g 1 x 0 for all h I} which is easily seen to satisfy DR(g) = g 1 (FDR). Our decoding procedure is a greedy algorithm, in that we start with a received vector r, and for each subgroup in the sequence we find the coset leader c i that moves c i 1...c 1 r as close to the initial vector x 0 as possible. Greedy algorithms don t always work. In order to assure that the algorithm actually finds the group element g that minimizes gr x 0, each consecutive pair of the subgroup sequence should have the following property. Property 5. Let H G and let x be a vector such that x x 0 < hx x 0 whenever I h H. Let c be a coset leader such that cx x 0 < dx x 0 for all coset leaders d c. Then cx x 0 < gx x 0 for all g G with g c. The alternative, of course, is that some element dhx with h I could be closer. Our basic argument goes thusly. Lemma 1. Let H G and assume that Property 5 holds. Let x be a vector such that x x 0 < gx x 0 whenever I g G, i.e., x is in the fundamental decoding region of G. Then for a coset leader c of G over H, cx x 0 < chx x 0 whenever I h H. In particular, when Property 5 holds, coset leaders do indeed give the closest codewords in their coset: cx 0 x 0 < chx 0 x 0 whenever I h H. Proof. Let xbe as in the lemma. Starting with c 1 x, find h H so that hc 1 x x 0 is minimized over all choices of h. Set y = hc 1 x, and find the coset leader d that minimizes dy x 0. By the property applied to y, we must have that dy x 0 < gx x 0 for all g G, so that dy = dhc 1 x is in the fundamental decoding region. As G acts faithfully on x 0, that implies dhc 1 = I, or dh = c. Since c and d are both coset leaders, we must have c = d and h = 1, as desired. Now let us apply this argument recursively to show that the greedy decoding process works properly when the error is small. Theorem 2. Assume that each consecutive pair in the subgroup sequence {I} = G 0 < G 1 < G 2 < < G m = G satisfies Property 5. Let g G be written as a product of coset leaders, g = c m...c 1. Let x be a vector in the decoding region DR(g). Recursively find coset leaders d k for G k over G k 1 such that d k...d 1 x x 0 is minimized over all choices of the coset leader d k. Then g = d m...d 1, and hence d j = c j for all j.
6 6 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER Proof. Inductively, by Lemma 1, d k...d 1 x x 0 < d k...d 1 hx x 0 whenever I h G k. Thus d m...d 1 x is in the fundamental decoding region of G, so that x decodes as d m...d 1. On the other hand, x DR(g) means by definition that x = g 1 y for some y FDR. As G acts faithfully, this implies g = d m...d Error control. Now consider what happens when the received vector is not in the decoding region DR(g). The nearest neighbors of a codeword u are the codewords v with u v = d min. Lemma 3. The nearest neighbors of g 1 x 0 are the codewords g 1 w with w a nearest neighbor of x 0. Thus the nearest neighbors of g 1 x 0 will be of the form g 1 bx 0 = (bg) 1 x 0 with b N. If a codeword g 1 x 0 is decoded incorrectly, it will most likely be decoded as a neighbor (bg) 1 x 0 with b N. To minimize the message error, we would like the canonical form of bg to differ as little as possible from that of g. That is the impact of the next two desirable properties for consecutive subgroups in the subgroup sequence (from [6]). In the real case, we had X a fundamental set of reflections, so that X = N. More generally, the generators for each subgroup were taken to be a fundamental set of reflections for that subgroup, so that Y k = N k. (This was not explained as well as could be there.) Lemma 1 says that neighbors will come from coset leaders, but in fact they should be generators and their inverses (cf. Property 2). Property 6. For each k, N k Y k Y 1 k. Note that this property depends not only on the group, but on the choice of the initial vector x 0. To minimize the effect of small decoding errors, we want this property for consecutive pairs of subgroups. Property 7. Let H G with fixed generating sets X for G and Y for H, respectively. Let b X X 1 and let c be a left coset leader for G over H. Then the coset leader for bch is either bc, or else it is c and c 1 bc is in Y Y 1. Note that ch = c(c 1 bc)h. This minimizes the effect of small errors. Theorem 4. Suppose that Property 7 holds for the consecutive pairs of a sequence {I} = G 0 < G 1 < < G m 1 < G m = G. If the canonical form of an element g as a product of coset leaders is c m...c 1, and b X X 1 with X the generating set for G, then the canonical form of bg is c m... c 1 where c i = c i for all but one i, and for that index c j is an immediate predecessor or successor of c j in the coset leader graph Γ j for G j over G j 1.
7 GROUP CODES WITH COMPLEX PERMUTATION GROUPS 7 4. Problems with the initial vector Mittelholzer and Lahtonen [5] gave an elegant and simple solution to the initial vector problem in the real case. Any unit vector in the fundamental region can be taken for the initial vector; some work better than others, and there is a straightforward algorithm to find the optimal choice. The geometry is different in the complex case, and this introduces some complications. In this section, we explore some of the difficulties. The relevant considerations for choosing x 0 are given in Properties 1, 5, 6, and to a lesser extent Property 3. A natural approach would be choose x 0 so as to maximize the minimum distance d min, and then hope that Properties 5 and 6 hold. For any particular group, it is straightforward to write a program to approximate initial vectors maximizing d min. First, one should make the following observations. Lemma 5. Let x 0 be a vector that maximizes d min. (1) If c = 1, then cx 0 also achieves the maximum d min, with the same group elements N. (2) If h G, then hx 0 also achieves the maximum d min, with the group elements hgh 1 for g N. The first part means that the first entry of x 0 may be taken to be real (or imaginary), which can be useful. Our numerical experiments began with the groups G(r, 1, 2) for various values of r. Immediately, things started to go wrong. Remember that x 0 determines the neighbors N(x 0 ), thence the corresponding group elements N. With the groups G(r,1,2), for any choice of x 0 that maximizes d min, there are six elements in N. Moreover, this includes elements g, h such that g, h and gh are all in N. On the other hand, there is no choice of x 0 whose neighbors contain the natural generating set s 1, s 2, t 2. None of this is consistent with any reasonable interpretation of Properties 5 and 6. Maximum values of d min are given in Table 1 for some of the groups G(r, 1, n) considered in Section 6. Under the circumstances, these should be regarded as an upper bound, not attainable for good codes. For the purposes of this paper, we will assume that x 0 is a real unit vector, and adjust the entries to make neighbors of a preferred set of generators. Then we check Property 5, and compare the minimum distance to the known upper bound. In the long run, this problem needs more investigation. 5. Real permutation groups Let us review the real permutation groups that have been used in group coding. These are finite groups of orthogonal matrices acting on the unit sphere of a real finite-dimensional vector space. The group A n is the group of all (n + 1) (n + 1) permutation matrices. Clearly this is isomorphic to the symmetric group on n + 1 letters, as its
8 8 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER Table 1. Maximum d min for some G(r,1,n) r n = 2 n = 3 n = elements act on a vector in R n+1 by permuting its entries. The group A n acts irreducibly on the n-dimensional subspace {x R n+1 : x i = 0}, whence the notation. The group B n consists of all n n matrices with exactly one nonzero entry in each row and column, that entry being ±1. The elements of B n act on a vector in R n by permuting the entries and changing some of the signs. The group D n is the subgroup of B n consisting of those matrices in B n with an even number of 1 s. Its elements act on a vector in R n by permuting the entries and changing an even number of signs. 6. A concrete example In this section, we apply the above program to the complex reflection groups G(r,1,n). These groups are wreath products, extensions of (Z/rZ) n by the symmetric group S n. Let ρ = e 2πi r. The matrix representation of G(r,1,n) acting on the complex space C n consists of all matrices with one non-zero entry in each row and column, that entry being a power of ρ. In particular, G(2,1,n) is the real Coxeter group B n. The group coding scheme for B n extends very naturally to G(r,1,n) with minimal changes and a straightforward encoding/decoding scheme. For a (redundant) set of generators, take the transformations s i (1 i n) that multiply the i-th entry of a vector by ρ, and the transpositions t j (2 j n) that switch the j-th and (j 1)-st components. Consider the nested sequence of subgroups, and associated coset leaders, given by the setup in Table 2. At the even steps, G 2k is obtained by adding adding a generator s j that commutes with the elements of G 2k 1. At the odd steps, G 2k+1 is obtained by adding adding a generator t j, and the relations t j s j t j = s j 1 make all but say s 1 redundant. The coset leader graphs for G(4,1,4) are given in Figure 1. At this point, we can check Properties 2, 4 and 7. The first two clearly hold, though we need to discuss the cyclic coset leader graphs; see below.
9 GROUP CODES WITH COMPLEX PERMUTATION GROUPS 9 Table 2. Subgroup sequence for G(r, 1, n) k Generators for G k Coset leaders for G k over G k 1 0 I 1 s 1 s j 1 for 0 j < r 2 s 1,s 2 s j 2 for 0 j < r 3 s 1,t 2 I,t 2 4 s 1,t 2,s 3 s j 3 for 0 j < r 5 s 1,t 2,t 3 I,t 3,t 2 t n 1 s 1,t 2,...,t n I,t j...t n for 2 j n Figure 1. Coset leader graphs for G(4,1,4) s 1 s 1 s 2 s 2 s 3 s 3 s 4 s 4 t 2 t 3 t 4 s 1 s 1 s 2 s 2 s 3 s 3 s 4 s 4 t 2 t 3 t 2 Verifying the third property is mechanical, using these relations: s r j = 1 t 2 j = 1 s i s j = s j s i (t j 1 t j ) 3 = 1 s j 1 t j = t j s j t i t j = t j t i if i j > 1 s j t j = t j s j 1 s i t j = t j s i if i j,j 1. Next comes the task of choosing an appropriate initial vector. The goal is to make the neighbors of x 0 to be its images under the natural generating set s 1,t 2,...,t n. This can be done by mimicking the optimal vector for the real group B n. Assume that x 0 is a real vector of the form and require that x 0 = a,a + b,a + 2b,...,a + (n 1)b s 1 x 0 x 0 = t 2 x 0 x 0 = = t n x 0 x 0. A straightforward computation that leads to the condition b a = 1 cos 2π r with the minimum distance being 2b. Initially we set a = 1, and then normalize so that x 0 = 1. Note that s i x 0 x 0 will be greater for i > 1.
10 10 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER Table 3. Actual d min obtained for some G(r,1,n) r n = 2 n = 3 n = With regard to Property 1, the group acts faithfully on this x 0, and the minimum distances it yields have the right order of magnitude. For example, For G(4,1,2), d min.63 versus a maximum possible of.82. For G(6,1,2), d min.51 versus a maximum possible of.59. For G(8,1,2), d min.42 versus a maximum possible of.46. For G(4,1,3), d min.38 versus a maximum possible of.54. For G(4,1,4), d min.26 versus a maximum possible of.43. Table 3 gives the values achieved for small values of r and n. In our current situation, Property 6 says that if g I,s 1,s 1 1 or some t j, then gx 0 x 0 2 > 2b 2. This distance squared is the sum of terms of the form ρ t (a + jb) (a + lb) 2 = [c (a + jb) (a + lb)] 2 + [s (a + jb)] 2 where ρ t = c + is. We want to show that if j = l and t 0, then this expression is at least 2b 2, while if j l then it is at least b 2. Two separate but easy calculations complete the argument (using c Re(ρ) < 1). Notice that the fundamental regions depend on the choice of the initial vector x 0. This is different from the real case. Consider for example the first case with H = s 1. Writing x = (x 1,...,x n ) and x 0 = (u 1,...,u n ), we have FR( s 1 ) = {x C n : s k 1x x 0 > x x 0 for 1 k < r} = {x C n : Re(x 1 u 1 ) > Re(ρ k x 1 u 1 ) for 1 k < r}. This justifies in part our standard choice of x 0 as indicated above. Now consider Property 3. The fact that, in the complex case, some of the generators are not transpositions introduces a minor change in the algorithm. The generators s i satisfy s r i = 1, and in terms of the algorithm one should regard s r 1 i = s 1 i as a coset leader of length one, as it will move the initial vector by the same distance that s i does. This means that in decoding a vector x, at the appropriate stage one should consider x x 0, s i x x 0 and s 1 i x x 0. If the first distance is a minimum, you consider the next subgroup. If the minimum is one of the latter two, then proceed around the cycle in that direction until you reach a minimum, at most halfway around. The halfway point, however, could be approached from either direction.
11 GROUP CODES WITH COMPLEX PERMUTATION GROUPS 11 In fact, in the middle of the next argument, we find a better way to navigate these cyclic graphs. Finally, we must verify Property 5. This does not require the particular initial vector chosen above, but let us assume that x 0 = (u 1,...,u n ) with 0 < u 1 < < u n real. Consider a vector x = (x 1,...,x n ) C n. An easy calculation shows that, for x C and 0 < u R, the value of k that minimizes ρ k x u is the one that maximizes the real part of ρ k x, independently of the size of u. N.B. The preceding observation can be used to speed up the algorithm considerably. Writing x = x e iθ, then ρ k x = x e (2πk r +θ)i, the real part of which is maximized by making 2πk r + θ as closed to 2π as possible. Thus k should be chosen as the nearest integer to r rθ 2π. Now consider the sequence x x 0 s k 1x x 0 s l 2s k 1x x 0 t δ 2 sl 2 sk 1 x x 0 s m 3 t δ 2s l 2s k 1x x 0 cs m 3 tδ 2 sl 2 sk 1 x x 0 where c is a coset leader for G 5 over G 4, thus one of {I,t 3,t 2 t 3 }. First k is chosen to maximize Re(ρ k x 1 ), then l to maximize Re(ρ l x 2 ). Now since u 1 < u 2, an easy calculation shows that if Re(ρ k x 1 ) > Re(ρ l x 2 ), then we should apply s 2, switching the values, to minimize the distance; otherwise not. Next m is chosen to maximize Re(ρ m x 3 ). Then, since u 1 < u 2 < u 3, we apply the correct coset leader c to put Re(ρ k x 1 ), Re(ρ l x 2 ), Re(ρ m x 3 ) into increasing order (insertion sort). Continue until pau G(r,k,n) For each divisor k of n, there is a subgroup G(r,k,n) of G(r,1,n). Recall that, in terms of the matrix representation, G(r,1,n) consists of all n n matrices with one non-zero entry in each row and column, the entry in the i-th row being say ρ a i. The subgroup G(r,k,n) consists of all such matrices with n i=1 a i = 0 mod k. For example, G(2,2,n) is the real Coxeter group D n. For a (redundant) set of generators, take the transformations w i = s k i for 1 i n that multiply the i-th entry of a vector by ρ k, the transformations v i for 2 i n that multiply the i 1-st entry by ρ 1 and the i-th entry by ρ, and
12 12 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER Table 4. Subgroup sequence for G(r,k,n) k Generators for G k Coset leaders for G k over G k 1 0 I 1 w 1 w j 1 for 0 j < r k 2 w 1,w 2 w j 2 for 0 j < r k 3 w 1,v 2 v j 2 for 0 j < k 4 w 1,v 2,t 2 I,t 2 5 w 1,v 2,t 2,w 3 w j 3 for 0 j < r k 6 w 1,v 2,t 2,v 3 v j 3 for 0 j < k 7 w 1,v 2,t 2,t 3 I,t 3,t 2 t the transpositions t j for 2 j n that switch the j-th and (j 1)-st components. In the case k = r, we have w i = I for all i, so these may be omitted. Table 4 gives a natural subgroup sequence for G(r,k,n). The relations w i 1 v k i = w i and t j 1 t j v j 1 t j t j 1 = v j make the generators w i for i > 1 and v j for j > 2 redundant in later subgroups. Here are the relations on the generators for G(r,k,n). w r k j = I v r i = I t 2 j = I v i v j = v j v i (t j 1 t j ) 3 = 1 t i t j = t j t i if i j > 1 w i t i = t i w i 1 w i t j = t j w i if i j,j 1 v i t i = t i vi 1 w i v j = v j w i t i v i+1 = v i+1 v i t i t i+1 v i = v i+1 v i t i+1. The initial value problem is thorny, and we can only scratch the surface. To begin, there are a couple of natural options for the choice of neighbors, and one or the other may not work for a given r and k. The first option is to design x 0 so that its neighbors are its images under w 1,t 2,...,t n. Proceeding exactly as when k = 1, we set and require that x 0 = a,a + b,a + 2b,...,a + (n 1)b w 1 x 0 x 0 = t 2 x 0 x 0 = = t n x 0 x 0. The same calculation yields b a = 1 c
13 GROUP CODES WITH COMPLEX PERMUTATION GROUPS 13 where now c = Re(ρ k ) = cos 2kπ r. The distance gx 0 x 0 remains 2b for g either w 1 or some t j. On the other hand, v 2 x 0 x 0 2 = 2(1 c)(2a 2 +2ab 2 b ) where c = cos 2π r, and sometimes this is less than 2b 2, making v 2 x 0 and v2 1 x 0 instead the nearest neighbors of x 0. For example, this is the case whenever k = 2 and r 14 is even. In those situations, the second method is preferable. The second option is to design x 0 so that its neighbors correspond to v 2,t 2,...,t n. Again taking the same form for x 0, we find that, for r 5, b a = 1 c + 1 c 2. c For r = 3 use b = ( 3 3)a, and for r = 4 either a = 0 or a = b, though for r = 4, k = 2 and a = 0 the action is not faithful. It is now the case that gx 0 x 0 = 2b for g either v 2 or some t j. Sometimes, though, w 1 x 0 x 0 will be smaller. For example, this happens with k = 2 and r = 6,8,10, 12, for which cases the first method should be used. In the midst of this chaos, we find that the two methods give the same values of a, b for r = 8, k = 4. Ths could be a case for further investigation. More generally, the initial vector problem should be looked at more closely for those groups that show potential for good coding in other respects, but for now we leave it. A more serious problem is that, even when the initial vector is not in dispute, the greedy decoding algorithm may not work. Here is a particularly bad example, one of many found numerically once we realized that the proof of Property 5 failed. Consider G(6,6,2). Since k = r, we should use the second method to find the initial vector, yielding x 0 = 0.259, Suppose that the received vector is r = 0.667, i so that r x 0 = The correct decoding is g = t 2 v 2 with t 2 v 2 r x 0 = But for every other group element h we have hr x , so the decoding process will never arrive at g = t 2 v 2. Indeed, it will yield I. A relatively minor concern, by comparison, is that relations such as t 2 v 3 = v 3 v 2 t 2 = v 3 t 2 v2 1 mean that Property 7 does not hold for G(r,k,n) with k > 1. Perhaps a different (complex?) initial vector, or a different subgroup sequence, could salvage the situation, but the current decoding scheme fails. A more relevant question is: Are any groups G(r,k,n) with k > 1 suitable for coding purposes? References [1] D. Slepian, Permutation modulation, Proc. IEEE 53 (1965), [2] D. Slepian, Group codes for the Gaussian channel, Bell Syst. Tech. J. 47 (1968),
14 14 HYE JUNG KIM, J. B. NATION AND ANNE SHEPLER [3] I. Ingemarsson, Group codes for the Gaussian channel, in Topics in Coding Theory (Lecture Notes in Control and Information Theory), vol. 128, New York, Springer- Verlag (1989), [4] T. Ericson, Permutation codes, Rapport de Recherche INRIA, no. 2109, Nov [5] T. Mittelholzer and J. Lahtonen, Group codes generated by finite reflection groups, IEEE Trans. on Information Theory, 42 (1996), [6] M. Fossorier, J. Nation and W. Peterson, Reflection group codes and their decoding, preprint Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA Department of Mathematics, University of North Texas, Denton, TX 76203, USA address:
Group Codes with Complex Reflection Groups
Group Codes with Complex Reflection Groups Hye Jung Kim, J.B. Nation and Anne Shepler University of Hawai i at Mānoa and University of North Texas Ashikaga, August 2010 Group Codes Recall the basic plan
Complex Reflection Group Coding
Complex Reflection Group Coding Hye Jung Kim Thesis Committee: Dr. J.B. Nation, Adviser Dr. Ralph Freese Graduate Committee: Dr. Michelle Manes Dr. Monique Chyba Dr. Robert Little 1 Acknowledgements I
THE SNOWFLAKE DECODING ALGORITHM
THE SNOWFLAKE DECODING ALGORITHM J. B. NATION AND CATHERINE WALKER Abstract. This paper describes an automated algorithm for generating a group code using any unitary group, initial vector, and generating
The Snowflake Decoding Algorithm
The Snowflake Decoding Algorithm December 0 Catherine Walker Thesis Committee: Dr. J.B. Nation Dr. Prasad Santhanam Graduate Committee: Dr. George Wilkens Dr. Monique Chyba Dr. Rufus Willett Dr. Mickael
Linear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 x + + a n 1 x n 1 + a n x n, where the coefficients a 0, a 1, a 2,,
Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014
Anna Dovzhik 1 Coding Theory: Linear-Error Correcting Codes Anna Dovzhik Math 420: Advanced Linear Algebra Spring 2014 Sharing data across channels, such as satellite, television, or compact disc, often
3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
MATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
MATH 433 Applied Algebra Lecture 22: Review for Exam 2.
MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric
Lecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
MATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Fall 2011 Instructor : Stefaan Delcroix Contents 1 Introduction to Error-Correcting Codes 3 2 Basic Concepts and Properties 6 2.1 Definitions....................................
MATH3302 Coding Theory Problem Set The following ISBN was received with a smudge. What is the missing digit? x9139 9
Problem Set 1 These questions are based on the material in Section 1: Introduction to coding theory. You do not need to submit your answers to any of these questions. 1. The following ISBN was received
Mathematics Department
Mathematics Department Matthew Pressland Room 7.355 V57 WT 27/8 Advanced Higher Mathematics for INFOTECH Exercise Sheet 2. Let C F 6 3 be the linear code defined by the generator matrix G = 2 2 (a) Find
Introduction to Group Theory
Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)
MATH 291T CODING THEORY
California State University, Fresno MATH 291T CODING THEORY Spring 2009 Instructor : Stefaan Delcroix Chapter 1 Introduction to Error-Correcting Codes It happens quite often that a message becomes corrupt
[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
Vector spaces. EE 387, Notes 8, Handout #12
Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is
This research was partially supported by the Faculty Research and Development Fund of the University of North Carolina at Wilmington
LARGE SCALE GEOMETRIC PROGRAMMING: AN APPLICATION IN CODING THEORY Yaw O. Chang and John K. Karlof Mathematical Sciences Department The University of North Carolina at Wilmington This research was partially
Efficient Decoding of Permutation Codes Obtained from Distance Preserving Maps
2012 IEEE International Symposium on Information Theory Proceedings Efficient Decoding of Permutation Codes Obtained from Distance Preserving Maps Yeow Meng Chee and Punarbasu Purkayastha Division of Mathematical
Algebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
MATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
MATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
GENERATING 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
Outline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
Linear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x f(x) = q(x)h(x) + r(x),
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 + + a n 1 x n 1 + a n x n, where the coefficients a 1, a 2,, a n are
Lecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
is an isomorphism, and V = U W. Proof. Let u 1,..., u m be a basis of U, and add linearly independent
Lecture 4. G-Modules PCMI Summer 2015 Undergraduate Lectures on Flag Varieties Lecture 4. The categories of G-modules, mostly for finite groups, and a recipe for finding every irreducible G-module of a
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element
32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
Chapter 7. Error Control Coding. 7.1 Historical background. Mikael Olofsson 2005
Chapter 7 Error Control Coding Mikael Olofsson 2005 We have seen in Chapters 4 through 6 how digital modulation can be used to control error probabilities. This gives us a digital channel that in each
Lecture 10: A (Brief) Introduction to Group Theory (See Chapter 3.13 in Boas, 3rd Edition)
Lecture 0: A (Brief) Introduction to Group heory (See Chapter 3.3 in Boas, 3rd Edition) Having gained some new experience with matrices, which provide us with representations of groups, and because symmetries
Longest element of a finite Coxeter group
Longest element of a finite Coxeter group September 10, 2015 Here we draw together some well-known properties of the (unique) longest element w in a finite Coxeter group W, with reference to theorems and
Representing Group Codes as Permutation Codes
Representing Group Codes as Permutation Codes Ezio Biglieri John K. Karlof Emanuele Viterbo November 19, 001 Abstract Given an abstract group G, an N dimensional orthogonal matrix representation G of G,
Codes over Subfields. Chapter Basics
Chapter 7 Codes over Subfields In Chapter 6 we looked at various general methods for constructing new codes from old codes. Here we concentrate on two more specialized techniques that result from writing
Chapter 2. Error Correcting Codes. 2.1 Basic Notions
Chapter 2 Error Correcting Codes The identification number schemes we discussed in the previous chapter give us the ability to determine if an error has been made in recording or transmitting information.
CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works
CS68: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant April 20, 206 Introduction Last lecture introduced the idea of principal components analysis (PCA). The
Lecture 2: Mutually Orthogonal Latin Squares and Finite Fields
Latin Squares Instructor: Padraic Bartlett Lecture 2: Mutually Orthogonal Latin Squares and Finite Fields Week 2 Mathcamp 2012 Before we start this lecture, try solving the following problem: Question
LECTURES MATH370-08C
LECTURES MATH370-08C A.A.KIRILLOV 1. Groups 1.1. Abstract groups versus transformation groups. An abstract group is a collection G of elements with a multiplication rule for them, i.e. a map: G G G : (g
Divide and Conquer. Maximum/minimum. Median finding. CS125 Lecture 4 Fall 2016
CS125 Lecture 4 Fall 2016 Divide and Conquer We have seen one general paradigm for finding algorithms: the greedy approach. We now consider another general paradigm, known as divide and conquer. We have
A connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
Linear Programming Redux
Linear Programming Redux Jim Bremer May 12, 2008 The purpose of these notes is to review the basics of linear programming and the simplex method in a clear, concise, and comprehensive way. The book contains
Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural
Notes 10: Public-key cryptography
MTH6115 Cryptography Notes 10: Public-key cryptography In this section we look at two other schemes that have been proposed for publickey ciphers. The first is interesting because it was the earliest such
CS168: The Modern Algorithmic Toolbox Lecture #8: PCA and the Power Iteration Method
CS168: The Modern Algorithmic Toolbox Lecture #8: PCA and the Power Iteration Method Tim Roughgarden & Gregory Valiant April 15, 015 This lecture began with an extended recap of Lecture 7. Recall that
New Trellis Codes Based on Lattices and Cosets *
New Trellis Codes Based on Lattices and Cosets * A. R. Calderbank and N. J. A. Sloane Mathematical Sciences Research Center AT&T Bell Laboratories Murray Hill, NJ 07974 ABSTRACT A new technique is proposed
= W z1 + W z2 and W z1 z 2
Math 44 Fall 06 homework page Math 44 Fall 06 Darij Grinberg: homework set 8 due: Wed, 4 Dec 06 [Thanks to Hannah Brand for parts of the solutions] Exercise Recall that we defined the multiplication of
FINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
Representation Theory
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section II 19I 93 (a) Define the derived subgroup, G, of a finite group G. Show that if χ is a linear character
Eves Equihoop, The Card Game SET, and Abstract SET
Eves Equihoop, The Card Game SET, and Abstract SET Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 83,
The Symmetric Groups
Chapter 7 The Symmetric Groups 7. Introduction In the investigation of finite groups the symmetric groups play an important role. Often we are able to achieve a better understanding of a group if we can
Solutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
The Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
[06.1] Given a 3-by-3 matrix M with integer entries, find A, B integer 3-by-3 matrices with determinant ±1 such that AMB is diagonal.
(January 14, 2009) [06.1] Given a 3-by-3 matrix M with integer entries, find A, B integer 3-by-3 matrices with determinant ±1 such that AMB is diagonal. Let s give an algorithmic, rather than existential,
Math 4242 Fall 2016 (Darij Grinberg): homework set 8 due: Wed, 14 Dec b a. Here is the algorithm for diagonalizing a matrix we did in class:
Math 4242 Fall 206 homework page Math 4242 Fall 206 Darij Grinberg: homework set 8 due: Wed, 4 Dec 206 Exercise Recall that we defined the multiplication of complex numbers by the rule a, b a 2, b 2 =
Singular Value Decomposition
Chapter 5 Singular Value Decomposition We now reach an important Chapter in this course concerned with the Singular Value Decomposition of a matrix A. SVD, as it is commonly referred to, is one of the
Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
And for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras
Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 6 Postulates of Quantum Mechanics II (Refer Slide Time: 00:07) In my last lecture,
9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise
9 THEORY OF CODES Chapter 9 Theory of Codes After studying this chapter you should understand what is meant by noise, error detection and correction; be able to find and use the Hamming distance for a
Representation Theory. Ricky Roy Math 434 University of Puget Sound
Representation Theory Ricky Roy Math 434 University of Puget Sound May 2, 2010 Introduction In our study of group theory, we set out to classify all distinct groups of a given order up to isomorphism.
arxiv: v1 [cs.it] 17 Sep 2015
A heuristic approach for designing cyclic group codes arxiv:1509.05454v1 [cs.it] 17 Sep 2015 João E. Strapasson and Cristiano Torezzan School of Applied Sciences - University of Campinas, SP,Brazil. October
Problem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem
Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem 1 Fourier Analysis, a review We ll begin with a short review of simple facts about Fourier analysis, before going on to interpret
CANONICAL LOSSLESS STATE-SPACE SYSTEMS: STAIRCASE FORMS AND THE SCHUR ALGORITHM
CANONICAL LOSSLESS STATE-SPACE SYSTEMS: STAIRCASE FORMS AND THE SCHUR ALGORITHM Ralf L.M. Peeters Bernard Hanzon Martine Olivi Dept. Mathematics, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht,
Algebraic Codes for Error Control
little -at- mathcs -dot- holycross -dot- edu Department of Mathematics and Computer Science College of the Holy Cross SACNAS National Conference An Abstract Look at Algebra October 16, 2009 Outline Coding
Weaknesses of Margulis and Ramanujan Margulis Low-Density Parity-Check Codes
Electronic Notes in Theoretical Computer Science 74 (2003) URL: http://www.elsevier.nl/locate/entcs/volume74.html 8 pages Weaknesses of Margulis and Ramanujan Margulis Low-Density Parity-Check Codes David
A practical method for enumerating cosets of a finite abstract group
A practical method for enumerating cosets of a finite abstract group By J. A. ODD (University of Manchester), and H.. M. COXBEB (University of Cambridge). (Received nd January,. Mead th February,.) Introduction.
Error control of line codes generated by finite Coxeter groups
Error control of line codes generated by finite Coxeter groups Ezio Biglieri Universitat Pompeu Fabra, Barcelona, Spain Email: e.biglieri@ieee.org Emanuele Viterbo Monash University, Melbourne, Australia
The Gelfand-Tsetlin Basis (Too Many Direct Sums, and Also a Graph)
The Gelfand-Tsetlin Basis (Too Many Direct Sums, and Also a Graph) David Grabovsky June 13, 2018 Abstract The symmetric groups S n, consisting of all permutations on a set of n elements, naturally contain
Transposition as a permutation: a tale of group actions and modular arithmetic
Transposition as a permutation: a tale of group actions and modular arithmetic Jeff Hooper Franklin Mendivil Department of Mathematics and Statistics Acadia University Abstract Converting a matrix from
Average Case Analysis of QuickSort and Insertion Tree Height using Incompressibility
Average Case Analysis of QuickSort and Insertion Tree Height using Incompressibility Tao Jiang, Ming Li, Brendan Lucier September 26, 2005 Abstract In this paper we study the Kolmogorov Complexity of a
Groups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
Getting Started with Communications Engineering
1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we
ERROR CORRECTING CODES
ERROR CORRECTING CODES To send a message of 0 s and 1 s from my computer on Earth to Mr. Spock s computer on the planet Vulcan we use codes which include redundancy to correct errors. n q Definition. A
6 Permutations Very little of this section comes from PJE.
6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action
THIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to odd-numbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
Monotone Hamiltonian paths in the Boolean lattice of subsets
Monotone Hamiltonian paths in the Boolean lattice of subsets Csaba Biró and David Howard December 10, 2007 Abstract Consider the lattice whose elements are the subsets of the set of positive integers not
SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear Algebra
1.1. Introduction SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 1 Introduction to Linear algebra is a specific branch of mathematics dealing with the study of vectors, vector spaces with functions that
REPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
Lecture 6 Positive Definite Matrices
Linear Algebra Lecture 6 Positive Definite Matrices Prof. Chun-Hung Liu Dept. of Electrical and Computer Engineering National Chiao Tung University Spring 2017 2017/6/8 Lecture 6: Positive Definite Matrices
6 Cosets & Factor Groups
6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.
Generator Matrix. Theorem 6: If the generator polynomial g(x) of C has degree n-k then C is an [n,k]-cyclic code. If g(x) = a 0. a 1 a n k 1.
Cyclic Codes II Generator Matrix We would now like to consider how the ideas we have previously discussed for linear codes are interpreted in this polynomial version of cyclic codes. Theorem 6: If the
Extended 1-perfect additive codes
Extended 1-perfect additive codes J.Borges, K.T.Phelps, J.Rifà 7/05/2002 Abstract A binary extended 1-perfect code of length n + 1 = 2 t is additive if it is a subgroup of Z α 2 Zβ 4. The punctured code
0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
REPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
Section III.15. Factor-Group Computations and Simple Groups
III.15 Factor-Group Computations 1 Section III.15. Factor-Group Computations and Simple Groups Note. In this section, we try to extract information about a group G by considering properties of the factor
Algebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.
ACTING FREELY GABRIEL GASTER
ACTING FREELY GABRIEL GASTER 1. Preface This article is intended to present a combinatorial proof of Schreier s Theorem, that subgroups of free groups are free. While a one line proof exists using the
CMU CS 462/662 (INTRO TO COMPUTER GRAPHICS) HOMEWORK 0.0 MATH REVIEW/PREVIEW LINEAR ALGEBRA
CMU CS 462/662 (INTRO TO COMPUTER GRAPHICS) HOMEWORK 0.0 MATH REVIEW/PREVIEW LINEAR ALGEBRA Andrew ID: ljelenak August 25, 2018 This assignment reviews basic mathematical tools you will use throughout
A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations
A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations James A. Muir School of Computer Science Carleton University, Ottawa, Canada http://www.scs.carleton.ca/ jamuir 23 October
Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field