scientific article; zbMATH DE number 3559420
From MaRDI portal
Publication:4132387
zbMATH Open0358.94017MaRDI QIDQ4132387FDOQ4132387
Authors: M. S. Pinsker, V. V. Zyablov 
Publication date: 1975
Full work available at URL: http://mathnet.ru/eng/ppi/v11/i1/p23
Title of this publication is not available (Why is that?)
Recommendations
Cited In (16)
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
- Error-correcting codes on low rank surfaces
- Average and reliability error exponents in low-density parity-check codes
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Low-complexity error correction of Hamming-code-based LDPC codes
- A note on the decoding complexity of error-correcting codes
- Decoding concatenated codes with inner convolutional codes
- Title not available (Why is that?)
- Complexity of constructing codes with specified correction properties
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- On the error-correcting capability of LDPC codes
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Erasure correction by low-density codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132387)
