MDS Array Codes for Correcting a Single Criss-Cross Error
|
|
- Jasmine Sims
- 5 years ago
- Views:
Transcription
1 1068 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 MDS Array Codes for Correctng a Sngle Crss-Cross Error Maro Blaum, Fellow, IEEE, and Jehoshua Bruck, Senor Member, IEEE Abstract We present a famly of Maxmum-Dstance Separable (MDS) array codes of sze ( 1) ( 1), a prme number, and mnmum crss-cross dstance 3,.e., the code s capable of correctng any row or column n error, wthout a pror knowledge of what type of error occurred. The complexty of the encodng and decodng algorthms s lower than that of known codes wth the same error-correctng power, snce our algorthms are based on exclusve OR operatons over lnes of dfferent slopes, as opposed to algebrac operatons over a fnte feld. We also provde effcent encodng and decodng algorthms for errors and erasures. Index Terms Array codes, crss-cross errors, error-correctng codes, MDS codes, rank errors. I. INTRODUCTION In ths correspondence we descrbe two-dmensonal array codes that can correct errors gven by ether a row or a column n error (wthout a pror knowledge of whch one occurred). There exst codes that can do so. Moreover, the known codes are stronger n the sense that they can correct the rank of an array. The dea of usng the rank as a metrc comes from Delsarte [4]. See also Gabduln [6] and Roth [12] [14]. However, these constructons are based on fnte-feld arthmetc, as Reed Solomon codes. Therefore, for very large arrays, they may become mpractcal, snce they may need a very large lookup table. In ths correspondence, we wll present array codes that have the same error-correctng capablty n terms of rows and columns (although sometmes they cannot correct the rank) as the ones n [4], [6], and [12], but they have less complexty. The new codes are based on smple party along lnes of dfferent slopes, n the sprt of [3]. There are applcatons n whch nformaton bts are stored n n 2 n bt arrays. The error patterns are such that all corrupted bts are confned to at most some prespecfed number t of rows or columns (or both). We wll refer to such errors as crss-cross errors. Crss-cross errors can be found n memory chp arrays, where row or column falures occur due to the malfunctonng of row drvers, or column amplfers (see, for nstance [5], [8], and [9]). Another applcaton of codes correctng crss-cross errors occurs n multtrack magnetc tapes, where the errors usually occur along the tracks, whereas the nformaton unts (bytes) are recorded across the tracks. Computaton of check bts s equvalent to decodng of erasures at the check bt locatons, and n ths case these erasures are perpendcular to the erroneous tracks. There exst codes for multtrack magnetc recordng [2], [10], [11]. We need some defntons. Let E [e j ] n01 ; be an n 2 n matrx over a feld F.Acover of E s a par (X; Y ) of sets X; Y f0; 1; 111;n 0 1g, such that e j 6 0 ) (( 2 X) or (j 2 Y )) for all 0 ; j n 0 1. The sze of a cover (X; Y ) s defned Manuscrpt receved March 29, 1998; revsed August 6, Ths work was supported n part by an IBM Unversty Partnershp Award, an NSF Young Investgator Award CCR , and by a Sloan Research Fellowshp. The materal n ths correspondence was presented n part at the IEEE Internatonal Symposum on Informaton Theory, Ulm, Germany, M. Blaum s wth IBM Research Dvson, Almaden Research Center, San Jose, CA USA (e-mal: blaum@almaden.bm.com). J. Bruck s wth the Calforna Insttute of Technology, Mal Stop , Pasadena, CA USA (e-mal: bruck@paradse.caltech.edu). Communcated by E. Soljann, Assocate Edtor for Codng Technques. Publsher Item Identfer S (00) by j(x; Y )j jxj + jy j. The crss-cross weght of E, denoted by w(e), s the mnmum sze j(x; Y )j over all possble covers (X; Y ) of E. Note that a mnmum-sze cover of a gven matrx E s not always unque. The rank of E over F s never greater than ts crss-cross weght. A well-known result by Köng (see [7, Theorem 5.1.4]) states that the mnmum sze of a cover of a f0; 1g-matrx s equal to the maxmum number of 1's that can be chosen n that matrx wth no two on the same row of column. The crss-cross dstance d(a; B) between two n 2 n matrces A and B over F s defned by d(a; B) w(a 0 B): Example 1.1: Consder the array E over GF (2). It s easy to verfy that E has two covers of sze 3, namely, (f0; 2g; f1g) and (f2g; f0; 1g). Furthermore, snce the three nonzero elements on the man dagonal of E belong to dstnct rows and columns, the crss-cross weght of E must be at least 3. Therefore, w(e) 3. Let 0[c n01 j] ; be an n 2 n matrx over F, denotng the correct array to be stored, and let 0 8 E denote the array actually recorded, wth E [e j ] n01 ; standng for the error array. The crss-cross error model assumes that w(e) t for some prespecfed t. An [n 2 n; k; d] lnear array code C over a feld F s a k-dmensonal lnear space of n 2 n matrces over F wth d beng the mnmum of all crss-cross dstances between pars of dstnct matrces n C. Adoptng the termnology of conventonal lnear codes, we call d the mnmum crss-cross dstance of C. As wth regular block codes, d equals the mnmum crss-cross weght of any nonzero matrx n C. An [n 2 n; k; d] array code C can correct any pattern of s crss-cross errors together wth t crss-cross erasures f and only f 2s + t d01. The proof s agan dentcal to the proof for block codes. In ths correspondence, we present array codes wth mnmum crsscross dstance d 3. The constructons n [4], [6], and [12] operate over a feld GF (2 n ). When n s a large number, lke n holographc storage applcatons, the resultng complexty may be prohbtve. Thus we want to construct codes wth low complexty but stll havng mnmum crss-cross dstance 3. To ths end, we wll consder codes over the rng of polynomals modulo 1+x + x x, p a prme number, as n [3]. We have the followng verson of the Sngleton bound [12]. Theorem 1.1: For any [n 2 n; k; d] array code over a feld F k n(n 0 d +1): Codes meetng the Sngleton bound are called Maxmum-Dstance Separable (MDS). In the next secton, we wll construct [(p 0 1) 2 (p 0 1); (p 0 1)(p 0 3); 3] array codes, p a prme number. Accordng to Theorem 1.1, these codes are MDS. In Secton III, we prove the man propertes of the codes, /00$ IEEE
2 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY manly, the condtons under whch they are MDS wth respect to the crss-cross dstance. We also show that, n general, our crss-cross dstance s not equvalent to the rank dstance, as wth the codes n [4], [6], and [12]. We also brefly dscuss possble generalzatons to multple partes. In Secton IV we present effcent decodng algorthms n the case of errors and erasures. We end the correspondence by drawng some conclusons. II. CONSTRUCTION OF THE CODES We gve two descrptons of the codes, one algebrac, the other geometrc. In the sequel, p denotes a prme number and l a number such that 2 l p 0 2. Let us start wth the algebrac descrpton. The entres of the elements of the code are polynomals modulo 1+x+111+x. Let be a root of 1+x x and, moreover, assume that 1+x x s the mnmal polynomal of. Then, a party-check matrx of code C(p; l) s gven by H(p; l) l 2l 111 ()l : (1) Now, assume that where (c 0();c 1(); 111;c ()) 2C(p; l) c j () c j : The codewords may be nterpreted as (p 0 1) 2 (p 0 1) arrays (c j) 0;j such that each symbol n a codeword s gven by a column n the array. We denote by C(p; l) the bnary code of (p 0 1) 2 (p 0 1) arrays derved from C(p; l). Normally, and n order to smplfy notaton, we wll add an magnary 0-row and an magnary 0-column to the arrays n C(p; l). So, the codewords may be nterpreted as p 2 p arrays (c j ) 0;j, such that c ;j c ; 0 for 0 ; j p 0 1. Also, from now on, we take all the subndces modulo p. We apologze for ths abuse, but the notaton s somewhat awkward f we want to denote the modulo p subndces every tme. We wll see that a geometrc nterpretaton of code C(p; l) as derved from code C(p; l) defned by (1), s as the set of arrays havng ether even or odd party along lnes of slope 1 and l. Ths wll be made clear by the followng lemma. Lemma 2.1: Vector (c 0();c 1(); 111;c ()) belongs n C(p; l), where c j () f and only f, for each 0 p 0 1 where b 2 GF (2). c j c 0j;j b (2) c 0lj;j b; (3) The geometrc meanng of (2) and (3) s the followng: we have party n the array along lnes of slope 1 and l, respectvely. Ths party can be ether even or odd: t s even when b 0, and odd when b 1. Before provng Lemma 2.1, let us gve an example. Example 2.1: Let us consder p 5and l 2,.e., code C(5; 2) or C(5; 2) as bnary arrays. Accordng to (1), a party-check matrx of the code s gven by H(5; 2) where Now, consder the followng codeword n C(5; 2): c() ( + 3 ; ; ; ): The reader can easly verfy that c()(h(5; 2)) T 0(H T denotes the transpose matrx of H), therefore, c() 2C(5; 2). Wrtng c() as the array n C(5; 2) n whch the columns correspond to the entres of c(), we obtan (remember that we are addng an extra 0-row and an extra 0-column) The reader can verfy that we have odd party along the lnes of slope 1 and of slope 2, as predcted by (2) and (3). We are ready now to prove Lemma 2.1. Proof of Lemma 2.1: Remember that a 0-row and a 0-column have been added to the (c ;j) array,.e., c ;j 0and c ; 0.If c() (c 0 ();c 1 (); 111;c ()) 2C(p; l) takng the nner product of c() wth the second row of H(p; l) and rememberng that the subndces are taken modulo p, we obtan 0 c j () lj t0 +ljt t0 c ;j c ;j +lj c ;j lj t c t0lj;j t (4) where (4) s obtaned usng the fact that p 1and groupng together the terms correspondng to the same power t, 0 t p 0 1. Reducng modulo t0 c t0lj;j t 0
3 1070 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 f and only f c t0lj;j b l ; b l 2 GF (2) for each 0 t p 0 1, whch nearly concdes wth (3). Smlarly, by repeatng ths procedure wth l 1, we obtan c t0j;j b 1 ; b 1 2 GF (2) for each 0 t p 0 1, whch nearly concdes wth (2). In order to complete the proof, we need to show that b 1 b l. Notce that, takng the XOR of all the elements n the array n two dfferent ways, we obtan completng the proof. b 1 pb 1 t0 t0 pb l b l ; c t0j;j c t0lj;j We next consder a code C 0 (p; l) whose elements are the transposes of the arrays n C(p; l). The followng lemma connects the two codes. Lemma 2.2: Consder the code C(p; l) of bnary () 2() arrays defned by (2) and (3), and let C 0 (p; l) be the code whose elements are the transposes of the elements n C(p; l). Then, C 0 (p; l) C(p; 1l),.e., the arrays n C 0 (p; l) have even or odd party along lnes of slope 1 and 1l. Algebracally, a party-check matrx for the correspondng code C 0 (p; l) s gven by H 0 (p; l) (5) 1 1l 2l 111 ()l Proof: Let (c ;j) 2 C(p; l) and (c;j) 0 2 C 0 (p; l) such that c 0 ;j c j;. Accordng to (4) and Lemma 2.1 +ljt c ;j b; b 2 GF (2); for 0 t p 0 1: Dvdng the subndces by l, ths occurs f and only f j+(l)tl f and only f j+(l)t c ;j b; b 2 GF (2); for 0 t p 0 1 c ;j b; b 2 GF (2); for 0 t p 0 1 snce dvdng by l each 0 t p 0 1 s a 1-1 functon. Ths occurs f and only f f and only f c ;t0(l) b; b 2 GF (2); for 0 t p 0 1 c 0 t0(l); b; b 2 GF (2); for 0 t p 0 1: By Lemma 2.1, (c 0 ;j) 2 C(p; 1l) and the party-check matrx correspondng to C 0 (p; l) s gven by (5). The next example llustrates Lemma 2.2. Example 2.2: Consder code C(5; 2) as n Example 2.1. Accordng to Lemma 2.2, snce 12 3modulo5, a party-check matrx of the code C 0 (5; 2) s gven by H 0 (5; 2) : The transpose of the array gven n Example 2.1 s We can see that the array above has odd party along lnes of slope 1 and 3. An easy observaton s, code C(p; l) s MDS,.e., f we erase any two columns n an array (c ;j ) 2 C(p; l), regardng these two columns as elements modulo 1+x x, they wll be recovered by the code. Of course, the same s true for the correspondng code C 0 (p; l) n whch we dentfy the rows of the arrays wth elements modulo 1+ x x : any par of erased rows wll be recovered. Let us prove these facts n the next lemma. Lemma 2.3: Code C(p; l) s MDS. Proof: We have to show that any two columns n H(p; l) are lnearly ndependent,.e., any determnant n H(p; l) as gven by (1) s nvertble. Notce that det j +lj + j+l l lj j+l (l01)(j0) +1 ; and snce 1 l 0 1 p 0 3 and 1 j 0 p 0 2, (l 0 1)(j 0 ) 6 0 (mod p), and (l01)(j0) 61. Moreover, gcd(x t (x s +1); 1+x x )1; for s 6 0 (mod p) [3], thus j+l ( (l01)(j0) +1)s nvertble. However, our goal s to show that the bnary code C(p; l) of (p 0 1) 2 (p 0 1) arrays s MDS wth respect to the crss-cross dstance. To ths end, we have to show that any erased row together wth any erased column wll be unquely recovered. Ths wll not happen for every code C(p; l). Actually, t wll occur f and only f l s prmtve n GF (p),.e., the powers of l generate all the nonzero elements n GF (p). For nstance, 2 s prmtve n GF (5), but not n GF (7). However, 3 s prmtve n GF (7). Thus C(7; 2) s not MDS wth respect to the crss-cross dstance, but C(7; 3) s. We wll prove these propertes n the next secton. III. MAIN PROPERTIES Before provng our man theorem, let us gve some examples of codes C(p; l) for whch 2 s not prmtve n GF (p).
4 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY Example 3.1: Consder the followng array n C(7; 2) (to whch a 0-row and a 0-column have been added): We can see that the array above has even party on lnes of slope 1 and 2, therefore, t belongs n C(7; 2). Ths array has crss-cross weght 2,soC(7;2) s not MDS wth respect to the crss-cross dstance. Example 3.2: Consder the array n C(17;2) (to whch a 0-row and a 0-column have been added) shown at the top of ths page. As n Example 3.1, we can see that the array above has even party on lnes of slope 1 and 2, therefore, t belongs n C(17;2). Ths array has crss-cross weght 2, soc(17;2) s not MDS wth respect to the crss-cross dstance. Notce that 2 s not prmtve nether n GF (7) nor n GF (17). The next theorem s our man result. Its proof s based on the generalzaton of Examples 3.1 and 3.2. Moreover, we'll refer to these two examples n the proof as an llustraton. Theorem 3.1: Code C(p; l) has mnmum crss-cross dstance 3 f and only f l s prmtve n GF (p). Proof: )) Assume that l s not prmtve n GF (p). We wll exhbt an array wth a cover of sze 2. Consder the set S(p; l) f1 l 0 ;l
5 1072 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 l 1 ;l 2 ; 111;l s01 g such that these powers are taken modulo p and l s 1. Snce l s not prmtve n GF (p); S(p; l) 6 GF (p) 0f0g. There are two cases: p S(p; l) and p S(p; l). We defne a set U 6 ; as follows: U S(p; l); f p S(p; l) U GF (p) 0 S(p; l) 0f0g; f p S(p; l): Next, consder the array (c ;j ) 0;j of crss-cross weght 2 such that c ;0 1; f 2 U c 0;j 1; f j 2 U c ;j 0; elsewhere. As an example of the case p S(p; l), consder p 7and l 2. Then, S(7; 2) U f1; 2; 4g (notce that 6 62 S(7; 2)). The array (c ;j) n ths case s depcted n Example 3.1. As an example of the case p S(p; l), consder p 17and l 2. Then and S(17; 2) f1; 2; 4; 8; 9; 13; 15; 16g U f3; 5; 6; 7; 10; 11; 12; 14g: The array (c ;j ) n ths case s depcted n Example 3.2. In order to reach a contradcton, we need to prove that the array (c ;j ) s n C(p; l). Frst we make the followng observaton: snce U consst of all the powers of l modulo p, the functon! l s closed n U and s 1-1. Next we show that all the lnes of slopes 1 and l have party 0 and use Lemma 2.1 to complete the proof. Notce that the only nonzero entres n (c ;j) are as defned by U n the frst row and frst column. Namely, for every 0 p 0 1 c 0j;j 0 because the frst row and frst column are dentcal and the entres not n the unon of the frst row and the frst column are zero. Moreover, for every 0 p 0 1 c 0lj;j c ;0 + c 0;t where 0 lt 0. But c ;0 + c 0;t 0f and only f c ;0 c 0;t, whch, by the defnton of the array (c ;j ), s equvalent to the followng statement: 2 U, t 2 U: Snce 0 lt 0, then lt. Ift 2 U, snce the functon j! lj s closed n U, then 2 U. Conversely, f 2 U, then t l s01, and agan, snce j! lj s closed n U, then t 2 U. Hence, by Lemma 2.1, (c ;j) s n C(p; l). () Assume now that l s prmtve n GF (p). We have already proven n Lemma 2.3 that codes C(p; l) and C 0 (p; l) are MDS, thus any par of columns or of rows n an array n C(p; l) can be unquely retreved. We need to show now that the same s true for any row and column. Let (c s;t ) 0s;t be an array n C(p; l), and assume that c s;t 0 whenever s 6 and t 6 j. As usual, assume that the last row s an magnary 0-column as well as the last column. We wll show that also c ;t 0and c s;j 0. Snce c ;j 0, then c ;j0(+1) b, snce they belong n the same dagonal, and b 0or b 1, accordng to the party of the dagonals and the lnes of slope l. Snce c ;j0(+1) b, then c 0l(+1);j 0, snce they belong n the same lne of slope l. By nducton, assume that c 0for 1 r. Then, c 0l (+1);j ;j0l (+1) b, snce c 0l and c (+1);j ;j0l (+1) belong n the same dagonal. Ths mples that c 0l (+1);j 0, snce c ;j0l (+1) and c 0l (+1);j belong n the same lne of slope l. Therefore, c 0l (+1);j 0 and c ;j0l (+1) b for 0 r. Snce l s prmtve n GF (p), then there s an r such that l r (j +1)( +1). For that r; j 0 l r ( +1) p 0 1, butc ; 0b, thus c ;j0l (+1) 0for 0 r p 0 2. Agan, usng the fact that l s prmtve n GF (p), we conclude that c s;j 0for s 6 and c ;t 0for t 6 j. Fnally, c ;j 0snce the dagonals and lnes of slope l have even party. Ths completes the proof. In [4], [6], and [12], the authors prove that ther constructon can correct the rank of an array when the rank s used as a metrc. We have seen that the rank s a more powerful metrc than the crss-cross dstance consdered here. Therefore, a legtmate queston s: can the codes C(p; l) also correct the rank? The answer s no, n general. For nstance, consder the followng array n C(7; 3): Ths array has crss-cross weght 3 but rank 2. So, the queston s, under whch condtons the codes C(p; l) can correct the rank? The answer s, whenever the polynomal 1+x x s rreducble,.e., when 2 s prmtve n GF (p), then the nonzero arrays n C(p; l) have rank at least 3. In ths case, the rng of polynomals modulo 1+x x s a feld. Explctly Theorem 3.2: Every nonzero array n code C(p; l), 2, and l prmtve n GF (p), has rank at least 3. Proof: Let 0 be a nonzero array n C(p; l) wth rank 2, therefore, we can wrte where s a (p 0 1) 2 2 array and 0UD U (u ;j ) D (d ;j ) s a 2 2 (p 0 1) array, and both U and D have rank 2. Lookng at each column of 0 as an element modulo 1+x x, we obtan that the jth column of 0 s gven by 1 t0 u ;td t;j 1 t0 d t;j u ;t :
6 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY Usng the party-check matrx H(p; l) defned by (1), we obtan that 1 d t;j u ;t j 0 t0 1 d t;j t0 whch can be rearranged as 1 t0 1 t0 d t;j j d t;j lj u ;t lj 0 u ;t 0 (6) u ;t 0: (7) Snce 2 s prmtve n GF (p), then l s a power of 2, and thus d t;j lj so (6) and (7) can be wrtten as d0;j j d0;j j Let D t become l u ;0 + u ;0 + dt;jj and U t d t;j j d1;j j d1;j j D0U0 + D1U1 0 D0U0 l + D1U1 l 0: l l u ;1 0 (8) u ;1 0: (9) u;t, then (8) and (9) Snce we are n a feld, the system above has a nontrval soluton f and only f det D0 D1 D0 l D1 l 0 and, snce D0 6 0and D1 6 0, ths can only occur f D l D l01 1 0(D0 + D1) l01 : Thus D0 D1, a contradcton, snce we are assumng that matrx D has rank 2. We have not found an adequate generalzaton of the codes C(p; l) to more than two partes. It s an open problem f such a generalzaton exsts. However, f l 2and 2 s prmtve n GF (p), then the code wth r partes defned by the party-check matrx ()2 H () (2 ) 111 ()2 s MDS wth respect to the rank. Ths code s a partcular case of the ones descrbed n [4], [6], and [12]. IV. ENCODING AND DECODING In ths secton we gve encodng and decodng algorthms for errors and erasures. If there are no ndcatons of erased rows or columns n a receved array, the decoder attempts to correct ether a column or a row. In the case of erasures, the decoder can correct ether two erased columns, two erased rows, or an erased column together wth an erased row. The encodng s a partcular case of the decodng of two erased columns. We examne all these cases separately. Let us start wth errors. Assume that (r ;j ) s a receved array, possbly a nosy verson of an orgnally stored array (c ;j) 2 C(p; l). Moreover, assume that ether a column or a row n (r ;j ) are n error. The frst step s fndng the column syndromes usng the party-check matrx H(p; l) gven by (1). To ths end, we defne r() (r0();r1(); 111;r ()) as r j () Estmatng r()(h(p; l)) T, we obtan r ;j : r j () j S1() (10) r j () jl S l () (11) Let us pont out that multplyng a vector of length p 0 1 by a power t s equvalent to rotatng the vector t tmes modulo 1+x+111+x. For nstance, let p 5, and consder the vector (a0;a1;a2;a3). Asa polynomal n, ths vector s wrtten as a0 + a1 + a2 2 + a3 3.If we multply ths polynomal by 2, snce 5 1and , we obtan (a3 + a2)+a2 +(a0 + a2) 2 +(a1 + a2) 3, whch n vector form s (a3 +a2;a2;a0 +a2;a1 +a2). Ths s what we call rotatng the vector (a0;a1;a2;a3) two tmes modulo 1+x + x 2 + x 3 + x 4. Alternatvely, we could have taken the vector and added a 0 to t to obtan (a0;a1;a2;a3; 0). Rotatng ths extended vector twce to the rght (.e., rotaton modulo 1+x 5 ), we obtan (a3; 0;a0;a1;a2).To reduce t modulo 1+x+x 2 +x 3 +x 4 we need to add the last coordnate to each of the frst four, gvng the vector (a3+a2;a2;a0+a2;a1+a2). Ths provdes a computatonally smple method for multplyng by. For detals, we refer the reader to [3]. If there was an error E n, say, column t, and all the other columns are correct, (10) and (11) gve E t S1() (12) E tl S l (): (13) We need to fnd the error locaton t and the error tself E. Solvng (12) and (13), we obtan (l01)t S1() S l (): (14) So, the decoder apples repeatedly the operaton (l01)j S1() for 0 j p 0 2 untl t fnds a j t satsfyng (14). If there s such a t, then the decoder declares an error n column t, and the value E of the error, from (12), s gven by E 0t S1(). The fnal step s addng E to column t, completng the decodng. However, f there s no t satsfyng (14), the decoder wll assume that there was a row error, and wll repeat the procedure but ths tme for rows. Specfcally, the decoder now consders r 0 () (r 0 0();r 0 1(); 111;r 0 ()) as r 0 () r ;j j :
7 1074 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 Estmatng r 0 ()(H(p; 1l) T, we obtan the row syndromes Notce that r() 0 S1() 0 (15) r() 0 l Sl(): 0 (16) S1() 0 r() 0 r ;j j r ;j j r j() j S1() so S 0 1() does not need to be calculated once S1() s known. If there was an error E 0 n, say, row s, and all the other rows are correct, (15) and (16) gve E 0 s S 0 1() (17) E 0 sl S 0 l(): (18) Solvng (17) and (18), we obtan ((1l)01)s S1() 0 Sl(): 0 (19) Now, the decoder apples repeatedly the operaton ((1l)01)j S1() 0 for 0 j p 0 2 untl t fnds a j s satsfyng (19). If there s such an s, then the decoder declares an error n row s, and the value E 0 of the error, from (12), s gven by E 0 0s S1(). 0 The fnal step s addng E 0 to row s, completng the decodng. If there s no s satsfyng (19), then the decoder declares an uncorrectable error. Let us llustrate the decodng procedure wth an example. Example 4.1: Consder code C(7; 3) and assume that the followng array s receved: The values S1(); S3(); S 0 1() and S 0 3() are gven by and (S1();S3()) r()(h(7; 3)) T (S 0 1();S 0 3()) r 0 ()(H(7; 5)) T : Performng these operatons, we obtan S 0 1() S1() S3() S 0 3() : Frst we check f there s a column error. Usng (14), we have to check f there s a t such that 2t S1() S3(). We can verfy that there s no such t, so we concentrate next on rows. Usng (19), we have to check f there s an s such that 4s S1() 0 S3(). 0 We can verfy that for s 3 12 S1() 0 5 ( ) S 0 3() so there s an error n row 3. From (17), ths error s gven by E 0 0s S 0 1() 4 ( ) : Addng ths error value to locaton 3 of r 0 (), we obtan c 0 () (1+ 4 ; 2 ; ; ; ; ): Each of the entres of c 0 () represents a row n the array, so the corrected array s gven by The correspondng r() and r 0 () are gven by r() (1; ;; ; ; ) r 0 () (1+ 4 ; 2 ; ;+ 3 ; ; ): Notce that 13 5modulo7,so H(7; 3) H 0 (7; 3) H(7; 5) and Let us formally wrte the algorthm descrbed above. Algorthm 4.1 (Decodng Algorthm for a Row or a Column n Error): Assume that (r ;j ) s a receved array, possbly a nosy verson of an orgnally stored array n C(p; l), where l s prmtve n GF (p). Assume that ether a column or a row n (r ;j) are n error. Defne r() (r0();r1(); 111;r ()), where r j () r ;j and r 0 () (r 0 0();r 0 1(); 111;r 0 ()), where r 0 () r ;j j :
8 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY Fnd S 1() S1() 0 accordng to (10), S l () accordng to (11), and () accordng to (16). Then S 0 l If there s a t such that S ()S (), then: Let E S ();c () r () for j 6 t and c () r ()+E, where c () c, output (c ) and stop. Else, f there s no t such that If there s an s such that S ()S (), then: S ()S (), then: Let E S ();c ()r () for 6 s and c () r ()+E ; where c () c, output (c ) and stop. S ()S (), then declare an uncor- Else, f there s no s such that rectable error and stop. Next we concentrate on erasures. Frst, assume that two erasures have occurred n columns s and t, 0 s < t p 0 2. In order to compute the column syndromes accordng to (10) and (11), we assume that r s () r t () 0. Then, we have to fnd the mssng elements E s and E t. In ths case, (10) and (11) gve E s s + E t t S 1() E s ls + E t lt S l (): Solvng the lnear system above, we obtan (l01)(t0s) +1 E s l(t0s)0t S 1() + 0sl S l () (20) (l01)(t0s) +1 E t 0t S 1 () + 0(l01)s0t S l (): (21) Solvng effcently recursons of the type ( j +1)A B modulo 1+x x was done n detal n [3]. Certanly, a soluton s guaranteed to occur snce snce, as proved n [3] gcd(1 + x j ; 1+x x )1 therefore, j +1s nvertble. Let us llustrate the case of two erased columns wth an example. Example 4.2: As n Example 4.1, consder code C(7; 3) and assume that the followng array s receved (the? sgns denote erased bts): 1 0? 0? ? 0? ? 0? ? 0? ? 0? ? 1? 1 0 Therefore, columns 2 and 4 have been erased. The receved vector r() can be wrtten as r() ( ; ; 0; 5 ; 0; ): Performng (S 1();S 3()) r()(h(7; 3)) T as n Example 4.1, we obtan S 1 () S 3() : Applyng (20) and (21) wth l 3;s2;t4; and the values of S 1 () and S 3 () above, we obtan ( 4 +1)E ( 4 +1)E : For the sake of completeness, let us solve the recurson ( 4 +1)E : For detals of the method, see [3]. Let Then E 4 x 0 + x 1 + x x x x 5 5 : (1 + 4 )E 4 (x 3 + x 2 + x 0 )+(x 4 + x 2 + x 1 ) + x 5 2 +(x 2 + x 3) 3 +(x 0 + x 2 + x 4) 4 +(x 1 + x 2 + x 5 ) : Solvng ths system recursvely, we obtan therefore, Smlarly, f x 5 1 x 1 + x 2 1 x 4 1 x 0 + x 2 1 x 3 0 x 2 1 x 1 0 x 0 0 E : E 2 x 0 + x 1 + x x x x 5 5 we have to solve the recurson (1 + 4 )E 2 (x 3 + x 2 + x 0 )+(x 4 + x 2 + x 1 ) + x 5 2 +(x 2 + x 3) 3 +(x 0 + x 2 + x 4) 4 +(x 1 + x 2 + x 5 ) : Proceedng lke n the prevous case, ths gves Therefore, the decoded array s E 2 2 : Notce that the lnes of slope 1 and 3 have even party.
9 1076 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY 2000 Let us pont out once more that the encodng s a partcular case of the erasure decodng descrbed above: we choose two columns for the redundancy, say, columns p 0 3 and p 0 2 (the last two columns n the array), and usng the nformaton n the frst p 0 3 columns, we reconstruct the two redundant columns. Let us wrte down formally the algorthm for decodng of two erased columns. Algorthm 4.2 (Decodng Algorthm for Two Erased Columns): Assume that (r ;j ) s a receved array from an orgnally stored array n C(p; l), where two columns, 0 s<t p 0 2,have been erased. Defne r() (r 0 ();r 1 (); 111;r ()), where r j () r ;j ; for j 6 s; t and r s () r t () 0: Fnd S 1() accordng to (10) and S l () accordng to (11). Then, let E s be the soluton of the recurson gven by (20) and E t the soluton of the recurson gven by (21). Defne c j () r j() for j 6 s; t; c s () E s and c t () E t, where c j() c ;j output (c ;j ) and stop. If two rows are erased, the procedure s analogous, except that we have to consder now the syndromes S1() 0 and S 0 l () and replace l by 1l. Formally Algorthm 4.3 (Decodng Algorthm for Two Erased Rows): Assume that (r ;j) s a receved array from an orgnally stored array n C(p; l), where two rows, 0 s < t p 0 2, have been erased. Defne r 0 () (r0();r 0 1(); 0 111;r()), 0 where r 0 () r ;j ; for j 6 s; t and r 0 s() r 0 t() 0: Fnd S1() 0 accordng to (15) and S 0 l () accordng to (16). Then, let E 0 s and E 0 t be the soluton of the followng recursons: ((1l)01)(t0s) +1 E 0 s (1l)(t0s)0t S 0 1() + 0s(1l) S 0 l() ((1l)01)(t0s) +1 E 0 t 0t S 0 1() + 0((1l)01)s0t S 0 l(l): Defne c 0 () r 0 j () for 6 s; t; c 0 s() E 0 s and c 0 t() E 0 t, where c() 0 c ;j output (c ;j ) and stop. The last case we need to consder n order to complete the decodng of two erasures, s the case n whch a row and a column have been erased. In ths case, we need to assume that l s prmtve n GF (p), an assumpton that was not necessary n the decodng of two erased columns or two erased rows. Assume then that (r ;j) s a receved array where row s and column t have been erased, 0 s; t p 0 2. We want to fnd the values r s;j and r ;t. As usual, we assume ntally that those values are 0 n order to calculate the syndromes, and we also assume that a 0-row and a 0-column have been added to the array. From (10) and (11), let us start by estmatng, for each 0, the p syndromes of slope 1 and l, respectvely, as follows: S (l) r 0j;j (22) r 0lj;j: (23) The reader may ask, what s the relatonshp between these syndromes, and the column syndromes gven by (10) and (11)? Proceedng lke n Lemma 2.1, we easly fnd out that and S 1 () ( + ) S l () (S (l) + S (l) ) : Therefore, (22) and (23) provde a computatonally effcent method to fnd (10) and (11). Let b be the unknown party of lnes of slope 1 and l. Proceedng nductvely lke n the f part of the proof of Theorem 3.1, for each 0 j, we obtan the followng recurson: r s;t0l (s+1) S(1) s+t0l (s+1) + r s0l (s+1);t + b (24) r s0l (s+1);t S(l) s+lt0l (s+1) + r s;t0l (s+1) + b (25) Therefore, applyng the recurson repeatedly, for each 0 j p 0 2, we obtan r s;t0l (s+1) s+t0l (s+1) + S (l) s+lt0l (s+1) j1 In partcular, let be the unque value n GF (p) such that + b: (26) l t +1 s +1 : (27) Snce l s prmtve n GF (p), we know that there exsts such an. Replacng (27) n (26), snce r s;t01 0;bs gven by b s+t0l (s+1) + S (l) (28) s+lt0l (s+1) j1 Thus the recurson gven by (24) and (25) provdes the soluton, snce b s now known. Fnally, r s;t + b (29) s+t completes the decodng. Let us llustrate the procedure wth an example. Example 4.3: As n Example 4.2, consder agan C(7; 3). Assume that we receve the followng array: 1 0? ? ? ? ?????? 0 1 0?
10 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 3, MAY n whch row s 4and column t 2have been erased. The frst step s fndng the syndromes accordng to (22) and (23). Takng as zero the symbols denoted by?, ths gves Accordng to (27) 0 0 S (3) S (3) S (3) S (3) S (3) S (3) S (3) 6 0: l 3 (t +1)(s +1)35 2 snce 15 3n GF (7). Solvng for 3 2, we conclude that 2. From (28), replacng l 3;2;s4; and t 2; we obtan b S (3) 2 + S (3) : We are ready now for the fnal recurson gven by (29), (24), and (25) r 4;2 6 0 r 4;4 1 + r 6;2 1 (j 0) r3;2 S (3) 2 + r4;4 0 (j 0) r 4;1 5 + r 3;2 1 (j 1) r 1;2 S (3) 0 + r 4;1 0 (j 1) r4;6 3 + r1;2 0 (j 2) r2;2 S (3) 1 + r4;6 1 (j 2) r 4;0 4 + r 2;2 0 (j 3) r 5;2 S (3) 4 + r 4;0 0 (j 3) r4;3 0 + r5;2 0 (j 4) r 0;2 S (3) 6 + r 4;3 0 (j 4) r 4;5 2 + r 0;2 0 (j 5) r 6;2 S (3) 5 + r 4;5 0 (j 5) Notce that, for j 2, we already know that r4;6 0, snce ths value s n the magnary seventh 0-column that has been added. However, ths fact was exploted n the calculaton of the party bt b gven by (28). The fnal decoded array s thus gven by Let us end ths secton by wrtng formally the decodng algorthm for an erased row together wth an erased column. Algorthm 4.4 (Decodng Algorthm for an Erased Row and an Erased Column): Assume that (r ;j ) s a receved array from an orgnally stored array n C(p; l); lprmtve n GF (p), where row s and column t; 0 s; t p 0 2; have been erased. For each 0 p 0 1, fnd the syndromes gven by (22) and (23). Then, f s such that l (t +1)(s +1), determne b accordng to (28). Fnally, fnd r s;t accordng to (29) and the rest of the values accordng to the recurson gven by (24) and (25). V. CONCLUSION We presented a famly of ()2() array codes, p a prme, that can correct any row or any column n error. The constructon s based on takng all the arrays wth even or odd party along lnes of slope 1 and of slope l, l prmtve n GF (p). Known codes n the lterature dffer from our codes n the sense that they can correct errors defned by the rank of an array. Our codes can also correct the errors defned by the rank when 2 s prmtve n GF (p). However, the man new feature of our codes s ther lower encodng/decodng complexty, as ther encodng/decodng algorthms are based on smple XOR operatons, n contrast to known codes that requre operatons over fnte felds. Although we presented our results for bnary codes, they may be trvally extended to any feld. REFERENCES [1] M. Blaum and P. G. Farrell, Array codes for cluster-error correcton, Electron. Lett., vol. 30, no. 21, pp , [2] M. Blaum and R. J. McElece, Codng protecton for magnetc tapes: A generalzaton of the Patel-Hong code, IEEE Trans. Inform. Theory, vol. IT-31, pp , Sept [3] M. Blaum and R. M. Roth, New array codes for multple phased burst correcton, IEEE Trans. Inform. Theory, vol. 39, pp , Jan [4] P. Delsarte, Blnear forms over a fnte feld, wth applcatons to codng theory, J. Comb. Theory Ser. A, vol. 25, pp , [5] S. A. Elknd and D. P. Seworek, Relablty and performance of errorcorrectng memory and regster codes, IEEE Trans. Comput., vol. C-29, pp , [6] E. M. Gabduln, Theory of codes wth maxmum rank dstance, Probl. Inform. Transm., vol. 21, no. 1, pp. 3 16, [7] M. Hall Jr., Combnatoral Theory. Waltham, MA: Blasdell, [8] L. Levne and W. Meyers, Semconductor memory relablty wth error detectng and correctng codes, Computer, vol. 9, pp , Oct [9] W. F. Mkhal, R. W. Bartoldus, and R. A. Rutledge, The relablty of memory wth sngle-error correcton, IEEE Trans. Comput., vol. C-31, pp , [10] A. M. Patel and S. J. Hong, Optmal rectangular code for hgh densty magnetc tape, IBM J. Res. Develop., vol. 18, pp , [11] P. Prusnkewcz and S. Budkowsk, A double-track error-correcton code for magnetc tape, IEEE Trans. Comput., vol. C-19, pp , [12] R. M. Roth, Maxmum rank array codes and ther applcaton to crsscross error correcton, IEEE Trans. Inform. Theory, vol. 37, pp , Mar [13], Tensor codes for the rank metrc, IEEE Trans. Inform. Theory, vol. 42, pp , Nov [14], Probablstc crsscross error correcton, IEEE Trans. Inform. Theory, vol. 43, pp , Sept whch concdes wth the one n Example 4.2.
Lecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationRefined Coding Bounds for Network Error Correction
Refned Codng Bounds for Network Error Correcton Shenghao Yang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, N.T., Hong Kong shyang5@e.cuhk.edu.hk Raymond W. Yeung Department
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationHigh-Speed Decoding of the Binary Golay Code
Hgh-Speed Decodng of the Bnary Golay Code H. P. Lee *1, C. H. Chang 1, S. I. Chu 2 1 Department of Computer Scence and Informaton Engneerng, Fortune Insttute of Technology, Kaohsung 83160, Tawan *hpl@fotech.edu.tw
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationLecture 14 (03/27/18). Channels. Decoding. Preview of the Capacity Theorem.
Lecture 14 (03/27/18). Channels. Decodng. Prevew of the Capacty Theorem. A. Barg The concept of a communcaton channel n nformaton theory s an abstracton for transmttng dgtal (and analog) nformaton from
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationDecoding of the Triple-Error-Correcting Binary Quadratic Residue Codes
Automatc Control and Informaton Scences, 04, Vol., No., 7- Avalable onlne at http://pubs.scepub.com/acs/// Scence and Educaton Publshng DOI:0.69/acs--- Decodng of the rple-error-correctng Bnary Quadratc
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationTornado and Luby Transform Codes. Ashish Khisti Presentation October 22, 2003
Tornado and Luby Transform Codes Ashsh Khst 6.454 Presentaton October 22, 2003 Background: Erasure Channel Elas[956] studed the Erasure Channel β x x β β x 2 m x 2 k? Capacty of Noseless Erasure Channel
More informationLong MDS Codes for Optimal Repair Bandwidth
Long MDS Codes for Optmal Repar Bandwdth Zhyng Wang, Itzhak Tamo, and Jehoshua Bruck Electrcal Engneerng Department, Calforna Insttute of Technology, Pasadena, CA 91125, USA Electrcal and Computer Engneerng,
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationLearning Theory: Lecture Notes
Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More information} s ) was constructed [7]. C 0 with length n 0 and minimum distance d 0 over F q.
Ffty-Ffth Annual Allerton Conference Allerton House, UIUC, Illnos, USA October 3-6, 17 Mult-Erasure Locally Recoverable Codes Over Small Felds Pengfe Huang, Etan Yaakob, and Paul H Segel Electrcal and
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationDUE: WEDS FEB 21ST 2018
HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationChapter 8 Indicator Variables
Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n
More informationErrata to Invariant Theory with Applications January 28, 2017
Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng
More informationChapter 6. BCH Codes
Wreless Informaton Transmsson System Lab Chapter 6 BCH Codes Insttute of Communcatons Engneerng Natonal Sun Yat-sen Unversty Outlne Bnary Prmtve BCH Codes Decodng of the BCH Codes Implementaton of Galos
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More informationDepartment of Mathematical Sciences, Clemson University. Some recent developments in permutation decoding
Department of Mathematcal Scences, Clemson Unversty http://www.ces.clemson.edu/ keyj/ Some recent developments n permutaton decodng J. D. Key keyj@ces.clemson.edu 1/32 P Abstract The method of permutaton
More informationDeriving the X-Z Identity from Auxiliary Space Method
Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More information