List-Decoding Barnes–Wall Lattices
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Extensions to the Johnson bound , 2001 .
[2] Venkatesan Guruswami,et al. List decoding of error correcting codes , 2001 .
[3] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[4] Ofer Amrani,et al. Augmented product codes and lattices: Reed-Muller codes and Barnes-Wall lattices , 2005, IEEE Transactions on Information Theory.
[5] Vladimir M. Blinovsky,et al. List decoding , 1992, Discret. Math..
[6] Enkatesan G Uruswami. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .
[7] Ravi Kannan,et al. Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..
[8] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .
[9] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[10] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[11] Prasad Raghavendra,et al. List decoding tensor products and interleaved codes , 2008, STOC '09.
[12] Madhu Sudan,et al. Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.
[13] Yehuda Lindell. Introduction to Coding Theory Lecture Notes , 2009 .
[14] Sudipto Guha,et al. Near-optimal sparse fourier representations via sampling , 2002, STOC '02.
[15] Shafi Goldwasser,et al. Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.
[16] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[17] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[18] Shafi Goldwasser,et al. Proving hard-core predicates using list decoding , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[19] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[20] E. S. Barnes,et al. Some extreme forms defined in terms of Abelian groups , 1959, Journal of the Australian Mathematical Society.
[21] Daniele Micciancio,et al. Efficient bounded distance decoders for Barnes-Wall lattices , 2008, 2008 IEEE International Symposium on Information Theory.
[22] N. J. A. Sloane,et al. The Invariants of the Cli ord , 1999 .
[23] Alexander Vardy,et al. Generalized minimum-distance decoding of Euclidean-space codes and lattices , 1996, IEEE Trans. Inf. Theory.
[24] Venkatesan Guruswami,et al. List decoding from erasures: bounds and code constructions , 2001, IEEE Trans. Inf. Theory.
[25] Ilya Dumer,et al. Recursive error correction for general Reed-Muller codes , 2006, Discret. Appl. Math..
[26] Madhu Sudan,et al. Decodability of group homomorphisms beyond the johnson bound , 2008, STOC '08.
[27] Venkatesan Guruswami,et al. List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.
[28] Shachar Lovett,et al. List decoding Reed-Muller codes over small fields , 2014, Electron. Colloquium Comput. Complex..
[29] Venkatesan Guruswami,et al. Bridging Shannon and Hamming: List Error-Correction with Optimal Rate , 2011 .
[30] Don Coppersmith,et al. Finding Small Solutions to Small Degree Polynomials , 2001, CaLC.
[31] Peter Elias,et al. List decoding for noisy channels , 1957 .
[32] Venkatesan Guruswami,et al. Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..
[33] Alexander Vardy,et al. Generalized minimum distance decoding in Euclidean space: Performance analysis , 1997, IEEE Trans. Inf. Theory.
[34] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[35] Cédric Tavernier,et al. An improved list decoding algorithm for the second order Reed–Muller codes and its applications , 2008, Des. Codes Cryptogr..
[36] David E. Muller,et al. Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..
[37] I. Dumer. Soft-Decision Majority Decoding of Reed – Muller Codes , 2000 .
[38] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.
[39] Ba-Zhong Shen,et al. Generalised minimum distance decoding of Reed-Muller codes and Barnes-Wall lattices , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[40] G. David Forney,et al. Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.
[41] Ian F. Blake,et al. Trellis Complexity and Minimal Trellis Diagrams of Lattices , 1998, IEEE Trans. Inf. Theory.
[42] Ilya Dumer,et al. List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity , 2008, IEEE Transactions on Information Theory.
[43] Xin-Wen Wu,et al. List decoding of q-ary Reed-Muller codes , 2004, IEEE Transactions on Information Theory.
[44] Oded Regev,et al. Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors , 2012, Theory Comput..
[45] Madhu Sudan. List decoding: algorithms and applications , 2000, SIGA.
[46] Shachar Lovett,et al. Weight Distribution and List-Decoding Size of Reed–Muller Codes , 2012, IEEE Transactions on Information Theory.
[47] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[48] Daniele Micciancio,et al. Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction , 2012, Theory Comput..
[49] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[50] Damien Stehlé,et al. Rigorous and Efficient Short Lattice Vectors Enumeration , 2008, ASIACRYPT.
[51] J. Snyders,et al. Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[52] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[53] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[54] Ilya Dumer,et al. Soft-decision decoding of Reed-Muller codes: recursive lists , 2006, IEEE Transactions on Information Theory.
[55] Oded Regev,et al. Tensor-based hardness of the shortest vector problem to within almost polynomial factors , 2007, STOC '07.