Linear time list recovery via expander codes
|
|
- Ronald Kelley
- 5 years ago
- Views:
Transcription
1 Linear time list recovery via expander codes Brett Hemenway and Mary Wootters June 7 26
2 Outline Introduction List recovery Expander codes List recovery of expander codes Conclusion
3 Our Results One slide version Inner code + expander graph Expander code
4 Our Results One slide version Inner code + expander graph Expander code [SS96, Spi96, Zem, BZ2, BZ5, BZ6] Inner code has decent distance So does the expander code and it s decodable in linear time!
5 Our Results One slide version Inner code + expander graph Expander code [SS96, Spi96, Zem, BZ2, BZ5, BZ6] [HOW3] Inner code has decent distance Inner code has decent locality So does the expander code and it s decodable in linear time! So does the expander code and it s locally decodable in sub-linear time!
6 Our Results One slide version Inner code + expander graph Expander code [SS96, Spi96, Zem, BZ2, BZ5, BZ6] [HOW3] Moral? Inner code has decent distance Inner code has decent locality Inner code has decent So does the expander code and it s decodable in linear time! So does the expander code and it s locally decodable in sub-linear time! So does the expander code and there s an efficient algorithm!
7 Our Results One slide version Inner code + expander graph Expander code [SS96, Spi96, Zem, BZ2, BZ5, BZ6] [HOW3] Moral? Inner code has decent distance Inner code has decent locality Inner code has decent This work: Inner code has decent list-recoverability So does the expander code and it s decodable in linear time! So does the expander code and it s locally decodable in sub-linear time! So does the expander code and there s an efficient algorithm! So does the expander code and it s list-recoverable in linear time!
8 Our Results One Two slide version Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! List-recoverable: decodable from uncertainty (instead of errors).
9 Our Results One Two slide version Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! List-recoverable: decodable from uncertainty (instead of errors). Known linear-time list-recoverable codes have rate < /2.
10 Our Results One Two slide version Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! List-recoverable: decodable from uncertainty (instead of errors). Known linear-time list-recoverable codes have rate < /2. Expander codes can have rate ε!
11 Our Results One Two slide version Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! List-recoverable: decodable from uncertainty (instead of errors). Known linear-time list-recoverable codes have rate < /2. Expander codes can have rate ε! We can plug our codes into [Meir 4] and get the optimal rate/error trade-off, for any rate.
12 Outline Introduction List recovery Expander codes List recovery of expander codes Conclusion
13 List Decoding
14 List Decoding G O O D T I M E F O R P I E
15 List Decoding G O OX DA TC IU MO E FV OR RT P I E
16 List Decoding GOODTIMEFORPIE GOATSATEALLPIE
17 List Recovery G L M Y W O O I V D A E A H T N I T B D M E F T R I T I G O E E V L E T L P I E E H
18 List Recovery G L M Y W O O I V D A E A H T N I T B D M E F T R I T I G O E E V L E T L P I E E H
19 List Recovery GOODTIMEFORPIE MYWHATBIGTEETH LIVEANDLETLIVE G L M Y W O O I V D A E A H T N I T B D M E F T R I T I G O E E V L E T L P I E E H
20 List Recovery From Erasures GOODTIMEFORPIE MYWHATBIGTEETH LIVEANDLETLIVE G L M???? Y W D A N B E F T R I T O O E A I D I G O E E V I V H T T M L E T L P I E E H
21 List Recovery Definition Definition C Σ N is (α, l, L)-list-recoverable (from erasures) if: for any set of lists S,..., S N so that at least αn of them have size l, there are at most L codewords c C so that c i S i for all i.
22 List Recovery Definition Definition C Σ N is (α, l, L)-list-recoverable (from erasures) if: for any set of lists S,..., S N so that at least αn of them have size l, there are at most L codewords c C so that c i S i for all i. α fraction of codeword not erased l number of symbols in each slot L number of codewords that match Note: L l.
23 List decoding concatenated codes An application of list recovery message
24 List decoding concatenated codes An application of list recovery message C out
25 List decoding concatenated codes An application of list recovery message C out C in C in C in C in C in C in C in
26 List decoding concatenated codes An application of list recovery C out C in C in C in C in C in C in C in
27 List decoding concatenated codes An application of list recovery List decode C in C out C in C in C in C in C in C in C in
28 List decoding concatenated codes An application of list recovery List decode C in C out list list list list list list list C in C in C in C in C in C in C in
29 List decoding concatenated codes An application of list recovery List recover C out List decode C in C out list list list list list list list C in C in C in C in C in C in C in
30 List decoding concatenated codes An application of list recovery List recover C out {List of messages} List decode C in C out list list list list list list list C in C in C in C in C in C in C in Concatenated code is list decodable
31 List Recovery Applications Related to list decoding [GI2, GI3, GI4] Compressed sensing [NPR2, GNP + 3] Group testing [INR] Erasure model is weaker than error model (erasure model was studied before in [GI4])
32 Outline Introduction List recovery Expander codes List recovery of expander codes Conclusion
33 Tanner Codes [Tanner 8] Given: A d-regular graph G with n vertices and N = nd 2 An inner code C with block length d over Σ edges We get a Tanner code C. C has block length N and alphabet Σ. Codewords are labelings of edges of G. A labeling is in C if the labels on each vertex form a codeword of C. (We fix an arbitrary ordering of edges at each vertex)
34 Example [Tanner 8] G is K 8, and C is the [7, 4, 3]-Hamming code. N = ( 8 2) = 28 and Σ = {, }
35 Example [Tanner 8] G is K 8, and C is the [7, 4, 3]-Hamming code. A codeword of C is a labeling of edges of G. red blue (,,,,,,,,,,,,,,,,,,,,,,,,,,, ) C {, } 28
36 Example [Tanner 8] G is K 8, and C is the [7, 4, 3]-Hamming code. These edges form a codeword in the Hamming code red blue (,,,,,,,,,,,,,,,,,,,,,,,,,,, ) C {, } 28
37 Encoding Tanner Codes Encoding is Easy!. Generate parity-check matrix Requires: Edge-vertex incidence matrix of graph Parity-check matrix of inner code 2. Calculate a basis for the kernel of the parity-check matrix 3. This basis defines a generator matrix for the linear Tanner Code 4. Encoding is just multiplication by this generator matrix
38 Linearity If the inner code C is linear, so is the Tanner code C C = Ker(H ) for some parity check matrix H. x C H x =
39 Linearity If the inner code C is linear, so is the Tanner code C C = Ker(H ) for some parity check matrix H. x C H x = So codewords of the Tanner code C also are defined by linear constraints: v y y C v G, H = y Γ(v)
40 Example: vertex edge incidence matrix of K 8 row for each vertex column for each edge Columns have weight 2 (Each edge hits two vertices) Rows have weight 7 (Each vertex has degree seven)
41 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code Parity-check of Hamming code Edge-vertex incidence matrix of K 8
42 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code Vertex
43 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code
44 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code
45 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code
46 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code
47 If the inner code has good rate, so does the outer code Say that C is linear If C has rate r, it satisfies ( r )d linear constraints. Each of the n vertices of G must satisfy these constraints.
48 If the inner code has good rate, so does the outer code Say that C is linear If C has rate r, it satisfies ( r )d linear constraints. Each of the n vertices of G must satisfy these constraints. C is defined by at most n ( r )d constraints.
49 If the inner code has good rate, so does the outer code Say that C is linear If C has rate r, it satisfies ( r )d linear constraints. Each of the n vertices of G must satisfy these constraints. C is defined by at most n ( r )d constraints. Length of C = N = # edges = nd/2
50 If the inner code has good rate, so does the outer code Say that C is linear If C has rate r, it satisfies ( r )d linear constraints. Each of the n vertices of G must satisfy these constraints. C is defined by at most n ( r )d constraints. Length of C = N = # edges = nd/2 The rate of C is R = k N N n ( r )d N = 2r.
51 Better rate bounds? The lower bound R > 2r is independent of the ordering of edges around a vertex Tanner already noticed that order matters. Let G be the complete bipartite graph with 7 vertices per side Let C be the [7, 4, 3] hamming code Then different natural orderings achieve a Tanner code with [49, 6, 9] ( ) [49, 2, 6] ( ) [49, 7, 7] ( ) Meets lower bound of 2 7
52 Expander codes When the underlying graph is an expander graph, the Tanner code is a expander code. Expander codes admit very fast decoding algorithms [Sipser and Spielman 996] Further improvements in [Sipser 96, Zemor, Barg and Zemor 2, 5, 6]
53 Outline Introduction List recovery Expander codes List recovery of expander codes Conclusion
54 Linear-time list-recoverable codes Theorem (Main Theorem) Suppose that C is (α, l, L )-list recoverable from erasures. Suppose G is an expander graph of degree d. d needs to be big enough compared to l, L. Then the expander code C is (α, l, L)-list recoverable from erasures. It can be list-recovered in linear time. Above, α, L are constants (independent of n)....
55 Comparison with Previous Work Code Rate Decoding time Random code - ε lots Folded RS (+friends) [GR8, Gur, DL2] - ε poly(n) [GI3, GI4] /poly(l) O(n) This work (Random inner code) All list sizes L are constants but some are huge constants ε O(n)
56 Improving the rate/error tradeoff Theorem ( Dream theorem of Meir 4) Constructing codes of rate with property P and decent distance Constructing codes with P that approach the Singleton bound.
57 Improving the rate/error tradeoff Theorem For any R >, l >, and ε >, and for any large enough L, d, q (depending only on l, ε), there is a family of codes with: rate at least R (R + ε, l, L)-list-recoverable in linear time.
58 Improving the rate/error tradeoff The Or Meir Construction [Mei4] x C (x) z c y y C (y ) c y n C (y n ) c n F R m q F m q ( ) F R d n Redistribute q ( F d ) n according to G ( ) q F d n q
59 The algorithm Suppose that C is list-recoverable. S S 2... S d = {a,b}
60 The algorithm Suppose that C is list-recoverable. S S 2... c. c L a d c d c f b f c d c f a d b c r e t a b c b c d b a b x d e f a b z d e d a S d = {a,b}. List recover locally at this vertex: get {c,..., c L }
61 The algorithm Suppose that C is list-recoverable. S S 2... c. c L a d c d c f b f c d c f a d b c r e t a b c b c d b a b x d e f a b z d e d a S d = {a,b}. List recover locally at this vertex: get {c,..., c L } 2. What if we know this symbol is a?
62 The algorithm Suppose that C is list-recoverable. S S 2... c. c L a d c d c f b f c d c f a d b c r e t a b c b c d b a b x d e f a b z d e d a S d = {a,b}. List recover locally at this vertex: get {c,..., c L } 2. What if we know this symbol is a?
63 The algorithm Suppose that C is list-recoverable. S S 2... c. c L a d c d c f b f c d c f a d b c r e t a b c b c d b a b x d e f a b z d e d a S d = {a,b}. List recover locally at this vertex: get {c,..., c L } 2. What if we know this symbol is a?
64 The algorithm Suppose that C is list-recoverable. S S List recover locally at this vertex: get {c,..., c L } c S d = {a,b} 2. What if we know this symbol is a?. c L a d c d c f b f c d c f a d b c r e t a b c b c d b a b x d e f a b z d e d a 3. Then we know a bunch of other symbols too.
65 The algorithm Suppose that C is list-recoverable. S S List recover locally at this vertex: get {c,..., c L } c S d = {a,b} 2. What if we know this symbol is a?. c L a d c d c f b f c d c f a d b c r e t a b c b c d b a b x d e f a b z d e d a 3. Then we know a bunch of other symbols too. L l possible columns. Each choice fixes about d/l l others
66 The algorithm Suppose that C is list-recoverable Make one decision.
67 The algorithm Suppose that C is list-recoverable Make one decision.
68 The algorithm Suppose that C is list-recoverable Make one decision.
69 The algorithm Suppose that C is list-recoverable Make one decision.
70 The algorithm Suppose that C is list-recoverable Make one decision. Determine a bunch of other edges.
71 The algorithm Suppose that C is list-recoverable Make one decision. Determine a bunch of other edges. Make another decision.
72 The algorithm Suppose that C is list-recoverable Make one decision. Determine a bunch of other edges. Make another decision. Determine some more edges.
73 The algorithm Suppose that C is list-recoverable Make one decision. Determine a bunch of other edges. Make another decision. Determine some more edges....
74 The algorithm Suppose that C is list-recoverable Make one decision. Determine a bunch of other edges. Make another decision. Determine some more edges.... Correct the rest using regular decoding alg.
75 The algorithm Suppose that C is list-recoverable Make one decision. Determine a bunch of other edges. Make another decision. Determine some more edges.... Correct the rest using regular decoding alg. Number of possibilities = l number of decision edges = l O().
76 Why does propagation work? Equivalence classes of edges L > l so choosing single symbol won t determine CW L CWs, l choices per index L l possible columns (For each index i, L l maps from CW to symbol) (L l maps from [L] l) Edges are in same equivalance class (wrt vertex) if knowing one determines all the others Each vertex has d edges At most L l equivalence classes Average equivalence class is of size d/l l
77 Why does propagation work? Large Equivalance Classes Average size of an equivalence class is d/l l What if we get unlucky and pick an edge in a small equivalence class? By the expansion property of the graph there is a large (constant fraction) subset of edges that all have large equivalence class Probability a uniformly chosen edge covers an ε(ε λ) fraction of the graph is at least 3εl L
78 Results (R + η, l, L)-list recoverable codes Any R > Any l > Any η > L depends only on l, η Linear-time recovery algorithm
79 Outline Introduction List recovery Expander codes List recovery of expander codes Conclusion
80 Moral of the story Inner code has decent So does the expander code and there s an efficient algorithm!
81 Moral of the story Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time!
82 Moral of the story Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! Open Questions:
83 Moral of the story Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! Open Questions: What other properties can expander codes improve?
84 Moral of the story Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! Open Questions: What other properties can expander codes improve? Handle errors?
85 Moral of the story Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! Open Questions: What other properties can expander codes improve? Handle errors? Other applications with erasures?
86 Moral of the story Inner code has decent list-recoverability So does the expander code and it s list-recoverable in linear time! Open Questions: What other properties can expander codes improve? Handle errors? Other applications with erasures? Better inner code? Better constants?
87 The end Thanks!
88 References I Alexander Barg and Gilles Zemor. Error exponents of expander codes. Information Theory, IEEE Transactions on, 48(6): , June 22. Alexander Barg and Gilles Zemor. Concatenated codes: serial and parallel. Information Theory, IEEE Transactions on, 5(5): , May 25. Alexander Barg and Gilles Zemor. Distance properties of expander codes. Information Theory, IEEE Transactions on, 52():78 9, January 26. Zeev Dvir and Shachar Lovett. Subspace Evasive Sets. In STOC 2, pages , October 22.
89 References II Venkatesan Guruswami and Piotr Indyk. Near-optimal Linear-time Codes for Unique Decoding and New List-decodable Codes over Smaller Alphabets. In Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, STOC 2, pages 82 82, New York, NY, USA, 22. ACM. Venkatesan Guruswami and Piotr Indyk. Linear time encodable and list decodable codes. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, STOC 3, pages 26 35, New York, NY, USA, 23. ACM.
90 References III Venkatesan Guruswami and Piotr Indyk. Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. In SODA 4: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages , Philadelphia, PA, USA, 24. Society for Industrial and Applied Mathematics. Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, and Martin J. Strauss. 2/2-Foreach Sparse Recovery with Low Risk. In FedorV Fomin, Rsiņš Freivalds, Marta Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming, volume 7965 of Lecture Notes in Computer Science, pages Springer Berlin Heidelberg, 23.
91 References IV Venkatesan Guruswami and Atri Rudra. Concatenated Codes Can Achieve List-decoding Capacity. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 8, pages , Philadelphia, PA, USA, 28. Society for Industrial and Applied Mathematics. Venkatesan Guruswami. Linear-algebraic list decoding of folded Reed-Solomon codes. In IEEE Conference on Computational Complexity, pages 77 85, 2. Brett Hemenway, Rafail Ostrovsky, and Mary Wootters. Local Correctability of Expander Codes. In ICALP, LNCS. Springer, April 23.
92 References V Piotr Indyk, Hung Q. Ngo, and Atri Rudra. Efficiently decodable non-adaptive group testing. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 26 42, Philadelphia, PA, USA, 2. Society for Industrial and Applied Mathematics. Or Meir. Locally Correctable and Testable Codes Approaching the Singleton Bound. ECCC Report 24-7, 24. Hung Q. Ngo, Ely Porat, and Atri Rudra. Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. In Christoph Dürr and Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 22), volume 4 of Leibniz International
93 References VI Proceedings in Informatics (LIPIcs), pages 23 24, Dagstuhl, Germany, 22. Schloss Dagstuhl Leibniz-Zentrum fuer Informatik. Daniel A. Spielman. Linear-time encodable and decodable error-correcting codes. Information Theory, IEEE Transactions on, 42(6):723 73, November 996. Michael Sipser and Daniel A. Spielman. Expander codes. Information Theory, IEEE Transactions on, 42(6):7 722, November 996. Gilles Zemor. On expander codes. Information Theory, IEEE Transactions on, 47(2): , February 2.
Local correctability of expander codes
Local correctability of expander codes Brett Hemenway Rafail Ostrovsky Mary Wootters IAS April 4, 24 The point(s) of this talk Locally decodable codes are codes which admit sublinear time decoding of small
More informationLecture 6: Expander Codes
CS369E: Expanders May 2 & 9, 2005 Lecturer: Prahladh Harsha Lecture 6: Expander Codes Scribe: Hovav Shacham In today s lecture, we will discuss the application of expander graphs to error-correcting codes.
More informationLecture 28: Generalized Minimum Distance Decoding
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 007) Lecture 8: Generalized Minimum Distance Decoding November 5, 007 Lecturer: Atri Rudra Scribe: Sandipan Kundu & Atri Rudra 1
More informationLocal List Recovery of High-rate Tensor Codes & Applications
58th Annual IEEE Symposium on Foundations of Computer Science Local List Recovery of High-rate Tensor Codes & Applications Brett Hemenway Noga Ron-Zewi Mary Wootters Abstract In this work, we give the
More informationEfficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion Hung Q. Ngo 1, Ely Porat 2, and Atri Rudra 1 1 Department of Computer Science and Engineering University at Buffalo, SUNY,
More informationLecture 19: Elias-Bassalygo Bound
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecturer: Atri Rudra Lecture 19: Elias-Bassalygo Bound October 10, 2007 Scribe: Michael Pfetsch & Atri Rudra In the last lecture,
More informationList and local error-correction
List and local error-correction Venkatesan Guruswami Carnegie Mellon University 8th North American Summer School of Information Theory (NASIT) San Diego, CA August 11, 2015 Venkat Guruswami (CMU) List
More informationReport on PIR with Low Storage Overhead
Report on PIR with Low Storage Overhead Ehsan Ebrahimi Targhi University of Tartu December 15, 2015 Abstract Private information retrieval (PIR) protocol, introduced in 1995 by Chor, Goldreich, Kushilevitz
More informationLecture 4: Proof of Shannon s theorem and an explicit code
CSE 533: Error-Correcting Codes (Autumn 006 Lecture 4: Proof of Shannon s theorem and an explicit code October 11, 006 Lecturer: Venkatesan Guruswami Scribe: Atri Rudra 1 Overview Last lecture we stated
More informationNotes 10: List Decoding Reed-Solomon Codes and Concatenated codes
Introduction to Coding Theory CMU: Spring 010 Notes 10: List Decoding Reed-Solomon Codes and Concatenated codes April 010 Lecturer: Venkatesan Guruswami Scribe: Venkat Guruswami & Ali Kemal Sinop DRAFT
More informationLinear-algebraic pseudorandomness: Subspace Designs & Dimension Expanders
Linear-algebraic pseudorandomness: Subspace Designs & Dimension Expanders Venkatesan Guruswami Carnegie Mellon University Simons workshop on Proving and Using Pseudorandomness March 8, 2017 Based on a
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
More informationError-Correcting Codes:
Error-Correcting Codes: Progress & Challenges Madhu Sudan Microsoft/MIT Communication in presence of noise We are not ready Sender Noisy Channel We are now ready Receiver If information is digital, reliability
More informationApproaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes 1 Zheng Wang, Student Member, IEEE, Jie Luo, Member, IEEE arxiv:0808.3756v1 [cs.it] 27 Aug 2008 Abstract We show that
More informationLecture 8: Shannon s Noise Models
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 8: Shannon s Noise Models September 14, 2007 Lecturer: Atri Rudra Scribe: Sandipan Kundu& Atri Rudra Till now we have
More informationEuclidean sections of l N 1 with sublinear randomness and error-correction over the reals
Euclidean sections of l N 1 with sublinear randomness and error-correction over the reals Venkatesan Guruswami James R. Lee Avi Wigderson Abstract It is well-known that R N has subspaces of dimension proportional
More informationLecture 12: November 6, 2017
Information and Coding Theory Autumn 017 Lecturer: Madhur Tulsiani Lecture 1: November 6, 017 Recall: We were looking at codes of the form C : F k p F n p, where p is prime, k is the message length, and
More informationError Correcting Codes Questions Pool
Error Correcting Codes Questions Pool Amnon Ta-Shma and Dean Doron January 3, 018 General guidelines The questions fall into several categories: (Know). (Mandatory). (Bonus). Make sure you know how to
More informationLocally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound
Electronic Colloquium on Computational Complexity, Report No. 1 (016 Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound Sivakanth Gopi Swastik Kopparty Rafael Oliveira
More informationLecture 4: Codes based on Concatenation
Lecture 4: Codes based on Concatenation Error-Correcting Codes (Spring 206) Rutgers University Swastik Kopparty Scribe: Aditya Potukuchi and Meng-Tsung Tsai Overview In the last lecture, we studied codes
More informationLecture 03: Polynomial Based Codes
Lecture 03: Polynomial Based Codes Error-Correcting Codes (Spring 016) Rutgers University Swastik Kopparty Scribes: Ross Berkowitz & Amey Bhangale 1 Reed-Solomon Codes Reed Solomon codes are large alphabet
More informationA Lifting Decoding Scheme and its Application to Interleaved Linear Codes
Author manuscript, published in "International Symposium on Information Theory (2012) 96-100" DOI : 10.1109/ISIT.2012.6284707 A Lifting Decoding Scheme and its Application to Interleaved Linear Codes Guillaume
More informationfor some error exponent E( R) as a function R,
. Capacity-achieving codes via Forney concatenation Shannon s Noisy Channel Theorem assures us the existence of capacity-achieving codes. However, exhaustive search for the code has double-exponential
More informationAn Introduction to (Network) Coding Theory
An to (Network) Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland April 24th, 2018 Outline 1 Reed-Solomon Codes 2 Network Gabidulin Codes 3 Summary and Outlook A little bit of history
More informationNP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors
Electronic Colloquium on Computational Complexity, Report No. 73 (2018) NP-hardness of coloring 2-colorable with poly-logarithmically many colors Amey Bhangale April 21, 2018 Abstract We give very short
More informationEfficiently decodable codes for the binary deletion channel
Efficiently decodable codes for the binary deletion channel Venkatesan Guruswami (venkatg@cs.cmu.edu) Ray Li * (rayyli@stanford.edu) Carnegie Mellon University August 18, 2017 V. Guruswami and R. Li (CMU)
More informationBlock Codes :Algorithms in the Real World
Block Codes 5-853:Algorithms in the Real World Error Correcting Codes II Reed-Solomon Codes Concatenated Codes Overview of some topics in coding Low Density Parity Check Codes (aka Expander Codes) -Network
More informationNotes for the Hong Kong Lectures on Algorithmic Coding Theory. Luca Trevisan. January 7, 2007
Notes for the Hong Kong Lectures on Algorithmic Coding Theory Luca Trevisan January 7, 2007 These notes are excerpted from the paper Some Applications of Coding Theory in Computational Complexity [Tre04].
More informationCS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes
CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationBelief propagation decoding of quantum channels by passing quantum messages
Belief propagation decoding of quantum channels by passing quantum messages arxiv:67.4833 QIP 27 Joseph M. Renes lempelziv@flickr To do research in quantum information theory, pick a favorite text on classical
More informationAn Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationLecture 4: Linear Codes. Copyright G. Caire 88
Lecture 4: Linear Codes Copyright G. Caire 88 Linear codes over F q We let X = F q for some prime power q. Most important case: q =2(binary codes). Without loss of generality, we may represent the information
More informationarxiv: v1 [cs.it] 23 Feb 2018
Synchronization Strings: List Decoding for Insertions and Deletions Bernhard Haeupler Carnegie Mellon University haeupler@cs.cmu.edu Amirbehshad Shahrasbi Carnegie Mellon University shahrasbi@cs.cmu.edu
More informationImproved decoding of Folded Reed-Solomon and Multiplicity Codes
Improved decoding of Folded Reed-Solomon and Multiplicity Codes Swastik Kopparty Noga Ron-Zewi Shubhangi Saraf Mary Wootters May 3, 2018 Abstract In this work, we show new and improved error-correcting
More informationCS Topics in Cryptography January 28, Lecture 5
CS 4501-6501 Topics in Cryptography January 28, 2015 Lecture 5 Lecturer: Mohammad Mahmoody Scribe: Ameer Mohammed 1 Learning with Errors: Motivation An important goal in cryptography is to find problems
More informationCoding problems for memory and storage applications
.. Coding problems for memory and storage applications Alexander Barg University of Maryland January 27, 2015 A. Barg (UMD) Coding for memory and storage January 27, 2015 1 / 73 Codes with locality Introduction:
More informationExplicit Capacity-Achieving List-Decodable Codes or Decoding Folded Reed-Solomon Codes up to their Distance
Explicit Capacity-Achieving List-Decodable Codes or Decoding Folded Reed-Solomon Codes up to their Distance Venkatesan Guruswami Atri Rudra Department of Computer Science and Engineering University of
More informationA Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field
A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field David P. Woodruff IBM Almaden dpwoodru@us.ibm.com Abstract. A linear (q, δ, ɛ, m(n))-locally decodable code (LDC) C
More information6.895 PCP and Hardness of Approximation MIT, Fall Lecture 3: Coding Theory
6895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 3: Coding Theory Lecturer: Dana Moshkovitz Scribe: Michael Forbes and Dana Moshkovitz 1 Motivation In the course we will make heavy use of
More informationLecture B04 : Linear codes and singleton bound
IITM-CS6845: Theory Toolkit February 1, 2012 Lecture B04 : Linear codes and singleton bound Lecturer: Jayalal Sarma Scribe: T Devanathan We start by proving a generalization of Hamming Bound, which we
More informationAlgebraic Geometry Codes. Shelly Manber. Linear Codes. Algebraic Geometry Codes. Example: Hermitian. Shelly Manber. Codes. Decoding.
Linear December 2, 2011 References Linear Main Source: Stichtenoth, Henning. Function Fields and. Springer, 2009. Other Sources: Høholdt, Lint and Pellikaan. geometry codes. Handbook of Coding Theory,
More informationDecoding Concatenated Codes using Soft Information
Decoding Concatenated Codes using Soft Information Venkatesan Guruswami University of California at Berkeley Computer Science Division Berkeley, CA 94720. venkat@lcs.mit.edu Madhu Sudan MIT Laboratory
More informationLecture 19 : Reed-Muller, Concatenation Codes & Decoding problem
IITM-CS6845: Theory Toolkit February 08, 2012 Lecture 19 : Reed-Muller, Concatenation Codes & Decoding problem Lecturer: Jayalal Sarma Scribe: Dinesh K Theme: Error correcting codes In the previous lecture,
More informationTwo-Variable Logic with Counting and Linear Orders
Two-Variable Logic with Counting and Linear Orders (Ongoing work) Witold Charatonik Piotr Witkowski Institute of Computer Science University of Wroc law FIT 2015, Warszawa Plan of the talk 1 Motivations
More informationConvergence analysis for a class of LDPC convolutional codes on the erasure channel
Convergence analysis for a class of LDPC convolutional codes on the erasure channel Sridharan, Arvind; Lentmaier, Michael; Costello Jr., Daniel J.; Zigangirov, Kamil Published in: [Host publication title
More informationLP Decoding Corrects a Constant Fraction of Errors
LP Decoding Corrects a Constant Fraction of Errors Jon Feldman Columbia University (CORC Technical Report TR-2003-08) Cliff Stein Columbia University Tal Malkin Columbia University Rocco A. Servedio Columbia
More informationThe Tensor Product of Two Codes is Not Necessarily Robustly Testable
The Tensor Product of Two Codes is Not Necessarily Robustly Testable Paul Valiant Massachusetts Institute of Technology pvaliant@mit.edu Abstract. There has been significant interest lately in the task
More informationLecture 3: Error Correcting Codes
CS 880: Pseudorandomness and Derandomization 1/30/2013 Lecture 3: Error Correcting Codes Instructors: Holger Dell and Dieter van Melkebeek Scribe: Xi Wu In this lecture we review some background on error
More informationGraph-based codes for flash memory
1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background
More informationAn Upper Bound On the Size of Locally. Recoverable Codes
An Upper Bound On the Size of Locally 1 Recoverable Codes Viveck Cadambe Member, IEEE and Arya Mazumdar Member, IEEE arxiv:1308.3200v2 [cs.it] 26 Mar 2015 Abstract In a locally recoverable or repairable
More informationWeaknesses of Margulis and Ramanujan Margulis Low-Density Parity-Check Codes
Electronic Notes in Theoretical Computer Science 74 (2003) URL: http://www.elsevier.nl/locate/entcs/volume74.html 8 pages Weaknesses of Margulis and Ramanujan Margulis Low-Density Parity-Check Codes David
More informationRandom Redundant Soft-In Soft-Out Decoding of Linear Block Codes
Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes Thomas R. Halford and Keith M. Chugg Communication Sciences Institute University of Southern California Los Angeles, CA 90089-2565 Abstract
More informationIntroduction to Low-Density Parity Check Codes. Brian Kurkoski
Introduction to Low-Density Parity Check Codes Brian Kurkoski kurkoski@ice.uec.ac.jp Outline: Low Density Parity Check Codes Review block codes History Low Density Parity Check Codes Gallager s LDPC code
More informationBerlekamp-Massey decoding of RS code
IERG60 Coding for Distributed Storage Systems Lecture - 05//06 Berlekamp-Massey decoding of RS code Lecturer: Kenneth Shum Scribe: Bowen Zhang Berlekamp-Massey algorithm We recall some notations from lecture
More information: Error Correcting Codes. October 2017 Lecture 1
03683072: Error Correcting Codes. October 2017 Lecture 1 First Definitions and Basic Codes Amnon Ta-Shma and Dean Doron 1 Error Correcting Codes Basics Definition 1. An (n, K, d) q code is a subset of
More informationLecture Introduction. 2 Linear codes. CS CTT Current Topics in Theoretical CS Oct 4, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 4, 01 Lecturer: Elena Grigorescu Lecture 14 Scribe: Selvakumaran Vadivelmurugan 1 Introduction We introduced error-correcting codes and linear codes in
More informationPart III Advanced Coding Techniques
Part III Advanced Coding Techniques José Vieira SPL Signal Processing Laboratory Departamento de Electrónica, Telecomunicações e Informática / IEETA Universidade de Aveiro, Portugal 2010 José Vieira (IEETA,
More informationA Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem Daniel Augot and Matthieu Finiasz INRIA, Domaine de Voluceau F-78153 Le Chesnay CEDEX Abstract. The Polynomial Reconstruction
More informationLecture 12: Reed-Solomon Codes
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 007) Lecture 1: Reed-Solomon Codes September 8, 007 Lecturer: Atri Rudra Scribe: Michel Kulhandjian Last lecture we saw the proof
More informationPermanent is hard to compute even on a good day
Permanent is hard to compute even on a good day Yuval Filmus September 11, 2012 Abstract We give an exposition of Cai, Pavan and Sivakumar s result on the hardness of permanent. They show that assuming
More informationSTUDY OF PERMUTATION MATRICES BASED LDPC CODE CONSTRUCTION
EE229B PROJECT REPORT STUDY OF PERMUTATION MATRICES BASED LDPC CODE CONSTRUCTION Zhengya Zhang SID: 16827455 zyzhang@eecs.berkeley.edu 1 MOTIVATION Permutation matrices refer to the square matrices with
More informationSector-Disk Codes and Partial MDS Codes with up to Three Global Parities
Sector-Disk Codes and Partial MDS Codes with up to Three Global Parities Junyu Chen Department of Information Engineering The Chinese University of Hong Kong Email: cj0@alumniiecuhkeduhk Kenneth W Shum
More informationSliding Window Algorithms for Regular Languages
Sliding Window Algorithms for Regular Languages Moses Ganardi, Danny Hucke, and Markus Lohrey Universität Siegen Department für Elektrotechnik und Informatik Hölderlinstrasse 3 D-57076 Siegen, Germany
More informationLow-complexity error correction in LDPC codes with constituent RS codes 1
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 348-353 Low-complexity error correction in LDPC codes with constituent RS codes 1
More informationRegenerating Codes and Locally Recoverable. Codes for Distributed Storage Systems
Regenerating Codes and Locally Recoverable 1 Codes for Distributed Storage Systems Yongjune Kim and Yaoqing Yang Abstract We survey the recent results on applying error control coding to distributed storage
More informationLocality Lower Bounds
Chapter 8 Locality Lower Bounds In Chapter 1, we looked at distributed algorithms for coloring. In particular, we saw that rings and rooted trees can be colored with 3 colors in log n + O(1) rounds. 8.1
More informationArrangements, matroids and codes
Arrangements, matroids and codes first lecture Ruud Pellikaan joint work with Relinde Jurrius ACAGM summer school Leuven Belgium, 18 July 2011 References 2/43 1. Codes, arrangements and matroids by Relinde
More informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationVariety Evasive Sets
Variety Evasive Sets Zeev Dvir János Kollár Shachar Lovett Abstract We give an explicit construction of a large subset S F n, where F is a finite field, that has small intersection with any affine variety
More informationAn Introduction to (Network) Coding Theory
An Introduction to (Network) Coding Theory Anna-Lena Horlemann-Trautmann University of St. Gallen, Switzerland July 12th, 2018 1 Coding Theory Introduction Reed-Solomon codes 2 Introduction Coherent network
More informationCorrecting Bursty and Localized Deletions Using Guess & Check Codes
Correcting Bursty and Localized Deletions Using Guess & Chec Codes Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University serge..hanna@rutgers.edu, salim.elrouayheb@rutgers.edu Abstract
More informationNetwork Coding and Schubert Varieties over Finite Fields
Network Coding and Schubert Varieties over Finite Fields Anna-Lena Horlemann-Trautmann Algorithmics Laboratory, EPFL, Schweiz October 12th, 2016 University of Kentucky What is this talk about? 1 / 31 Overview
More informationarxiv: v1 [cs.ds] 28 Sep 2018
Minimization of Gini impurity via connections with the k-means problem arxiv:1810.00029v1 [cs.ds] 28 Sep 2018 Eduardo Laber PUC-Rio, Brazil laber@inf.puc-rio.br October 2, 2018 Abstract Lucas Murtinho
More informationCS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding
CS264: Beyond Worst-Case Analysis Lecture #11: LP Decoding Tim Roughgarden October 29, 2014 1 Preamble This lecture covers our final subtopic within the exact and approximate recovery part of the course.
More informationError Correcting Codes: Combinatorics, Algorithms and Applications Spring Homework Due Monday March 23, 2009 in class
Error Correcting Codes: Combinatorics, Algorithms and Applications Spring 2009 Homework Due Monday March 23, 2009 in class You can collaborate in groups of up to 3. However, the write-ups must be done
More informationCompressed Sensing and Linear Codes over Real Numbers
Compressed Sensing and Linear Codes over Real Numbers Henry D. Pfister (joint with Fan Zhang) Texas A&M University College Station Information Theory and Applications Workshop UC San Diego January 31st,
More informationTURBO codes [7] and low-density parity-check (LDPC)
82 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 1, JANUARY 2007 LP Decoding Corrects a Constant Fraction of Errors Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, and Martin J. Wainwright,
More informationLecture 11: Polar codes construction
15-859: Information Theory and Applications in TCS CMU: Spring 2013 Lecturer: Venkatesan Guruswami Lecture 11: Polar codes construction February 26, 2013 Scribe: Dan Stahlke 1 Polar codes: recap of last
More informationCOMPSCI 650 Applied Information Theory Apr 5, Lecture 18. Instructor: Arya Mazumdar Scribe: Hamed Zamani, Hadi Zolfaghari, Fatemeh Rezaei
COMPSCI 650 Applied Information Theory Apr 5, 2016 Lecture 18 Instructor: Arya Mazumdar Scribe: Hamed Zamani, Hadi Zolfaghari, Fatemeh Rezaei 1 Correcting Errors in Linear Codes Suppose someone is to send
More informationBreaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds Kenya Ueno The Young Researcher Development Center and Graduate School of Informatics, Kyoto University kenya@kuis.kyoto-u.ac.jp Abstract.
More informationarxiv: v1 [cs.cc] 22 Apr 2015
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity Swastik Kopparty Or Meir Noga Ron-Zewi Shubhangi Saraf arxiv:504.05653v [cs.cc] 22 Apr 205 April 23, 205 Abstract
More informationIMPROVING THE ALPHABET-SIZE IN EXPANDER BASED CODE CONSTRUCTIONS
IMPROVING THE ALPHABET-SIZE IN EXPANDER BASED CODE CONSTRUCTIONS 1 Abstract Various code constructions use expander graphs to improve the error resilience. Often the use of expanding graphs comes at the
More informationAlgebraic Codes for Error Control
little -at- mathcs -dot- holycross -dot- edu Department of Mathematics and Computer Science College of the Holy Cross SACNAS National Conference An Abstract Look at Algebra October 16, 2009 Outline Coding
More informationLinear-algebraic list decoding for variants of Reed-Solomon codes
Electronic Colloquium on Computational Complexity, Report No. 73 (2012) Linear-algebraic list decoding for variants of Reed-Solomon codes VENKATESAN GURUSWAMI CAROL WANG Computer Science Department Carnegie
More informationThe Complexity of the Matroid-Greedoid Partition Problem
The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi and Christopher Umans Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate to within 1/2 +
More informationatri/courses/coding-theory/book/
Foreword This chapter is based on lecture notes from coding theory courses taught by Venkatesan Guruswami at University at Washington and CMU; by Atri Rudra at University at Buffalo, SUNY and by Madhu
More informationParameterized single-exponential time polynomial space algorithm for Steiner Tree
Parameterized single-exponential time polynomial space algorithm for Steiner Tree Fedor V. Fomin 1, Petteri Kaski 2, Daniel Lokshtanov 1, Fahad Panolan 1,3, and Saket Saurabh 1,3 1 University of Bergen,
More informationReed-Solomon codes. Chapter Linear codes over finite fields
Chapter 8 Reed-Solomon codes In the previous chapter we discussed the properties of finite fields, and showed that there exists an essentially unique finite field F q with q = p m elements for any prime
More informationOn the List-Decodability of Random Linear Codes
On the List-Decodability of Random Linear Codes Venkatesan Guruswami Computer Science Dept. Carnegie Mellon University Johan Håstad School of Computer Science and Communication KTH Swastik Kopparty CSAIL
More informationA list-decodable code with local encoding and decoding
A list-decodable code with local encoding and decoding Marius Zimand Towson University Department of Computer and Information Sciences Baltimore, MD http://triton.towson.edu/ mzimand Abstract For arbitrary
More informationWhich Codes Have 4-Cycle-Free Tanner Graphs?
Which Codes Have 4-Cycle-Free Tanner Graphs? Thomas R. Halford Communication Sciences Institute University of Southern California Los Angeles, CA 90089-565 USA Alex J. Grant Institute for Telecommunications
More informationBridging Shannon and Hamming: List Error-Correction with Optimal Rate
Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010 Bridging Shannon and Hamming: List Error-Correction with Optimal Rate Venkatesan Guruswami Abstract. Error-correcting
More informationarxiv: v1 [cs.it] 9 Jan 2019
Simple Codes and Sparse Recovery with Fast Decoding Mahdi Cheraghchi João Ribeiro arxiv:1901.02852v1 [cs.it] 9 Jan 2019 Abstract Construction of error-correcting codes achieving a designated minimum distance
More informationTHIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
More informationLimits to List Decoding Random Codes
Limits to List Decoding Random Codes Atri Rudra Department of Computer Science and Engineering, University at Buffalo, The State University of New York, Buffalo, NY, 14620. atri@cse.buffalo.edu Abstract
More informationState-of-the-Art Channel Coding
Institut für State-of-the-Art Channel Coding Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More information