Session S29 - Theory and Applications of Coding Theory

Monday, July 19, 19:30 ~ 19:55 UTC-3

Designing graph-based codes for window decoding

Christine Kelley

University of Nebraska-Lincoln, USA   -   This email address is being protected from spambots. You need JavaScript enabled to view it.

Low-density parity-check (LDPC) codes are a class of linear codes defined by sparse parity-check matrices and have corresponding sparse bipartite graph representations. They have been shown to be capacity-achieving over many channels using low complexity graph-based iterative decoders. Spatially-coupled LDPC (SC-LDPC) codes are a special class of codes whose repetitive graph structure makes them amenable to window decoding, in which the nodes are decoded in groups from one end to the other. This type of decoding is useful for applications such as data streaming. In this talk we discuss the design of the subgraph seen by the window decoder and its properties, and compare these to the properties of the overall code.

Joint work with Emily McMillon (University of Nebraska-Lincoln, USA).

View abstract PDF