Nonuniform Codes for Correcting Asymmetric Errors
|
|
- Luke Jacobs
- 5 years ago
- Views:
Transcription
1 2011 IEEE Iteratioal Symposium o Iformatio Theory Proceedigs Nouiform Codes for Correctig Asymmetric Errors Hogchao Zhou Electrical Egieerig Departmet Califoria Istitute of Techology Pasadea, CA hzhou@caltechedu Axiao (Adrew Jiag Computer Sciece ad Egieerig Departmet Texas A&M Uiversity College Statio, TX aiag@csetamuedu Jehoshua Bruck Electrical Egieerig Departmet Califoria Istitute of Techology Pasadea, CA bruck@caltechedu Abstract Codes that correct asymmetric errors have importat applicatios i storage systems, icludig optical disks ad Read Oly Memories The costructio of asymmetric error correctig codes is a topic that was studied extesively, however, the existig approach for code costructio assumes that every codeword could sustai t asymmetric errors Our mai observatio is that i cotrast to symmetric errors, the error probability of a codeword is cotext idepedet (sice the error probability for 1s ad 0s is idetical, asymmetric errors are cotext depedet For example, the all-1 codeword has a higher error probability tha the all-0 codeword (sice the oly errors are 1 0 We call the existig codes uiform codes while we focus o the otio of ouiform codes, amely, codes whose codewords ca tolerate differet umbers of asymmetric errors depedig o their Hammig weights The goal of ouiform codes is to guaratee the reliability of every codeword, which is importat i data storage to retrieve whatever oe wrote i We prove a almost explicit upper boud o the size of ouiform asymmetric error correctig codes ad preset two geeral costructios We also study the rate of ouiform codes compared to uiform codes ad show that there is a potetial performace gai I INTRODUCTION Asymmetric error-correctig codes have importat applicatios i storage ad commuicatio systems, such as optical fibers, optical disks, VLSI circuits ad Read Oly Memories I such systems, the error probability from 1 to 0 is sigificatly higher tha the error probability from 0 to 1, which is modeled by biary asymmetric chael (the Z chael the trasmitted sequeces oly suffer oe type of errors, say 1 0 Asymmetric error-correctig codes have bee widely studied: I [1], Kløve summarized ad preseted several such codes I additio, a large amout of effort is cotributed to the desig of systematic codes [2], [3], costructig sigle or multiple error-correctig codes [4] [6], icreasig the lower bouds [7] [9] ad applyig LDPC codes i the cotext of asymmetric chaels [10] However, the existig approach for code costructio is similar to the approach take i the costructio of symmetric error correctig codes, amely, it assumes that every codeword could sustai t asymmetric errors As a result, differet codewords might have differet reliability To see this, let s cosider errors to be iid, every bit that is a 1 ca chage to a 0 by a asymmetric error with crossover probability p > 0 For a codeword x = (x 1, x 2,, x {0, 1}, let w(x = {i : 1 i, x i = 1} deote the Hammig weight of x The the probability for x to have at most t asymmetric errors is P t (x = P (t, w(x, p, P (t, m, p t i=0 ( m p i (1 p m i i Sice x ca correct t errors, P t (x is the probability of correctly decodig x (assumig codewords with more tha t errors are ucorrectable It ca be readily observed that the reliability of codewords decreases whe their Hammig weights icrease Differet from telecommuicatio applicatios, i data s- torage we care about the worst-case performace, amely, we eed guaratee that every codeword ca be correctly decoded with very high probability I this case, it is ot desired to let all the codewords tolerate the same umber of asymmetric errors, sice the codeword with the highest Hammig weight will become a bottleeck ad limit the code rate This motivated us to propose the cocept of ouiform codes, whose codewords ca tolerate differet umbers of asymmetric errors based o their Hammig weights The obective is to guaratee the reliability of every codeword That is, we cosider the worst-case istead of the average-case reliability of the codewords Give this costrait, we would like to maximize the size of the code Specifically, let q e < 1 to be maximal tolerated error probability for each codeword ad let t(x deote the umber of asymmetric errors that x ca correct The give a code C, for every codeword x C, we have P (t(x, w(x, p 1 q e, so that every erroeous codeword ca be corrected with probability at least 1 q e The rest of the paper is orgaized as follows I Sectio II, we provide some defiitios ad properties related to ouiform codes I Sectio III, we give a almost explicit upper boud for the size of ouiform codes Two geeral costructios, based o multiple layers or bit flips, are proposed i Sectio IV ad Sectio V Fially, Sectio VI studies the asymptotic rates of ouiform codes ad uiform codes (both upper bouds ad lower bouds A exteded versio of this paper with detailed proofs ad explaatios is give i [16] /11/$ IEEE 1011
2 II DEFINITIONS AND PROPERTIES A code C is called a ouiform (, p, q e code if for each codeword x C, it ca correct t(w(x asymmetric errors, t(w = mi{s N P (s, w, p 1 q e } (1 That implies each codeword i C ca be recovered with probability at least 1 q e The maximum size of a ouiform (, p, q e code is deoted by B β (, p, q e As compariso, most existig error-correctig codes are uiform codes For a code C of codeword legth, the Hammig weight of its codewords is at most (Ad i may existig asymmetric error-correctig codes, the maximum codeword weight ideed equals [1] So we defie C to be a uiform (, p, q e code if every codeword ca correct t asymmetric errors, t = t( = mi{s N P (s,, p 1 q e } The maximum size of a uiform (, p, q e code is deoted by B α (, p, q e Lemma 1 For ay 0 < p, q e < 1 ad iteger w i [0, ], we have 0 t(w + 1 t(w 1 for a ouiform (, p, q e code Give two biary vectors x = (x 1,, x ad y = (y 1,, y, we say x y if ad oly if x i y i for all 1 i Let S s (x be the set of vectors obtaied by chagig at most s 1 s i x ito 0 s, ie, S s (x = {v {0, 1} v x ad N(x, v s} N(x, y {i : x i = 1, y i = 0} Let S s,s(x be the set of vectors obtaied by chagig at most s 0 s i x ito 1 s or at most s 1 s i x ito 0 s, ie, S s,s(x = {v {0, 1} v x ad N(x, v s} {v {0, 1} x v ad N(v, x s } Note that S s (x = S 0,s (x The followig properties of ouiform codes ca be easily proved, as the geeralizatios of those for uiform codes, icludig Lemmas 22, 23, 32, 33 i [1] Lemma 2 Code C is a ouiform (, p, q e code if ad oly if S t(w(x (x S t(w(y (y = ø for all x, y C with x y Lemma 3 There always exists a ouiform (, p, q e code of the maximum size that cotais the all-zero codeword Give a ouiform code C, let C r deote the umber of codewords with Hammig weight r i C, ie C r = {x C w(x = r} Lemma 4 Let C be a ouiform (, p, q e code ad t(w is defied i (1 For iteger r i [0, ], let s be a iteger such that 0 s t(r s ad let k = max{z 0 z, z (t(z s r}, the we have s ( r + =1 C r + t(k s ( r + C r+ ( r Note that i Lemma 4, if we let s = 0, the we ca get t(k ( r + C r+ ( r k = max{z 0 z, z t(z r} This iequality will be used to get a almost explicit upper boud for the size of ouiform codes III AN ALMOST EXPLICIT UPPER BOUND We ow derive a almost explicit upper boud for the size of ouiform codes, followed the idea of Kløve [11] for uiform codes First, we defie h(r = max{w 0 w, w t(w = r}, h(r = mi{w 0 w, w t(w = r} Ad let M β (, p, q e = max z r, the maximum is take over the followig costraits: 1 z r are o-egative real umbers; 2 z 0 = 1; 3 t(h(r ( r+ zr+ ( r for r 0 The M β (, p, q e is a upper boud for B β (, p, q e Here, coditio 2 is give by Lemma 3, ad coditio 3 is give by Equ (2 from Lemma 4 Our goal i this sectio is to fid a almost explicit way to express M β (, p, q e Lemma 5 Assume z r is maximized over z 0, z 1,, z i the problem above Let Z r = mi{ r,t(h(r} The Z r = ( r for r t( ( r + z r+ Proof: Suppose that Z r < ( r for some r t( Let g = h(r ad k = mi{w z w > 0, w > g} Let m = max{w k t(k > w} The it ca be proved that for all r < w m, Z w < ( w Now, we costruct a ew group of real umbers z0, z1,, z such that 1 zg = z g + 2 zk = z k δ 3 zr = z r for r h, r k with w Zw = mi({( ( g r w m} w k w {( ( g k m < w g}, wz 1 δ = mi{ ( w k ( w m < w g} g (2 1012
3 For such, δ, it is ot hard to prove that Zr 0 r O the other had, zr = z r + δ > z r, = ( r for which cotradicts our assumptio that z r is maximized over the costrais So the lemma is true Similarly, usig the same idea as above, we ca get the followig lemma Lemma 6 Assume z r is maximized over z 0, z 1,, z i the problem above Let Y r = mi{ r,t(h(r} The Y r = ( r for r t( ( r + z r+ Now let y 0, y 1,, y be a group of optimal solutios to z 0, z 1,, z that maximize z r The y 0, y 1,, y satisfy the coditio i Lemma 6 We see that y 0 = 1 The based o Lemma 6, we ca get y 1,, y uiquely by iteratio Hece, we have the followig theorem for the upper boud M β (, p, q e Theorem 7 Let y 0, y 1,, y be defied by 1 y 0 = 1; 2 y r = 0, 1 r max{s 1 s, s t(s}; 3 y r = ( t(r 1 [( t(r r r t(r =1 y ( r r t(r ], max{s 1 s, s t(s} < r The B β (, p, q e M β (, p, q e = y r This theorem provides a almost explicit expressio for the upper boud M β (, p, q e, which is much easier to calculate tha the equivalet expressio defied at the begiig of this sectio IV CONSTRUCTIONS BASED ON MULTIPLE LAYERS I [1], Kløve summarized some costructios of uiform codes for correctig asymmetric errors The code of Kim ad Freima was the first code costructed for correctig multiple asymmetric errors Varshamov [12] ad Costrai ad Rao [13] preseted some costructios based group theory Later, Delsarte ad Piret [14] proposed a costructio based o expurgatig/pucturig with some improvemets give by Weber et al [15] I this sectio, we propose a geeral costructio of ouiform codes based o multiple layers From the defiitio of ouiform codes, we kow that t(w ca be easily ad uiquely determied by p, q e So a questio arises: if, t(w (for 0 w are give, how to costruct a ouiform code efficietly? Ituitively, we ca divide all the codewords of a ouiform code ito at most t( + 1 layers such that all the codewords i the i th layer (with 0 i t( ca tolerate at least i asymmetric errors I other words, the code is the combiatio of up to t( + 1 uiform codes, each of which corrects a differet umber of asymmetric errors However, we caot desig such a code by costructig codewords idepedetly for differet layers, because a simple combiatio of several idepedet codes may violate the error correctio requiremets of the ouiform codes, due to the iterferece betwee two eighbor layers Our idea is simple: let s first costruct a code which ca tolerate t( asymmetric errors The we add some codewords to the lowest t( layers such that the codewords i the top layer keep uchaged ad they still ca tolerate t( asymmetric errors, ad the codewords i the other layers ca tolerate up to t( 1 asymmetric errors Iteratively, we ca cotiue to add may codeword ito the lowest t( 1 layers Based o this idea, give, t(w, we costruct layered codes as follows Theorem 8 (Layered Codes Let k = t( ad let C 0, C 1,, C k be k + 1 biary codes of codeword legth, C 0 C 1 C k ad for 0 t k, the code C t ca correct t asymmetric errors Let C = {x {0, 1} x C t (w(x}, t (w(x = t(max{w w t(w w(x} The for all x C, x ca tolerate t(w(x asymmetric errors Proof: We prove that for all x, y C with x y, S t(w(x (x S t(w(y (y = ø Wlog, we assume w(x w(y If w(x t(w(x > w(y, the coclusio is true If w(x t(w(x w(y ad w(x w(y, we have S t(w(x (x S t(w(y (y S t (w(y(x S t (w(y(y However, we kow that x C t (w(x C t (w(y ad y C t (w(y, therefore S t (w(y(x S t (w(y(y = ø Furthermore, we have S t(w(x (x S t(w(y (y = ø We see that the costructios of layered codes are based o the provided group of codes C 0, C 1,, C k such that C 0 C 1 C k ad for 0 t k, the code C t ca correct t asymmetric errors Examples of such codes iclude Varshamov codes [12], BCH codes, etc Oe costructios of BCH codes ca be described as follows: Let (α 0, α 1,, α 1 be distict ozero elemets of G 2 m with = 2 m 1 For 0 t k, let C t := {x {0, 1} x i α (2l 1 i = 0 for 1 l t} i=1 I the above example, assume x is a codeword i C t ad y = x + e is a received word with error e, the there is a efficiet algorithm to decode y ito a codeword, which is deoted by D t (y If y has at most t asymmetric errors, the D t (y = x I the followig theorem, we show that the layered codes proposed above also have a efficiet decodig algorithm if D t ( (for 0 t k are provided ad efficiet Theorem 9 (Decodig of Layered Codes Let C be a layered code, let x C be a codeword, ad let y = x + e be a received word such that e = N(x, y t(w(x (Here e is the asymmetric-error vector The there exists at least oe iteger t such that 1013
4 1 t (w(y t t (w(y + t (w(y; 2 D t (y C; 3 y D t (y ad N(D t (y, y t(w(d t (y For such t, we have D t (y = x Proof: If we let t = t (w(x, the we ca get that t satisfies the coditios ad D t (y = x So such t exists Now we oly eed to prove that oce there exists t satisfyig the coditios i the theorem, we have D t (y = x We prove this by cotradictio Assume there exists t satisfyig the coditios but z = D t (y x The N(z, y t(w(z ad N(x, y t(w(x, which cotradicts the property of the layered codes Accordig to the above theorem, to decode a oisy word y, we ca check all the itegers betwee t (w(y ad t (w(y+ t (w(y to fid the value of t Oce we fid the iteger t satisfyig the coditios i the theorem, we ca decode y ito D t (y directly (Note that t (w(y + t (w(y t (w(y is ormally much smaller tha w(y It is approximately p 2 (1 p 2 w(y whe w(y is large We see that this decodig process is efficiet if D t ( is efficiet for 0 t k V CONSTRUCTIONS BASED ON BIT FLIPS May o-liear codes desiged to correct asymmetric errors do ot yet have efficiet ecodig algorithms Namely, it is ot easy to fid a efficiet ecodig fuctio f : {0, 1} k C with k log C O the other had, i [12], Varshamov showed that liear codes have early the same ability to correct asymmetric errors ad symmetric errors (for the uiform code case I this subsectio, we focus o the approach of desigig ouiform codes for asymmetric errors with efficiet ecodig schemes, by utilizig the well studied liear codes for symmetric errors We ca use a liear code to correct t( asymmetric errors directly, but this method is iefficiet ot oly because the decodig sphere for symmetric errors is greater tha the sphere for asymmetric errors (ad therefore a overkill, but also because for low-weight codewords, the umber of asymmetric errors they eed to correct ca be much smaller tha t( Our idea is to build a flippig code that uses oly low-weight codewords (specifically, codewords of Hammig weight o more tha 2, because they eed to correct fewer asymmetric errors ad therefore ca icrease the code s rate I the rest of this sectio, we preset two differet costructios A First Costructio First, costruct a liear code C (like BCH codes of legth with geerator matrix G that corrects t( 2 symmetric errors Assume the dimesio of the code is k For ay biary message u {0, 1} k, we ca map it to a codeword x i C such that x = ug Next, let x deote a word obtaied by flippig all the bits i x such that if x i = 0 the x i = 1 ad if x i = 1 the x i = 0; ad let y deote the fial codeword correspodig to u We check whether w(x > 2 ad costruct y i the followig way: { x000 if w(x > y = 2 x111 otherwise Here, the auxiliary bits (0 s or 1 s are added to distiguish that whether x has bee flipped or ot, ad they form a repetitio code to tolerate errors The correspodig decodig process is straightforward: Assume we received a word y If there is at least oe 1 i the auxiliary bits, the we flip the word by chagig all 0 s to 1 s ad all 1 s to 0 s; otherwise, we keep the word uchaged The we apply the decodig scheme of the code C to the first bits of the word Fially, the message u ca be successfully decoded if y has at most t( 2 errors i the first bits B Secod Costructio I the previous costructio, several auxiliary bits are eeded to protect oe bit of iformatio, which is ot very efficiet I this sectio, we try to move this bit ito the message part of the codewords i C This motivates us to give the followig costructio Let C be a liear code with legth that corrects t symmetric errors (we will specify t later Assume the dimesio of the code is k Now, for ay biary message u {0, 1} k 1 of legth k 1, we get u = 0u by addig oe bit 0 i frot of u The we ca map u to a codeword x i C such that x = (0uG = 0uv G is the geerator matrix of C i systematic form ad the legth of v is k Let α be a codeword i C such that the first bit α 1 = 1 ad its weight is the maximal oe amog all the codeword i C, ie, α = arg max w(x x C,x 1 =1 Geerally, w(α is very close to I order to reduce the weights of the codewords, we use the followig operatios: Calculate the relative weight w(x α = {1 i x i = 1, α i = 1} The we get the fial codeword { x + α if w(x α > w(α y = 2 x otherwise + is the biary sum, so x + α is to flip the bits i x correspodig the oes i α So far, we see that the maximal weight for y is w(α 2 That meas we eed to select t such that t = t( w(α 2 I the above ecodig process, for differet biary messages, they have differet codewords Ad for ay codeword y, we have y C That is because either y = x or y = x + α, both x ad α are codewords i C ad C is a liear code The decodig process is very simple: Give the received word y = y + e, we ca always get y by applyig the decodig scheme if e t If y 1 = 1, that meas x has bee flipped based o α, so we have x = y + α; otherwise, x = y The the iitial message u = x 2 x 3 x k 1014
5 Lower Boud Upper Boud η α (, p, q e [1 H(2p]I 0 p 1 4 (1 + p[1 H( p 1+p ] η β (, p, q e max 0 θ 1 p H(θ θh(p (1 θh( pθ 1 θ TABLE I max 0 θ 1 H((1 pθ θh(p C Commets Whe is sufficietly large, the codes based o flips above become early as efficiet as a liear codes correctig t( 2 symmetric errors (We defie the codes efficiecy i Sectio VI It is much more efficiet tha desigig a liear code correctig t( symmetric errors Note that whe is large ad p is small, these codes ca have very good performace o efficiecy That is because whe is sufficietly large, the efficiecy of a optimal ouiform code is domiated by the codewords with the same Hammig weight w d ( 2, ad w d approaches 2 as p gets close to 0 We ca ituitively uderstad it based o two facts whe is sufficietly large: (1 There are at most 2 (H( w d +δ codewords i this optimal ouiform code (2 Whe p becomes small, we ca get a ouiform code with at least 2 (1 δ codewords So whe is sufficietly large ad p is small, we have w d 2 Hece, the optimal ouiform code has almost the same asymptotic efficiecy with a optimal weight-bouded code (Hammig weight is at most /2, which corrects t(/2 errors Beside simplicity ad efficiecy, aother advatage of these codes is that they do ot require the Z-chael to be perfect, ie, it is allowed to have 0 1 errors with very small probability (as log as this probability is smaller tha the probability of 1 0 errors All these properties make these codes very useful i practice However, whe p is ot small, how to desig efficiet ouiform codes with simple ecodig/decodig schemes is still a ope problem VI BOUNDS ON THE RATE Give (, p, q e, we ca defie the efficiecy of uiform codes as η α (, p, q e log 2 B α(,p,q e ad defie the efficiecy of ouiform codes as η β (, p, q e log 2 B β(,p,q e I this sectio, give 0 < p, q e < 1, we study the asymptotic behavior of η α (, p, q e ad η β (, p, q e as Table I summarizes the upper bouds ad lower bouds of η α (, p, q e ad η β (, p, q e obtaied i our full paper [16] We plot them i Fig 1 The gap betwee the bouds for the two codes idicates the potetial improvemet i efficiecy by usig the ouiform codes (compared to usig uiform codes whe the codeword legth is large ACKNOWLEDGMENT This work was supported i part by the NSF CAREER Award CCF , the NSF grat ECCS , ad by a NSF-NRI award REFERENCES [1] T Kløve, Error correctig codes for the asymmetric chael, Techical Report, Dept of Iformatics, Uiversity of Berge, 1981 (Updated i 1995 Efficiecy η Bouds for uiform codes Bouds for ouiform codes Crossover probability p Fig 1 Bouds to η α (, p, q e ad η β (, p, q e The dashed curves represet the lower ad upper bouds to η α(, p, q e, ad the solid curves represet the lower ad upper bouds to η β (, p, q e [2] K A S Abdel-Ghaffar ad H C Ferreira, Systematic ecodig of the Varshamov-Teegol ts codes ad the Costati-Rao codes, IEEE Tras Iform Theory, vol 44, pp , Ja 1998 [3] B Bose ad S Al-Bassam, O systematic sigle asymmetric errorcorrectig codes, IEEE Tras Iform Theory, vol 46, pp , Mar 2000 [4] S Al-Bassam, R Vekatesa, ad S Al-Muhammadi, New sigle asymmetric error-correctig codes, IEEE Tras Iform Theory, vol 43, pp , Sept 1997 [5] Y Saitoh, K Yamaguchi, ad H Imai, Some ew biary codes correctig asymmetric/uidirectioal errors, IEEE Tras Iform Theory, vol 36, pp , May 1990 [6] L G Tallii, B Bose, O a ew class of error cotrol codes ad symmetric fuctios, IEEE Iteratioal Symposium o Iformatio Theory (ISIT, pp , 2008 [7] T Etzio, Lower bouds for asymmetric ad uidirectioal codes, IEEE Tras Iform Theory, vol 37, pp , Nov 1991 [8] Z Zhag ad X Xia, New lower bouds for biary codes of asymmetric distace two, IEEE Tras Iform Theory, vol 38, pp , Sept 1992 [9] F Fu, S Lig, ad C Xig, New lower bouds ad costructios for biary codes correctig asymmetric errors, IEEE Tras Iform Theory, vol 49, pp , Dec 2003 [10] C Wag, S R Kulkari, ad H V Poor, Desity evolutio for asymmetric memoryless chaels, IEEE Tras Iform Theory, vol 51, pp , Dec 2005 [11] T Kløve, Upper bouds o codes correctig asymmetric errors, IEEE Tras Iform Theory, vol 27, o 1, pp , 1981 [12] R R Varshamov, A class of codes for asymmetric chaels ad a problem from the additive theory of umbers, IEEE Tras Iform Theory, vol 19, o 1, pp 92-95, 1973 [13] S D Costati ad T R N Rao, O the theory of biary asymmetric error-correctig codes, Iform Cotr, vol 40, pp 20-36, 1979 [14] P Delsarte ad P Piret, Bouds ad costructios for biary asymmetric error-correctig codes, IEEE Tras Iform Theory, vol 27, pp , 1981 [15] J H Weber, C de Vroedt, ad D E Boekee, Bouds ad costructios for biary codes of legth less tha 24 ad asymmetric distace less tha 6, IEEE Tras Iform Theory, vol 34, pp , Sept 1988 [16] H Zhou, A Jiag, ad J Bruck, Nouiform codes for correctig asymmetric errors i data storage, Techical Report, Califoria Istitute of Techology,
Rank Modulation with Multiplicity
Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationInformation Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame
Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for
More informationLecture 1: Basic problems of coding theory
Lecture 1: Basic problems of codig theory Error-Correctig Codes (Sprig 016) Rutgers Uiversity Swastik Kopparty Scribes: Abhishek Bhrushudi & Aditya Potukuchi Admiistrivia was discussed at the begiig of
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationChannel coding, linear block codes, Hamming and cyclic codes Lecture - 8
Digital Commuicatio Chael codig, liear block codes, Hammig ad cyclic codes Lecture - 8 Ir. Muhamad Asial, MSc., PhD Ceter for Iformatio ad Commuicatio Egieerig Research (CICER) Electrical Egieerig Departmet
More informationEntropies & Information Theory
Etropies & Iformatio Theory LECTURE I Nilajaa Datta Uiversity of Cambridge,U.K. For more details: see lecture otes (Lecture 1- Lecture 5) o http://www.qi.damtp.cam.ac.uk/ode/223 Quatum Iformatio Theory
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationProperties of Fuzzy Length on Fuzzy Set
Ope Access Library Joural 206, Volume 3, e3068 ISSN Olie: 2333-972 ISSN Prit: 2333-9705 Properties of Fuzzy Legth o Fuzzy Set Jehad R Kider, Jaafar Imra Mousa Departmet of Mathematics ad Computer Applicatios,
More information6.895 Essential Coding Theory October 20, Lecture 11. This lecture is focused in comparisons of the following properties/parameters of a code:
6.895 Essetial Codig Theory October 0, 004 Lecture 11 Lecturer: Madhu Suda Scribe: Aastasios Sidiropoulos 1 Overview This lecture is focused i comparisos of the followig properties/parameters of a code:
More informationLecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound
Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationInequalities for Entropies of Sets of Subsets of Random Variables
Iequalities for Etropies of Sets of Subsets of Radom Variables Chao Tia AT&T Labs-Research Florham Par, NJ 0792, USA. tia@research.att.com Abstract Ha s iequality o the etropy rates of subsets of radom
More informationROTATION-EQUIVALENCE CLASSES OF BINARY VECTORS. 1. Introduction
t m Mathematical Publicatios DOI: 10.1515/tmmp-2016-0033 Tatra Mt. Math. Publ. 67 (2016, 93 98 ROTATION-EQUIVALENCE CLASSES OF BINARY VECTORS Otokar Grošek Viliam Hromada ABSTRACT. I this paper we study
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationLecture 7: Channel coding theorem for discrete-time continuous memoryless channel
Lecture 7: Chael codig theorem for discrete-time cotiuous memoryless chael Lectured by Dr. Saif K. Mohammed Scribed by Mirsad Čirkić Iformatio Theory for Wireless Commuicatio ITWC Sprig 202 Let us first
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationElement sampling: Part 2
Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationVector Permutation Code Design Algorithm. Danilo SILVA and Weiler A. FINAMORE
Iteratioal Symposium o Iformatio Theory ad its Applicatios, ISITA2004 Parma, Italy, October 10 13, 2004 Vector Permutatio Code Desig Algorithm Dailo SILVA ad Weiler A. FINAMORE Cetro de Estudos em Telecomuicações
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationDe Bruijn Sequences for the Binary Strings with Maximum Specified Density
De Bruij Sequeces for the Biary Strigs with Maximum Specified Desity Joe Sawada 1, Brett Steves 2, ad Aaro Williams 2 1 jsawada@uoguelph.ca School of Computer Sciece, Uiversity of Guelph, CANADA 2 brett@math.carleto.ca
More informationOPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES
OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationDe Bruijn Sequences for the Binary Strings with Maximum Density
De Bruij Sequeces for the Biary Strigs with Maximum Desity Joe Sawada 1, Brett Steves 2, ad Aaro Williams 2 1 jsawada@uoguelph.ca School of Computer Sciece, Uiversity of Guelph, CANADA 2 brett@math.carleto.ca
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationCooperative Communication Fundamentals & Coding Techniques
3 th ICACT Tutorial Cooperative commuicatio fudametals & codig techiques Cooperative Commuicatio Fudametals & Codig Techiques 0..4 Electroics ad Telecommuicatio Research Istitute Kiug Jug 3 th ICACT Tutorial
More informationgcd(n, k) = 1 Kwang Ho Kim 1 and Sihem Mesnager 2 Pyongyang, Democratic People s Republic of Korea
Solvig x 2k + + x + a = 0 i F 2 gcd, k = with Kwag Ho Kim ad Sihem Mesager 2 Istitute of Mathematics, State Academy of Scieces ad PGItech Corp., Pyogyag, Democratic People s Republic of Korea khk.cryptech@gmail.com
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationCHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS
CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationInformation Theory and Coding
Sol. Iformatio Theory ad Codig. The capacity of a bad-limited additive white Gaussia (AWGN) chael is give by C = Wlog 2 ( + σ 2 W ) bits per secod(bps), where W is the chael badwidth, is the average power
More informationBasics of Probability Theory (for Theory of Computation courses)
Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.
More information1 Hash tables. 1.1 Implementation
Lecture 8 Hash Tables, Uiversal Hash Fuctios, Balls ad Bis Scribes: Luke Johsto, Moses Charikar, G. Valiat Date: Oct 18, 2017 Adapted From Virgiia Williams lecture otes 1 Hash tables A hash table is a
More informationEECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1
EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum
More informationLecture 9: Expanders Part 2, Extractors
Lecture 9: Expaders Part, Extractors Topics i Complexity Theory ad Pseudoradomess Sprig 013 Rutgers Uiversity Swastik Kopparty Scribes: Jaso Perry, Joh Kim I this lecture, we will discuss further the pseudoradomess
More informationEfficient GMM LECTURE 12 GMM II
DECEMBER 1 010 LECTURE 1 II Efficiet The estimator depeds o the choice of the weight matrix A. The efficiet estimator is the oe that has the smallest asymptotic variace amog all estimators defied by differet
More informationEnd-of-Year Contest. ERHS Math Club. May 5, 2009
Ed-of-Year Cotest ERHS Math Club May 5, 009 Problem 1: There are 9 cois. Oe is fake ad weighs a little less tha the others. Fid the fake coi by weighigs. Solutio: Separate the 9 cois ito 3 groups (A, B,
More informationLecture 11: Channel Coding Theorem: Converse Part
EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig
More informationA Note on Matrix Rigidity
A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationIncreasing timing capacity using packet coloring
003 Coferece o Iformatio Scieces ad Systems, The Johs Hopkis Uiversity, March 4, 003 Icreasig timig capacity usig packet colorig Xi Liu ad R Srikat[] Coordiated Sciece Laboratory Uiversity of Illiois e-mail:
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationThe Choquet Integral with Respect to Fuzzy-Valued Set Functions
The Choquet Itegral with Respect to Fuzzy-Valued Set Fuctios Weiwei Zhag Abstract The Choquet itegral with respect to real-valued oadditive set fuctios, such as siged efficiecy measures, has bee used i
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationLecture 01: the Central Limit Theorem. 1 Central Limit Theorem for i.i.d. random variables
CSCI-B609: A Theorist s Toolkit, Fall 06 Aug 3 Lecture 0: the Cetral Limit Theorem Lecturer: Yua Zhou Scribe: Yua Xie & Yua Zhou Cetral Limit Theorem for iid radom variables Let us say that we wat to aalyze
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationAppendix to Quicksort Asymptotics
Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 18
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2013 Aat Sahai Lecture 18 Iferece Oe of the major uses of probability is to provide a systematic framework to perform iferece uder ucertaity. A
More informationConfidence interval for the two-parameter exponentiated Gumbel distribution based on record values
Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values
More informationGeneralized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices
Geeralized Reed-Solomo Codes with Sparsest ad Balaced Geerator Matrices Wetu Sog ad Kui Cai Sigapore Uiversity of Techology ad Desig, Sigapore Email: {wetu sog, cai kui}@sutd.edu.sg arxiv:1801.02315v1
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationRADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify
Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationHow to Maximize a Function without Really Trying
How to Maximize a Fuctio without Really Tryig MARK FLANAGAN School of Electrical, Electroic ad Commuicatios Egieerig Uiversity College Dubli We will prove a famous elemetary iequality called The Rearragemet
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationIntro to Learning Theory
Lecture 1, October 18, 2016 Itro to Learig Theory Ruth Urer 1 Machie Learig ad Learig Theory Comig soo 2 Formal Framework 21 Basic otios I our formal model for machie learig, the istaces to be classified
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015
ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More informationCS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016
CS161: Algorithm Desig ad Aalysis Hadout #10 Staford Uiversity Wedesday, 10 February 2016 Lecture #11: Wedesday, 10 February 2016 Topics: Example midterm problems ad solutios from a log time ago Sprig
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationProof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationBinary codes from graphs on triples and permutation decoding
Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC 29634 U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationFormation of A Supergain Array and Its Application in Radar
Formatio of A Supergai Array ad ts Applicatio i Radar Tra Cao Quye, Do Trug Kie ad Bach Gia Duog. Research Ceter for Electroic ad Telecommuicatios, College of Techology (Coltech, Vietam atioal Uiversity,
More informationSymmetric Two-User Gaussian Interference Channel with Common Messages
Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX
More informationLecture 10: Universal coding and prediction
0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More information