GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes With High Memories

Yang, Siyi; Hareedy, Ahmed; Venkatasubramanian, Shyam; Calderbank, Robert; Dolecek, Lara

doi:10.1109/ISIT45174.2021.9517931

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 15th until 12:00 AM ET on Friday, October 16th due to maintenance. We apologize for the inconvenience.

Citation Details

GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes With High Memories

Award ID(s):: 2008728

PAR ID:: 10299448

Author(s) / Creator(s):: Yang, Siyi; Hareedy, Ahmed; Venkatasubramanian, Shyam; Calderbank, Robert; Dolecek, Lara

Date Published:: 2021-07-12

Journal Name:: IEEE International Symposium on Information Theory

Page Range / eLocation ID:: 587 to 592

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
https://doi.org/10.1109/ISIT45174.2021.9517931

More Like this