LDPC Decoding Over Nonbinary Queue-Based Burst Noise Channels
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Iterative decoding based on the sum-product algorithm (SPA) is examined for sending low-density parity check (LDPC) codes over a discrete nonbinary queue-based Markovian burst noise channel. This channel model is adopted due to its analytical tractability and its recently demonstrated capability in accurately representing correlated flat Rayleigh fading channels under antipodal signaling and either hard or soft output quantization. SPA equations are derived in closed form for this model in terms of its parameters. It is then numerically observed that potentially large coding gains can be realized with respect to the Shannon limit by exploiting channel memory as opposed to ignoring it via interleaving. Finally, the LDPC decoding performance under both matched and mismatched decoding regimes is evaluated. It is shown that the Markovian model provides noticeable gains over channel interleaving and that it can effectively capture the underlying fading channel behavior when decoding LDPC codes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it