Improved Nearly-MDS Expander Codes

R.M. Roth; V. Skachek

doi:10.1109/tit.2006.878232

Improved Nearly-MDS Expander Codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2006.878232 ◽

2006 ◽

Vol 52 (8) ◽

pp. 3650-3661 ◽

Cited By ~ 17

Author(s):

R.M. Roth ◽

V. Skachek

Keyword(s):

Expander Codes

Download Full-text

Linear-time Erasure List-decoding of Expander Codes

2020 IEEE International Symposium on Information Theory (ISIT) ◽

10.1109/isit44484.2020.9174325 ◽

2020 ◽

Author(s):

Noga Ron-Zewi ◽

Mary Wootters ◽

Gilles Zemor

Keyword(s):

Linear Time ◽

List Decoding ◽

Expander Codes

Download Full-text

Expander codes

Proceedings 35th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1994.365734 ◽

2002 ◽

Cited By ~ 15

Author(s):

M. Sipser ◽

D.A. Spielman

Keyword(s):

Expander Codes

Download Full-text

Fast Decoding of Expander Codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2017.2726064 ◽

2018 ◽

Vol 64 (2) ◽

pp. 972-978

Author(s):

Michael Dowling ◽

Shuhong Gao

Keyword(s):

Fast Decoding ◽

Expander Codes

Download Full-text

Decoding of expander codes at rates close to capacity

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. ◽

10.1109/isit.2005.1523346 ◽

2005 ◽

Cited By ~ 1

Author(s):

A. Ashikhmin ◽

V. Skachek

Keyword(s):

Expander Codes

Download Full-text

Generalized minimum distance iterative decoding of expander codes

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674) ◽

10.1109/itw.2003.1216740 ◽

2004 ◽

Cited By ~ 6

Author(s):

V. Skachek ◽

R.M. Roth

Keyword(s):

Iterative Decoding ◽

Minimum Distance ◽

Expander Codes

Download Full-text

Eigenvalue bounds on the pseudocodeword weight of expander codes

Advances in Mathematics of Communications ◽

10.3934/amc.2007.1.287 ◽

2007 ◽

Vol 1 (3) ◽

pp. 287-306 ◽

Cited By ~ 3

Author(s):

Deepak Sridhara ◽

Christine Kelley

Keyword(s):

Eigenvalue Bounds ◽

Expander Codes

Download Full-text

Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes

2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2018.00076 ◽

2018 ◽

Cited By ~ 5

Author(s):

Omar Fawzi ◽

Antoine Grospellier ◽

Anthony Leverrier

Keyword(s):

Fault Tolerance ◽

Expander Codes

Download Full-text

Optimal Designs for Lasso and Dantzig Selector Using Expander Codes

IEEE Transactions on Information Theory ◽

10.1109/tit.2014.2353995 ◽

2014 ◽

Vol 60 (11) ◽

pp. 7293-7299

Author(s):

Yohann de Castro

Keyword(s):

Optimal Designs ◽

Dantzig Selector ◽

Expander Codes

Download Full-text

Upper and lower bounds on the minimum distance of expander codes

2011 IEEE International Symposium on Information Theory Proceedings ◽

10.1109/isit.2011.6033768 ◽

2011 ◽

Author(s):

Alexey Frolov ◽

Victor Zyablov

Keyword(s):

Lower Bounds ◽

Minimum Distance ◽

Upper And Lower Bounds ◽

Expander Codes

Download Full-text

Linear time decoding of regular expander codes

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12 ◽

10.1145/2090236.2090251 ◽

2012 ◽

Author(s):

Michael Viderman

Keyword(s):

Linear Time ◽

Expander Codes

Download Full-text