Improved Decoding of Expander Codes-Reference-Cited by-同舟云学术

Improved Decoding of Expander Codes

Published:2023-06 Issue:6 Volume:69 Page:3574-3589
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Chen Xue¹,Cheng Kuan²^ORCID,Li Xin³^ORCID,Ouyang Minghui⁴^ORCID

Affiliation:

1. CAS Key Laboratory of Wireless-Optical Communications and the College of Computer Science and Technology, University of Science and Technology of China (USTC), Hefei, China

2. Center on Frontiers of Computing Studies and the Advanced Institute of Information Technology, Peking University, Beijing, China

3. Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA

4. Department of Mathematical Science, Peking University, Beijing, China

Funder

NSF CAREER

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

https://ieeexplore.ieee.org/ielam/18/10130037/10024861-aam.pdf

Reference24 articles.

1. Randomness conductors and constant-degree lossless expanders;capalbo;Proc 34th Annu ACM (STOC),2002

2. LP decoding of codes with expansion parameter above 2/3

3. Explicit unique-neighbor expanders

4. List decoding;wozencraft,1958

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Random Shortening of Linear Codes and Applications;Lecture Notes in Computer Science;2023-12-09

2. List Decoding of Tanner and Expander Amplified Codes from Distance Certificates;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06