Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Threshold decoding

Peter J‎. Cameron, Jacobus H. Lint

Published Jul 31, 1980• 0 citations
Publisher
DOI
10.1017/cbo9780511662140.012

Related papers

Thresholds of precoded (3,6) LDPC codes under iterative and maximum-likelihood decodings

Huijuan Zheng, Sheng Tong

The technique of precoding is recently applied to low-density parity-check (LDPC) codes by Divsalar et al., resulting in precoded LDPC codes. It is shown that precoding can improve not only the iterative decoding thresholds of regular LDPC codes but also their maximum-likelihood (ML) decoding thresholds. In this paper, we consider thresholds of precoded (3,6) LDPC codes under both iterative and ML decodings. For iterative decoding, the tool of EXIT charts is employed. With the EXIT chart, thresholds of precoded (3,6) LDPC codes with different precoding ratios are obtained. It is shown that the iterative decoding threshold is reduced with the increase of the precoding ratio until the precoding ratio reaches at 0.25. When the precoding ratio is greater than 0.25, the increase of precoding ratio may impair the iterative decoding threshold. Thus, the optimal precoding ratio under iterative decoding is revealed to be 0.25, i.e., half of the information bits are to be precoded. For ML decoding analysis, we first drive the asymptotic ensemble distance spectrum of precoded (3,6) LDPC codes. Using the derived asymptotic ensemble distance spectrum along with Divsalar's simple bound, we calculate the thresholds of precoded (3,6) LDPC codes with different precoding ratios under ML decoding. It is shown that the increase of precoding ratio always leads to an improved ML decoding threshold and thus the optimal ML decoding threshold is achieved at a precoding ratio of 0.5, i.e., all information bits are to be precoded.

Symposium on ICT and Energy Efficiency and Workshop on Information Theory and Security (CIICT)•Jan 1, 2012•0 citations

Threshold decoding

Peter J‎. Cameron, Jacobus H. Lint

Cambridge University Press eBooks•Sep 18, 1975•0 citations

Threshold Decoding

Elwyn R. Berlekamp

Courses and lectures•Jan 1, 1970•0 citations

Improved Reliability-Based Iterative Decoding of LDPC Codes Based on Dynamic Threshold

Zhuo Ma, Du Shuanyi

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

ETRI Journal•May 4, 2015•1 citation

On the general threshold decoding rule and related codes

Xiaohong Peng, Patrick Guy Farrell

A new concept of /spl lambda/-order orthogonalization, and a general threshold decoding method is introduced. Many codes decodable using general threshold decoding can be constructed and are superior in performance to other majority-logic decodable codes.

IEEE International Symposium on Information Theory (ISIT)•Nov 19, 2002•0 citations

Information Encoding

Maria Schuld, Francesco Petruccione

Quantum science and technology•Jan 1, 2018•16 citations
The technique of precoding is recently applied to low-density parity-check (LDPC) codes by Divsalar et al., resulting in precoded LDPC codes. It is shown that precoding can improve not only the iterative decoding thresholds of regular LDPC codes but also their maximum-likelihood (ML) decoding thresholds. In this paper, we consider thresholds of precoded (3,6) LDPC codes under both iterative and ML decodings. For iterative decoding, the tool of EXIT charts is employed. With the EXIT chart, thresholds of precoded (3,6) LDPC codes with different precoding ratios are obtained. It is shown that the iterative decoding threshold is reduced with the increase of the precoding ratio until the precoding ratio reaches at 0.25. When the precoding ratio is greater than 0.25, the increase of precoding ratio may impair the iterative decoding threshold. Thus, the optimal precoding ratio under iterative decoding is revealed to be 0.25, i.e., half of the information bits are to be precoded. For ML decoding analysis, we first drive the asymptotic ensemble distance spectrum of precoded (3,6) LDPC codes. Using the derived asymptotic ensemble distance spectrum along with Divsalar's simple bound, we calculate the thresholds of precoded (3,6) LDPC codes with different precoding ratios under ML decoding. It is shown that the increase of precoding ratio always leads to an improved ML decoding threshold and thus the optimal ML decoding threshold is achieved at a precoding ratio of 0.5, i.e., all information bits are to be precoded.
A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.