Showing 1–20 of 150 results
/ Date/ Name
Jan 9, 2010On the List-Decodability of Random Linear CodesFeb 27, 2012Constant Factor Lasserre Integrality Gaps for Graph Partitioning ProblemsOct 12, 2009Improved Inapproximability Results for Maximum k-Colorable SubgraphApr 22, 2010Optimal-Rate Code Constructions for Computationally Simple ChannelsNov 25, 2008Artin automorphisms, Cyclotomic function fields, and Folded list-decodable codesDec 18, 2011Approximating Non-Uniform Sparsest Cut via Generalized SpectraJan 16, 2019An Exponential Lower Bound on the Sub-Packetization of MSR CodesJul 7, 2015An improved bound on the fraction of correctable deletionsJun 2, 2011Linear-algebraic list decoding of folded Reed-Solomon codesApr 6, 2005Correlation Clustering with a Fixed Number of ClustersOct 5, 2006Iterative Decoding of Low-Density Parity Check Codes (A Survey)Apr 16, 2013Polar Codes: Speed of polarization and polynomial gap to capacityAug 3, 2015Efficiently list-decodable punctured Reed-Muller codesJul 21, 2020Explicit two-deletion codes with redundancy matching the existential boundNov 26, 2008List Decoding Tensor Products and Interleaved CodesJun 20, 2011Optimal rate list decoding via derivative codesApr 9, 2011Optimal Column-Based Low-Rank Matrix ReconstructionJul 4, 2012Restricted Isometry of Fourier Matrices and List Decodability of Random Linear CodesFeb 27, 2012Combinatorial limitations of average-radius list-decodingAug 3, 2017Optimal rate list decoding over bounded alphabets using algebraic-geometric codes