Ars Technica

Parity Check Matrices?

I'm currently doing a discrete maths subject and they decided it'd be a great idea to introduce a new concept during exam week - Parity Check Matrices and Syndromes. I feel pretty comfortable with ...
IEEE

Tiling parity-check matrix for reduced complexity high throughput low-density parity-check decoders

Abstract: An approach for reducing hardware complexity of LDPC decoders is presented in this paper. Low-density parity-check (LDPC) codes have a sparse parity-check matrix (H matrix). In LDPC decoder, ...
IEEE

On Progressive Edge Growth Parity Check Matrix Generation for NB-LDPC Codes in HF Communications

Abstract: This work explores the research and development of a Progressive Edge Growth (PEG) algorithm parameter setting method for the forming parity-check matrices of Low- density parity-check (LDPC ...
GitHub

Implement Function for Generating the Simplex Code Family

Simplex codes are a family of binary linear codes that are duals of Hamming codes. For a given integer $m$, the binary simplex code has parameters $[2^m−1,m,2^{m− ...
GitHub

Generating LDPC Tanner Graphs using the Progressive Edge Growth (PEG) Algorithm

The Progressive Edge-Growth (PEG) algorithm for generating Tanner graphs (parity check matrices) for LDPC codes. Its main goal is to avoid short cycles in the graph, which improves performance under ...