Local correctability of expander codes
|
|
- Constance Eaton
- 5 years ago
- Views:
Transcription
1 Local correctability of expander codes Brett Hemenway Rafail Ostrovsky Mary Wootters IAS April 4, 24
2 The point(s) of this talk Locally decodable codes are codes which admit sublinear time decoding of small pieces of a message. Expander codes are a family of error correcting codes based on expander graphs. In this work, we show that (appropriately instantiated) expander codes are high-rate locally decodable codes. Only two families of codes known in this regime [KSY,GKS 2]. Expander codes (and the corresponding decoding algorithm and analysis) are very different from existing constructions!
3 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
4 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
5 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
6 Error correcting codes Noisy channel Alice Bob
7 Error correcting codes message x Σ k Noisy channel Alice Bob
8 Error correcting codes message x Σ k codeword C(x) Σ N Noisy channel Alice Bob
9 Error correcting codes message x Σ k corrupted codeword w Σ N codeword C(x) Σ N Noisy channel Alice Bob
10 Error correcting codes message x Σ k corrupted codeword w Σ N codeword C(x) Σ N x? Noisy channel Alice Bob
11 Locally decodable codes message x Σ k corrupted codeword w Σ N codeword C(x) Σ N x? Noisy channel Alice Bob
12 Locally decodable codes message x Σ k corrupted codeword w Σ N codeword C(x) Σ N x i? Noisy channel Alice Bob
13 Locally decodable codes message x Σ k corrupted codeword w Σ N codeword C(x) Σ N Bob makes only q queries x i? Noisy channel Alice Bob
14 Locally correctable codes message x Σ k corrupted codeword w Σ N codeword C(x) Σ N Bob makes only q queries C(x) i? Noisy channel Alice Bob
15 Locally correctable codes, sans stick figures Definition C is (q, δ, η)-locally correctable if for all i [N], for all x Σ k, and for all w Σ N with d(w, C(x)) δn, P {Bob correctly guesses C(x) i } η. Bob reads only q positions in the corrupted word, w.
16 Local correctability vs. local decodability When C is linear, local correctability implies local decodability. G x = C(x)
17 Local correctability vs. local decodability When C is linear, local correctability implies local decodability... x. G x = C(x)
18 Before we get too far Some notation For a code C : Σ k Σ N The message length is k, the length of the message. The block length is N, the length of the codeword. The rate is k/n. The locality is q, the number of queries Bob makes. Goal: large rate, small locality.
19 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
20 Example: Reed-Muller Codes f (x, y) (f (, ), f (, ), f (, ), f (, )) Alice Message: multivariate polynomial of total degree d, f F q [z,..., z m ]. Codeword: the evaluation of f at points in F m q : C(f ) = {f ( x)} x F m q
21 Locally Correcting Reed Muller Codes Points in F m q message is f F q [z,..., z m ] codeword is {f ( x)} x F m q
22 Locally Correcting Reed Muller Codes Points in F m q We want to correct C(f ) z = f ( z). f ( z) message is f F q [z,..., z m ] codeword is {f ( x)} x F m q
23 Locally Correcting Reed Muller Codes Points in F m q f ( z) f ( v) We want to correct C(f ) z = f ( z). Choose a random line through z, and consider the restriction to that line. g(t) = f ( z + t v) message is f F q [z,..., z m ] codeword is {f ( x)} x F m q
24 Locally Correcting Reed Muller Codes Points in F m q f ( z) f ( v) message is f F q [z,..., z m ] We want to correct C(f ) z = f ( z). Choose a random line through z, and consider the restriction to that line. g(t) = f ( z + t v) This is a univariate polynomial, and g() = f ( z). codeword is {f ( x)} x F m q
25 Locally Correcting Reed Muller Codes Points in F m q f ( z) f ( v) message is f F q [z,..., z m ] codeword is {f ( x)} x F m q We want to correct C(f ) z = f ( z). Choose a random line through z, and consider the restriction to that line. g(t) = f ( z + t v) This is a univariate polynomial, and g() = f ( z). Query all of the points on the line.
26 Resulting parameters Rate is ( m+d m )/q m (we needed d = O(q), so we can decode) Locality is q (the field size) If we choose m constant, we get: Rate is constant, but less than /2. Locality is N /m = N ε.
27 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
28 Question: Reed-Muller Codes have locality N ε and constant rate, but rate is less than /2.
29 Question: Reed-Muller Codes have locality N ε and constant rate, but rate is less than /2. Are there locally decodable codes with locality N ε, and rate arbitrarily close to?
30 Previous Work Rate and locality N ε : Multiplicity codes [Kopparty, Saraf, Yekhanin 2] Lifted codes [Guo, Kopparty, Sudan 22]
31 Previous Work Rate and locality N ε : Multiplicity codes [Kopparty, Saraf, Yekhanin 2] Lifted codes [Guo, Kopparty, Sudan 22] These have decoders similar to RM: the queries form a good code.
32 Previous Work Rate and locality N ε : Multiplicity codes [Kopparty, Saraf, Yekhanin 2] Lifted codes [Guo, Kopparty, Sudan 22] These have decoders similar to RM: the queries form a good code. Another regime: Rate bad but locality 3: ( N/2 2O( log(n)) ), Matching vector codes [Yekhanin 28, Efremenko 29,...] These decoders are different: The queries cannot tolerate any errors. There are so few queries that they are probably all correct.
33 Previous Work Rate and locality N ε : Multiplicity codes [Kopparty, Saraf, Yekhanin 2] Lifted codes [Guo, Kopparty, Sudan 22] These have decoders similar to RM: the queries form a good code. Expander codes [H., Ostrovsky, Wootters 23] Decoder is similar in spirit to lowquery decoders. The queries will not form an error correcting code. Another regime: Rate bad but locality 3: ( N/2 2O( log(n)) ), Matching vector codes [Yekhanin 28, Efremenko 29,...] These decoders are different: The queries cannot tolerate any errors. There are so few queries that they are probably all correct.
34 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
35 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.
36 Example [Tanner 8] G is K 8, and C is the [7, 4, 3]-Hamming code. N = ( 8 2) = 28 and Σ = {, }
37 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
38 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
39 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
40 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 =
41 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)
42 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)
43 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
44 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code Vertex
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 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code
48 Example: parity-check matrix of a Tanner code K 8 and the [7, 4, 3]-Hamming code
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.
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.
51 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
52 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.
53 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
54 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]
55 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
56 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
57 Main Result Given: a d-regular expander graph; an inner code of length d with smooth reconstruction. Then: We will give a local-correcting procedure for this expander code.
58 Smooth Reconstruction codeword c Σ N Bob makes q queries c i? Bob
59 Smooth Reconstruction codeword c Σ N Bob makes q queries Suppose that: Each Bob s q queries is (close to) uniformly distributed (they don t need to be independent!) c i? Bob
60 Smooth Reconstruction codeword c Σ N Bob makes q queries Suppose that: Each Bob s q queries is (close to) uniformly distributed (they don t need to be independent!) c i? Bob
61 Smooth Reconstruction codeword c Σ N Bob makes q queries Suppose that: Each Bob s q queries is (close to) uniformly distributed (they don t need to be independent!) c i? Bob
62 Smooth Reconstruction codeword c Σ N Bob makes q queries c i! Suppose that: Each Bob s q queries is (close to) uniformly distributed (they don t need to be independent!) From the (uncorrupted) queries, he can always recover c i. Bob
63 Smooth Reconstruction codeword c Σ N Bob makes q queries c i Suppose that: Each Bob s q queries is (close to) uniformly distributed (they don t need to be independent!) From the (uncorrupted) queries, he can always recover c i. But! He doesn t need to tolerate any errors. Bob
64 Smooth Reconstruction codeword c Σ N Bob Bob makes q queries c i Suppose that: Each Bob s q queries is (close to) uniformly distributed (they don t need to be independent!) From the (uncorrupted) queries, he can always recover c i. But! He doesn t need to tolerate any errors. Then: We say that the code has a smooth reconstruction algorithm.
65 Smooth reconstruction, sans stick figures Definition A code C Σ d has a q-query smooth reconstruction algorithm if, for all i [d] and for all codewords c C : Bob can always determine c i from a set of queries c i,..., c iq Each c ij is (close to) uniformly distributed in [d].
66 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
67 Main Result Given: a d-regular expander graph; an inner code of length d with smooth reconstruction. Then: We will give a local-correcting procedure for this expander code.
68 Decoding algorithm: main idea
69 Decoding algorithm: main idea Want to correct the label on this edge For this diagram q = 2
70 Decoding algorithm: main idea Want to correct the label on this edge For this diagram q = 2
71 Decoding algorithm: main idea Want to correct the label on this edge For this diagram q = 2
72 Decoding algorithm: main idea Want to correct the label on this edge For this diagram q = 2
73 Decoding algorithm: main idea Want to correct the label on this edge For this diagram q = 2
74 The expander walk as a tree Want to correct the label on this edge O(log n) q-ary tree (inner code has q-query reconstruction)
75 The expander walk as a tree O(log n) True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. q-ary tree
76 The expander walk as a tree O(log n) True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! q-ary tree
77 The expander walk as a tree O(log n) True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: q-ary tree
78 The expander walk as a tree O(log n) q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves.
79 The expander walk as a tree O(log n) q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves.
80 The expander walk as a tree O(log n) q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves. Errors on the leaves propagate.
81 The expander walk as a tree O(log n) q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves. Errors on the leaves propagate.
82 The expander walk as a tree O(log n) q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves. Errors on the leaves propagate.
83 The expander walk as a tree O(log n) q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves. Errors on the leaves propagate.
84 The expander walk as a tree O(log n)! q-ary tree True Statements: The symbols on the leaves determine the symbol on the root. There are q O(log(n)) N ε leaves. The leaves are (nearly) uniformly distributed in G. Idea: Query the leaves! Problems: There are errors on the leaves. Errors on the leaves propagate.
85 Correcting the last layer
86 Correcting the last layer
87 Correcting the last layer O(log n) O(log n) Edges to get us to uniform locations in the graph (not read) Edge we want to learn (not read) Edges for error correction (read)
88 Why should this help? Now the queries can tolerate a few errors. O(log n) q-ary tree
89 Why should this help? False statement: Now the queries can tolerate a few errors. O(log n) q-ary tree
90 Why should this help?! False statement: Now the queries can tolerate a few errors. O(log n) q-ary tree
91 Why should this help? O(log n)! q-ary tree False statement: Now the queries can tolerate a few errors. True statements: This is basically the only thing that can go wrong. Because everything in sight is (nearly) uniform, it probably won t go wrong.
92 Decoding algorithm
93 Decoding algorithm Each leaf edge queries its symbol
94 Decoding algorithm If my correct value were, there would be some path below me with error. If my correct value were, there would be some path below me with errors. Each leaf edge thinks to itself...
95 Decoding algorithm Local corrector: (, ) (, ) (, ) (, ) Each second-level edge reads its symbol and thinks to itself...
96 Decoding algorithm Local corrector: (, ) (, ) (, ) (, ) If I were... path with two errors... Each second-level edge reads its symbol and thinks to itself...
97 Decoding algorithm Local corrector: (, ) (, ) (, ) (, ) If I were... or path with no errors. Each second-level edge reads its symbol and thinks to itself...
98 Decoding algorithm Local corrector: (, ) (, ) (, ) (, ) If I were... path with one error... Each second-level edge reads its symbol and thinks to itself...
99 Decoding algorithm Local corrector: (, ) (, ) (, ) (, ) If I were... or path with two errors. Each second-level edge reads its symbol and thinks to itself...
100 Decoding algorithm If my correct value were, there would be some path below me with 2 errors. If my correct value were, there would be some path below me with errors. Each second-level edge reads its symbol and thinks to itself...
101 Decoding algorithm If my correct value were, there would be some path below me with Ω(log(n)) errors. If my correct value were, there would be some path below me with 7 errors. etc.
102 Decoding algorithm If my correct value were, there would be some path below me with Ω(log(n)) errors. If my correct value were, there would be some path below me with 7 errors. TRIUMPHANTLY RETURN! This only fails if there exist a path that is heavily corrupted. Heavily corrupted paths occur with exponentially small probability.
103 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
104 One choice for inner code: based on affine geometry See [Assmus, Key 94, 98] for a nice overview Let L,..., L t be the r-dimensional affine subspaces of F m q, and consider the code with parity-check matrix H: x F m q t L i H H i, x = { x L i x L i q m
105 One choice for inner code: based on affine geometry See [Assmus, Key 94, 98] for a nice overview Let L,..., L t be the r-dimensional affine subspaces of F m q, and consider the code with parity-check matrix H: query the q r nonzeros in this row x F m q L { i x L i t H i, x = x L H i q m Smooth reconstruction: To learn a coordinate indexed by x F m q : pick a random r-flat, Li, containing x. query all of the points in Li.
106 One choice for inner code: based on affine geometry See [Assmus, Key 94, 98] for a nice overview Let L,..., L t be the r-dimensional affine subspaces of F m q, and consider the code with parity-check matrix H: query the q r nonzeros in this row x F m q L { i x L i t H i, x = x L H i q m Smooth reconstruction: To learn a coordinate indexed by x F m q : pick a random r-flat, Li, containing x. query all of the points in Li. Observe: This is not a very good LCC!
107 One good instantiation Graph: Ramanujan graph Inner code: Finite geometry code Results: For any α, ɛ >, for infinitely many N, we get a code with block length N, which has rate α has locality (N/d) ɛ tolerates constant error rate
108 Outline Local correctability Definitions and notation Example: Reed-Muller codes Previous work and our contribution 2 Expander codes 3 Local correctability of expander codes Requirement for the inner code: smooth reconstruction Decoding algorithm Example instantiation: finite geometry codes 4 Conclusion
109 Summary When the inner code has smooth reconstruction, we give a local-decoding procedure for expander codes. This gives a new (and yet old!) family of linear locally correctable codes of rate approaching.
110 Open questions Can we use expander codes to achieve local correctability with lower query complexity? Can we use inner codes with rate < /2?
111 The end Thanks!
Linear time list recovery via expander codes
Linear time list recovery via expander codes Brett Hemenway and Mary Wootters June 7 26 Outline Introduction List recovery Expander codes List recovery of expander codes Conclusion Our Results One slide
More informationTutorial: Locally decodable codes. UT Austin
Tutorial: Locally decodable codes Anna Gál UT Austin Locally decodable codes Error correcting codes with extra property: Recover (any) one message bit, by reading only a small number of codeword bits.
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 informationLocally Decodable Codes
Foundations and Trends R in sample Vol. xx, No xx (xxxx) 1 114 c xxxx xxxxxxxxx DOI: xxxxxx Locally Decodable Codes Sergey Yekhanin 1 1 Microsoft Research Silicon Valley, 1065 La Avenida, Mountain View,
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 Decodable Codes
Foundations and Trends R in sample Vol. xx, No xx (xxxx) 1 98 c xxxx xxxxxxxxx DOI: xxxxxx Locally Decodable Codes Sergey Yekhanin 1 1 Microsoft Research Silicon Valley, 1065 La Avenida, Mountain View,
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 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 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 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 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 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 informationarxiv: v1 [cs.cr] 16 Dec 2014
A Storage-efficient and Robust Private Information Retrieval Scheme allowing few servers Daniel Augot 1,2, Françoise Levy-dit-Vehel 1,2,3, Abdullatif Shikfa 4 arxiv:1412.5012v1 [cs.cr] 16 Dec 2014 1 INRIA
More informationCSCI-B609: A Theorist s Toolkit, Fall 2016 Oct 4. Theorem 1. A non-zero, univariate polynomial with degree d has at most d roots.
CSCI-B609: A Theorist s Toolkit, Fall 2016 Oct 4 Lecture 14: Schwartz-Zippel Lemma and Intro to Coding Theory Lecturer: Yuan Zhou Scribe: Haoyu Zhang 1 Roots of polynomials Theorem 1. A non-zero, univariate
More informationReed-Muller testing and approximating small set expansion & hypergraph coloring
Reed-Muller testing and approximating small set expansion & hypergraph coloring Venkatesan Guruswami Carnegie Mellon University (Spring 14 @ Microsoft Research New England) 2014 Bertinoro Workshop on Sublinear
More informationHigh-Rate Codes with Sublinear-Time Decoding
High-Rate Codes with Sublinear-Time Decoding Swastik Kopparty Institute for Advanced Study swastik@ias.edu Shubhangi Saraf MIT shibs@mit.edu Sergey Yekhanin Microsoft Research yekhanin@microsoft.com ABSTRACT
More informationDecoding Reed-Muller codes over product sets
Rutgers University May 30, 2016 Overview Error-correcting codes 1 Error-correcting codes Motivation 2 Reed-Solomon codes Reed-Muller codes 3 Error-correcting codes Motivation Goal: Send a message Don t
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 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 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 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 informationHigh-rate codes with sublinear-time decoding
High-rate codes with sublinear-time decoding Swastik Kopparty Shubhangi Saraf Sergey Yekhanin September 23, 2010 Abstract Locally decodable codes are error-correcting codes that admit efficient decoding
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 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 informationLocality in Coding Theory
Locality in Coding Theory Madhu Sudan Harvard April 9, 2016 Skoltech: Locality in Coding Theory 1 Error-Correcting Codes (Linear) Code CC FF qq nn. FF qq : Finite field with qq elements. nn block length
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
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 informationList-decoding algorithms for lifted codes
List-decoding algorithms for lifted codes Alan Guo Swastik Kopparty March 2, 2016 Abstract Lifted Reed-Solomon codes are a natural affine-invariant family of error-correcting codes which generalize Reed-Muller
More informationThree Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length Anna Gál UT Austin panni@cs.utexas.edu Andrew Mills UT Austin amills@cs.utexas.edu March 8, 20 Abstract Locally decodable
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 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 informationTwo Query PCP with Sub-Constant Error
Electronic Colloquium on Computational Complexity, Report No 71 (2008) Two Query PCP with Sub-Constant Error Dana Moshkovitz Ran Raz July 28, 2008 Abstract We show that the N P-Complete language 3SAT has
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 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 informationLecture Introduction. 2 Formal Definition. CS CTT Current Topics in Theoretical CS Oct 30, 2012
CS 59000 CTT Current Topics in Theoretical CS Oct 30, 0 Lecturer: Elena Grigorescu Lecture 9 Scribe: Vivek Patel Introduction In this lecture we study locally decodable codes. Locally decodable codes are
More informationRecognition of a code in a noisy environment
Introduction Recognition of a code Conclusion Université de Limoges - XLIM - DMI INRIA Rocquencourt - Projet CODES ISIT Nice - June 29, 2007 Introduction Recognition of a code Conclusion Outline 1 Introduction
More informationLow-Density Parity-Check Codes
Department of Computer Sciences Applied Algorithms Lab. July 24, 2011 Outline 1 Introduction 2 Algorithms for LDPC 3 Properties 4 Iterative Learning in Crowds 5 Algorithm 6 Results 7 Conclusion PART I
More informationLecture 15 and 16: BCH Codes: Error Correction
CS681 Computational Number Theory Lecture 15 and 16: BCH Codes: Error Correction Instructor: Piyush P Kurur Scribe: Ramprasad Saptharishi Overview In these two lectures, we shall see how error correction
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationAlgebraic Codes and Invariance
Algebraic Codes and Invariance Madhu Sudan Harvard April 30, 2016 AAD3: Algebraic Codes and Invariance 1 of 29 Disclaimer Very little new work in this talk! Mainly: Ex- Coding theorist s perspective on
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 7 September 24
EECS 11: Coding for Digital Communication and Beyond Fall 013 Lecture 7 September 4 Lecturer: Anant Sahai Scribe: Ankush Gupta 7.1 Overview This lecture introduces affine and linear codes. Orthogonal signalling
More information2. Polynomials. 19 points. 3/3/3/3/3/4 Clearly indicate your correctly formatted answer: this is what is to be graded. No need to justify!
1. Short Modular Arithmetic/RSA. 16 points: 3/3/3/3/4 For each question, please answer in the correct format. When an expression is asked for, it may simply be a number, or an expression involving variables
More informationList Decoding of Noisy Reed-Muller-like Codes
List Decoding of Noisy Reed-Muller-like Codes Martin J. Strauss University of Michigan Joint work with A. Robert Calderbank (Princeton) Anna C. Gilbert (Michigan) Joel Lepak (Michigan) Euclidean List Decoding
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 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 informationApplications of Galois Geometries to Coding Theory and Cryptography
Applications of Galois Geometries to Coding Theory and Cryptography Ghent University Dept. of Mathematics Krijgslaan 281 - Building S22 9000 Ghent Belgium Albena, July 1, 2013 1. Affine spaces 2. Projective
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 informationLecture 15 April 9, 2007
6.851: Advanced Data Structures Spring 2007 Mihai Pătraşcu Lecture 15 April 9, 2007 Scribe: Ivaylo Riskov 1 Overview In the last lecture we considered the problem of finding the predecessor in its static
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 informationLecture 7: Passive Learning
CS 880: Advanced Complexity Theory 2/8/2008 Lecture 7: Passive Learning Instructor: Dieter van Melkebeek Scribe: Tom Watson In the previous lectures, we studied harmonic analysis as a tool for analyzing
More informationCyclic Redundancy Check Codes
Cyclic Redundancy Check Codes Lectures No. 17 and 18 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview These lectures will look at the following: Cyclic
More informationRelaxed Locally Correctable Codes in Computationally Bounded Channels
Relaxed Locally Correctable Codes in Computationally Bounded Channels Elena Grigorescu (Purdue) Joint with Jeremiah Blocki (Purdue), Venkata Gandikota (JHU), Samson Zhou (Purdue) Classical Locally Decodable/Correctable
More informationCS151 Complexity Theory. Lecture 9 May 1, 2017
CS151 Complexity Theory Lecture 9 Hardness vs. randomness We have shown: If one-way permutations exist then BPP δ>0 TIME(2 nδ ) ( EXP simulation is better than brute force, but just barely stronger assumptions
More informationThe extended coset leader weight enumerator
The extended coset leader weight enumerator Relinde Jurrius Ruud Pellikaan Eindhoven University of Technology, The Netherlands Symposium on Information Theory in the Benelux, 2009 1/14 Outline Codes, weights
More informationError-correcting codes and applications
Error-correcting codes and applications November 20, 2017 Summary and notation Consider F q : a finite field (if q = 2, then F q are the binary numbers), V = V(F q,n): a vector space over F q of dimension
More informationNear-Optimal Secret Sharing and Error Correcting Codes in AC 0
Near-Optimal Secret Sharing and Error Correcting Codes in AC 0 Kuan Cheng Yuval Ishai Xin Li December 18, 2017 Abstract We study the question of minimizing the computational complexity of (robust) secret
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 informationError-Correcting Codes
Error-Correcting Codes HMC Algebraic Geometry Final Project Dmitri Skjorshammer December 14, 2010 1 Introduction Transmission of information takes place over noisy signals. This is the case in satellite
More informationA Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors Qian Guo Thomas Johansson Paul Stankovski Dept. of Electrical and Information Technology, Lund University ASIACRYPT 2016 Dec 8th, 2016
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 informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationQuestions Pool. Amnon Ta-Shma and Dean Doron. January 2, Make sure you know how to solve. Do not submit.
Questions Pool Amnon Ta-Shma and Dean Doron January 2, 2017 General guidelines The questions fall into several categories: (Know). (Mandatory). (Bonus). Make sure you know how to solve. Do not submit.
More informationComputational Complexity: A Modern Approach
i Computational Complexity: A Modern Approach Sanjeev Arora and Boaz Barak Princeton University http://www.cs.princeton.edu/theory/complexity/ complexitybook@gmail.com Not to be reproduced or distributed
More informationGuess & Check Codes for Deletions, Insertions, and Synchronization
Guess & Check Codes for Deletions, Insertions, and Synchronization Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University sergekhanna@rutgersedu, salimelrouayheb@rutgersedu arxiv:759569v3
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 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 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 informationLecture 9: List decoding Reed-Solomon and Folded Reed-Solomon codes
Lecture 9: List decoding Reed-Solomon and Folded Reed-Solomon codes Error-Correcting Codes (Spring 2016) Rutgers University Swastik Kopparty Scribes: John Kim and Pat Devlin 1 List decoding review Definition
More informationLow Rate Is Insufficient for Local Testability
Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 4 (200) Low Rate Is Insufficient for Local Testability Eli Ben-Sasson Michael Viderman Computer Science Department Technion Israel
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationList Decoding of Reed Solomon Codes
List Decoding of Reed Solomon Codes p. 1/30 List Decoding of Reed Solomon Codes Madhu Sudan MIT CSAIL Background: Reliable Transmission of Information List Decoding of Reed Solomon Codes p. 2/30 List Decoding
More informationLecture 2 Linear Codes
Lecture 2 Linear Codes 2.1. Linear Codes From now on we want to identify the alphabet Σ with a finite field F q. For general codes, introduced in the last section, the description is hard. For a code of
More informationReconstruction for Models on Random Graphs
1 Stanford University, 2 ENS Paris October 21, 2007 Outline 1 The Reconstruction Problem 2 Related work and applications 3 Results The Reconstruction Problem: A Story Alice and Bob Alice, Bob and G root
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
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 informationLecture 21: P vs BPP 2
Advanced Complexity Theory Spring 206 Prof. Dana Moshkovitz Lecture 2: P vs BPP 2 Overview In the previous lecture, we began our discussion of pseudorandomness. We presented the Blum- Micali definition
More informationMaximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback Klim Efremenko UC Berkeley klimefrem@gmail.com Ran Gelles Princeton University rgelles@cs.princeton.edu Bernhard
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 informationLecture notes on coding theory
Lecture notes on coding theory Raymond van Bommel Curves over finite fields, Autumn 2017, Leiden 1 Introduction When one agent tries to transfer information to another agent through a noisy channel, errors
More informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
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 informationEfficient Probabilistically Checkable Debates
Efficient Probabilistically Checkable Debates Andrew Drucker MIT Andrew Drucker MIT, Efficient Probabilistically Checkable Debates 1/53 Polynomial-time Debates Given: language L, string x; Player 1 argues
More informationRaptor Codes: From a Math Idea to LTE embms. BIRS, October 2015
Raptor Codes: From a Math Idea to LTE embms BIRS, October 2015 The plan is to... 1 introduce LT codes and Raptor codes 2 provide insights into their design 3 address some common misconceptions 2 / 31 The
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 information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationLinear Algebra. F n = {all vectors of dimension n over field F} Linear algebra is about vectors. Concretely, vectors look like this:
15-251: Great Theoretical Ideas in Computer Science Lecture 23 Linear Algebra Linear algebra is about vectors. Concretely, vectors look like this: They are arrays of numbers. fig. by Peter Dodds # of numbers,
More informationCSCI 2570 Introduction to Nanocomputing
CSCI 2570 Introduction to Nanocomputing Information Theory John E Savage What is Information Theory Introduced by Claude Shannon. See Wikipedia Two foci: a) data compression and b) reliable communication
More informationLinear Block Codes. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 26 Linear Block Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay July 28, 2014 Binary Block Codes 3 / 26 Let F 2 be the set
More information1 The Low-Degree Testing Assumption
Advanced Complexity Theory Spring 2016 Lecture 17: PCP with Polylogarithmic Queries and Sum Check Prof. Dana Moshkovitz Scribes: Dana Moshkovitz & Michael Forbes Scribe Date: Fall 2010 In this lecture
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Discussion 6A Solution
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Discussion 6A Solution 1. Polynomial intersections Find (and prove) an upper-bound on the number of times two distinct degree
More information(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
More informationHardness Amplification
Hardness Amplification Synopsis 1. Yao s XOR Lemma 2. Error Correcting Code 3. Local Decoding 4. Hardness Amplification Using Local Decoding 5. List Decoding 6. Local List Decoding 7. Hardness Amplification
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More informationPCP Theorem and Hardness of Approximation
PCP Theorem and Hardness of Approximation An Introduction Lee Carraher and Ryan McGovern Department of Computer Science University of Cincinnati October 27, 2003 Introduction Assuming NP P, there are many
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 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 informationReed-Muller Codes. Sebastian Raaphorst Carleton University
Reed-Muller Codes Sebastian Raaphorst Carleton University May 9, 2003 Abstract This paper examines the family of codes known as Reed-Muller codes. We begin by briefly introducing the codes and their history
More information