Vectorizing computations at decoding of nonbinary codes with small density of checks
From MaRDI portal
Publication:507108
DOI10.1134/S0005117916100052zbMath1355.94097OpenAlexW2537551436MaRDI QIDQ507108
I. V. Zhilin, Fedor Illarionovich Ivanov
Publication date: 3 February 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117916100052
Cites Work
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
- On the error-correcting capability of LDPC codes
- Erasure correction by low-density codes
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- A recursive approach to low complexity codes
- Good error-correcting codes based on very sparse matrices
- Unnamed Item
- Unnamed Item
This page was built for publication: Vectorizing computations at decoding of nonbinary codes with small density of checks
