vix.ing · top · new · best · stats · spec

Proving Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel

2014/07/22 by Alexandre Graell i Amat, Iryna Andriyanova, Amat, Alexandre Graell i +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1407.5783

openalex publication_date 2014/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the potential threshold, by generalizing the proof technique based on potential functions recently introduced by Yedla et al.. The existence of the potential function is also discussed for a vector sparse system in the general case, and some existence conditions are developed. We finally give density evolution and simulation results for several nonbinary SC-LDPC code ensembles.

Related