Projects for Essential Coding Theory - CS 229r Spring 2017
Comments
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
Comment only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1
Combinatorics of Codes
If you are interested in some paper, add your name to this column and appropriate row
2
Asymptotic improvement to GV bound
Jiang-VardyVu-Wu
3
Fixed distance codes better than GV with q > 2
Yekhanin-Dumer
4
Weil bounds and distance of dual-BCH codes
Kaufman-Lovett
Schmidt (a book)
5
LP Bounds via Fourier AnalysisFriedman-Tillich
Navon-Samorodnitsky
6
Simpler LP bounds for high distanceNoga Alon
Schechtman-Shraibman
SaiLei
7
8
9
List-decoding
10
Existential results for linear codes
Guruswami-Hastad-Sudan-Zuckerman
Guruswami-Hastad-Kopparty
11
Tightness of Johnson boundGuruswami
12
List-decoding Reed-Muller codes
Gopalan-Klivans-Zuckerman
Bhowmick-Lovett
13
List-decodability of punctured codesWoottersRudra-WoottersPreetumVasileios
14
15
Explicit Codes
16
Subspace Evasive sets and List-decoding
Dvir-Lovett
17
Near optimal rate epsilon-biased codes
TaShma
18
19
Reed-Solomon (List) Decoding and Complexity
20
O(n log n) encoding and erasure decoding
Lin-Chung-Han
21
O(n polylog n) list-decodingAlekhnovich
22
Limits to list-decodabilityGuruswami-Rudra
BenSasson-Kopparty-Radhakrishnan
23
NP-Hardness Guruswami-Vardy
Gandikotta-Ghazi-Grigorescu
24
Other hardnessCheng-Wan
25
26
Locality in Coding Theory
27
3-query LDCsYekhaninEfremenko
28
High-rate LDCs and LCCs
Kopparty-Meir-RonZewi-Saraf
29
Testability of tensor-productsBenSasson-SudanViderman
30
Invariance in Property testingKaufman-Sudan
Guo-Kopparty-Sudan
31
Testing Expander Codes
Hemenway-Ostrovsky-Wootters
32
Repairing CodesGuruswami-Wootters
33
Maximally Recoverable Codes
Gopalan-Huang-Jenkins-Yekhanin
Gopalan-Hu-Kopparty-Saraf-Wang-Yekhanin
Kane-Lovett-Rao
34
35
Complexity of Decoding
36
Hardness of decoding with preprocessing
Alekhnovich-Khot-Kindler-Vishnoi
37
38
Decoding from Random Errors
39
Irregular LDPCs
Luby-Mitzenmacher-Shokrollahi-Spielman
Richardson-Urbanke
40
Reed-Muller decoding from erasures
Kudekar-Kumar-Mondell-Pfister-Sasoglu-Urbanke
41
Reed-Muller decoding from errorsAbbe-Shpilka-Wigderson
Saptarishi-Shpilka-Volk
42
43
Codes in Complexity
44
Hardness of TSP using CodesTrevisanJasonJeffrey
45
Hardness of SVP in lattices using BCH codes
Khot
46
Codes for Hardness AmplificationSudan-Trevisan-Vadhan
47
Codes to build ExtractorsTrevisan
48
Secure Multi Party Computation
BenOr-Goldwasser-Wigderson
AlexChristina
49
50
Secret SharingBiswaroop
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
Loading...
 
 
 
Sheet1