Lecture 5 Decoding Binary BCH Codes
|
|
- Noel Butler
- 6 years ago
- Views:
Transcription
1 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 Its generator polynomal s g(x) (x 4 +x+1)(x 4 + x 3 + x 2 + x + 1), and f ω denotes a zero of x 4 + x + 1, then the roots of g(x) are ω, ω 2, ω 3, ω 4, ω 6, ω 8, ω 9, ω 12 Suppose that we have a receved word y (y 0,, y 14 ) of whch we know that t has dstance 2 from a codeword Our task s to fnd the closest codeword c to y We know that y c + e, where e s of weght at most 2 Let us assume for now that e s of weght exactly 2, and t s one at postons 1 and 2, say What do we know then? Let y(x) y x, c(x) c x, and e(x) x 1 + x 2 The only polynomal n ths lst that we know s y(x) But, we also know that y(α) e(α) whenever c(α) 0, so that we know S for 1, 2, 3, 4, 6, 8, 9, 12, where S : y(ω ) Thus, set X : ω 1 and Y : ω 2, we know the followng: X + Y S 1 X 2 + Y 2 S 2 X 3 + Y 3 S 3 X 4 + Y 4 S 4 We have left out the other equatons, because, as t turns out, these four are suffcent to determne the error postons 1 and 2 Our task s to fnd X and Y, two nonzero and dfferent elements n F 2 k F(ω) satsfyng the above equatons Note that ths descrpton s also vald when the weght of e s 1: n that case, X or Y are zero Suppose that we could fnd XY from these equatons Then we would know X + Y (whch s S 1 ), and XY, so that we know the polynomal (X z)(y z) z 2 (X + Y )z + XY Factorng ths polynomal then reveals X and Y Our task should thus consst of fndng XY Note that S 3 1 (X + Y ) 3 (X 2 + Y 2 )(X + Y ) X 3 + Y 3 + XY (X + Y ) S 3 + XY S 1 (51) Snce S 1 0, we fnd that XY S 2 1 S 3 /S 1 S 2 S 3 /S 1, and we can thus decode the code Example 51 Let ω be a root of x 4 + x + 1 F 2 [x] For the followng calculaton, t s advantageous to keep a table of the varous representatons of powers of ω, whch s gven n Table 51 Lecture and scrbes by Amn Shokrollah
2 2 Modern Codng Theory, Sprng ω 2 ω 2 3 ω 3 4 ω ω 2 + ω 6 ω 3 + ω 2 7 ω 3 + ω + 1 ω 8 ω ω 3 + ω 10 ω 2 + ω ω 3 + ω 2 + ω 12 ω 3 + ω 2 + ω ω 3 + ω ω ω Table 51: Table of values of ω Suppose that we have receved the word The polynomal y(x) s then equal to We therefore have y (0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0) y(x) x 4 + x 6 + x 7 + x 8 + x 13 S 1 y(ω) ω 2 + ω 3 ω 6 S 2 y(ω 2 ) 1 + ω + ω 2 + ω 3 ω 12 S 3 y(ω 3 ) 1 + ω + ω 3 ω 7 S 4 y(ω 4 ) ω + ω 3 ω 9 (52) The polynomal to be factored s z 2 + (ω 2 + ω 3 )z + (ω 12 ω) z 2 + ω 6 z + ω 13 There are varous ways to factor ths polynomal, one of whch s to try all possble values of ω for z Such a search (called a Chen Search n the lterature) reveals the two zeros ω 0, ω 13 of ths polynomal Ths shows that the receved word has errors at postons 0 and 13, so that the closest codeword to y s (1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0) 52 The Newton Relatons The general method of decodng s about the same: suppose that the generator polynomal of the code has the consecutve set of zeros ω, ω 2,, ω 2t Then we can correct at most t errors We form the polynomal y(x) from the receved word, and calculate S 1 y(ω), S 2 y(ω 1 ),, S 2t y(ω 2t ) We call these values the syndromes of the receved word y If the error postons are 1,, t, then we wrte X l for ω l, and we obtan the relatons X X t S 1, X Xt 2 S 2, X 2t X 2t t S 2t How can we obtan the coeffcents of the polynomal L(z) (z X 1 ) (z X t ) from these relatons? Ths s expressed n terms of Newton Relatons To descrbe them, t s more convenent to work wth the polynomal H(z) (1 X 1 z) (1 X t z) nstead Of course, f we can fnd ths polynomal (usually called the error-locatng polynomal), then we can read off the locatons of the errors from ths polynomal Theorem 52 [Newton Relatons] Let H(z) ( 1) t σ t z t + ( 1) t 1 σ t 1 z t 1 + σ 1 z + 1, and let H (z) denote the formal dervatve of H wth respect to z Further, let S(z) S 1 + S 2 z + S 3 z 2 + be a power seres wth the S as coeffcents Then we have H(z) S(z) H (z)
3 Lecture 5: Decodng Bnary BCH Codes 3 Proof We work wth formal power seres Then we have whch s equvalent to our asserton H (z) t H(z) X j H(z) 1 X j z t X j Xj l z l H(z) l 0 H(z) S(z), l 0 t X l+1 j z l 53 Recurrence Relatons Let S (S 1, S 2,, S 2t ) be a sequence of length 2t over a feld F A polynomal r(z) of degree t s called a recurrence relaton for the sequence f there s a polynomal µ(z) of degree less than deg(r) such that S(z) µ(z)/r(z), where S(z) S 1 + S 2 z + + S 2t z 2t 1 Note that S may not have a recurrence at all However, f t does, then t has a mnmal recurrence, e, one of mnmal degree It turns out that every recurrence s a multple of a mnmal one, and hence, the mnmal recurrence s unque up to scalar multplcaton Sums of recurrence relatons are also recurrence relatons, Theorem 53 Suppose that S(z) S 1 + S 2 z + + S 2t z 2t 1 has a recurrence Then t has a mnmal recurrence µ(z), and any other recurrence s a multple of µ(z) Moreover, f S(z) v(z)/a(z) for co-prme polynomals v(z) and a(z) wth deg(u) < deg(a) t, then a(z) s a mnmal recurrence Proof Let S(z) η(z)/µ(z) mod z 2t wth deg(η) < deg(µ) We can assume that η(z) and µ(z) are co-prme, because otherwse the mnmalty of µ(z) would be volated Let h(z) be another recurrence relaton for S, wth S(z) v(z)/a(z) mod z 2t Then a(z)η(z) v(z)µ(z) 0 mod z 2t It s easly seen that the degree of the left-hand sde s less than 2t, so that the polynomal on the left s zero Ths means that v(z)/a(z) η(z)/µ(z) Snce µ s of mnmal degree and η(z) and µ(z) are co-prme, ths shows that a(z) s a multple of µ(z) Suppose now that S(z) v(z)/a(z) wth co-prme a(z) and v(z) Snce v(z)/a(z) η(z)/µ(z), the polynomal a(z) must be a scalar multple of µ(z), hence s a mnmal recurrence The Newton relatons of the prevous secton proves that the error locator s a recurrence for the sequence of syndromes S 1, S 2, In fact, t turns out that t s a mnmal recurrence for ths sequence Theorem 54 Any recurrence relaton of length 2t and degree t for the sequence of syndromes s a multple of the error locator polynomal Proof Let H(z) denote the error locator By the Newton relatons we have S(z) H (z)/h(z) Snce H(z) does not have double roots, the polynomals H (z) and H(z) are co-prme, hence H(z) s a mnmal recurrence The prevous result mples the followng Corollary 55 If a(z) s a polynomal of degree t and v(z) s a polynomal of degree < t, and f a(z)s(z) v(z) mod z 2t, (53) then a(z) s a multple of the error locator H(z) Moreover, a mnmal soluton to (53e, a nonzero soluton of mnmal degree) s (up to scalar multplcaton) the error locator How ths can be used s demonstrated n the next sectons
4 4 Modern Codng Theory, Sprng Decodng BCH-Codes usng Matrx Equatons Snce multplcaton of both sdes of (53) wth a nonzero polynomal does not alter the equaton, we can assume that a(z) s of degree t Let a 0, a 1,, a t 1 denote the coeffcents of z 0, z 1,, z t 1 n a(z), respectvely By consderng the coeffcents of z t, z t+1,, z 2t 1 on both sdes of (53) we obtan the followng system of equatons: S t+1 S t S 2 S t+2 S t+1 S 3 S 2t S 2t 1 S t+1 a 0 a 1 a t 1 S 1 S 2 S t (54) From the results of the last secton we know that the above system has a soluton, and that any soluton s a multple of the error locator The algorthm we present here s a modfed verson of the Peterson-Gorensten-Zerler decoder 1 Upon recepton of y, check whether t s n the code If so, then STOP 2 Compute the syndromes S y(ω ), 1,, 2t 3 Fnd a nonzero soluton a of the system (54) Declare ERROR f t does not exst 4 Form the polynomal a(z) and calculate ts roots ω 1,, ω s n {1, ω,, ω n 1 } 5 Declare postons 1,, s as erasures Use any erasure decodng algorthm for the BCH-code to recover these postons and obtan a codeword c The way t s descrbed, ths algorthm uses O(t 3 ) steps for solvng the system (54), and an addtonal O(k 3 ) steps for the erasure decodng step Ths can be mproved n several ways Frst, the system of equatons gven n (54) s structured The matrx correspondng to ths system s called a Toepltz matrx and ts nverse can be found wth O(t 2 ) operatons over F 2 (ω) We wll encounter structured matrces and methods for nvertng them later n the class The second way n whch ths algorthm can be mproved s the erasure decodng part, whch could also be accomplshed wth O(k 2 ) operatons over F 2 (ω) Note that ths part could be avoded altogether f we could mmedately fnd the error locator n the frst step The algorthm provded n the next secton s more effcent In fact, t fnds the error locator mmedately, though we wll not prove ths here Example 56 We use the same example as n the frst secton Then, recallng (52), the system (54) becomes ( ) ω 7 ω 12 a0 ω 6 ω 9 ω 7 We obtan a 0 ω 2 and a 1 ω 8 The polynomal a(z) s thus equal to ω 2 + ω 8 z + z 2 Its roots are 1 ω 0 and ω 2 ω 13, and hence the error locatons are contaned n 0 and 13 In ths case, the error locatons are exactly these two values a 1 ω Decodng Bnary BCH Codes va the Extended GCD-Algorthm One way to obtan the polynomals a(z) and v(z) n (53) s the followng We apply the extended GCD-algorthm to S(z) and z 2t At each step of the algorthm, we obtan polynomals a (z), b (z), and v (z) such that a 1 (z)s(z) + b 1 (z)z 2t v (z) As soon as the degree of v (z) becomes smaller than that of a 1 (z), we have satsfed the assumptons of Corollary 55, and we have dentfed a super-set of the error postons Erasure decodng, as descrbed n the prevous secton, wll then reveal the correct codeword The polynomals a, b, and v are obtaned as follows Set v 0 (z) z 2t, and v 1 (z) S(z) Then, at each step 0, perform a dvson algorthm to compute q such that v (z) q (z)v +1 (z) + v +2 Ths way, we have ( v+1 v +2 1 q 1 q 1 1 q 0 v0 v 1 b a : b +1 a +1 v0 v 1 )
5 Lecture 5: Decodng Bnary BCH Codes 5 To have a matrx equaton between (v, v +1 ) and (v 0, v 1 ) for all values of 0, we defne ( ) b 1 a : (55) b 0 a 0 Then we have the recurrence relatons ( b a b +1 a +1 1 q b 1 a 1 b a b q b + b 1 a q a + a 1 ) The algorthm would thus proceed as follows: 1 Intalze a, b, 1, 0, as n (55) 2 Intalze v 0 z 2t and v 1 S(z), 0 3 Whle deg(v ) deg(a 1 ) do (advson step) Compute q (z) and v +2 from v (z) q (z)v +1 (z) + v +2 (bupdate) Set a +1 q a + a 1, and b +1 q b + b 1 (c) Set The polynomal a 1 (z) s now a multple of the error locator polynomal Calculate ts roots ω 1,, ω s n {1, ω,, ω n 1 } 5 Declare postons 1,, s as erasures Use any erasure decodng algorthm for the BCH-code to recover these postons and obtan a codeword c On the surface, ths algorthm has not really mproved the Peterson-Gorensten-Zerler algorthm However, t can be shown that the polynomal b 1 (z) found above s n fact a scalar multple of the error locator, though we are not gong to show t here (Ths result s due to varous researchers, among them Mc Elece, Welch and Scholtz, Chenc, and Dornstetter) The algorthm gven above s essentally equvalent to the famous Berlekamp-Massey algorthm whch fnds a mnmal recurrence of degree t for the frst 2t values of a gven sequence We wll dscuss ths algorthm n the exercses Example 57 We contnue wth the runnng example of Secton 1 Settng v 0 (z) z 4 and v 1 (z) S(z) ω 9 z 3 + ω 7 z 2 + ω 12 z + ω 6, we obtan v 0 (z) v 1 (z) (ω 6 z + ω 4 ) + (ω 5 z 2 + ω 11 z + ω 10 ) v 1 (z) q 0 (z) + v 2 (z) b 1 (z) 1 a 1 (z) q 0 (z) v 1 (z) v 2 (z) (ω 4 z + ω 7 ) + ω 3 v 2 (z) q 1 (z) + v 3 (z) b 2 (z) q 1 (z) a 2 (z) q 1 (z) b 1 (z) + b 0 (z) (ω 6 z + ω 4 ) (ω 4 z + ω 7 ) + 1 ω 10 z 2 + ω 3 z + ω 12 We see that deg(v 3 ) < deg(a 2 ), and hence a 2 (z) s a multple of the error locator Ths polynomal has the roots ω 0 and ω 13, whch shows that the errors are at most n postons 0 and 13
APPENDIX 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 informationFrom the Euclidean Algorithm for Solving a Key Equation for Dual Reed Solomon Codes to the Berlekamp-Massey Algorithm
1 / 32 From the Eucldean Algorthm for Solvng a Key Equaton for Dual Reed Solomon Codes to the Berlekamp-Massey Algorthm Mara Bras-Amorós, Mchael E O Sullvan The Claude Shannon Insttute Workshop on Codng
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 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 informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
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 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 informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
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 Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
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 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 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 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 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 informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
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 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 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 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 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 informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
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 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 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 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 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 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 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 informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
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 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 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 informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
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 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 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 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 information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
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 informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationMTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i
MTH 819 Algebra I S13 Homework 1/ Solutons Defnton A. Let R be PID and V a untary R-module. Let p be a prme n R and n Z +. Then d p,n (V) = dm R/Rp p n 1 Ann V (p n )/p n Ann V (p n+1 ) Note here that
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 informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
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 informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013
COS 511: heoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 15 Scrbe: Jemng Mao Aprl 1, 013 1 Bref revew 1.1 Learnng wth expert advce Last tme, we started to talk about learnng wth expert advce.
More informationModelli Clamfim Equazioni differenziali 7 ottobre 2013
CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
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 informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
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 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 informationMDS Array Codes for Correcting a Single Criss-Cross Error
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
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
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 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 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 informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationLecture 2: Gram-Schmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
More informationMATH Sensitivity of Eigenvalue Problems
MATH 537- Senstvty of Egenvalue Problems Prelmnares Let A be an n n matrx, and let λ be an egenvalue of A, correspondngly there are vectors x and y such that Ax = λx and y H A = λy H Then x s called A
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
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 informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
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 informationChapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of
Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
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 informationCOMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX
COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A MATRIX J Mc Laughln 1 Mathematcs Department Trnty College 300 Summt Street, Hartford, CT 06106-3100 amesmclaughln@trncolledu Receved:, Accepted:,
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 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 informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
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 informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
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 informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
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 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 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 informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
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 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 informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
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 informationECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)
ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)
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 information