Pith. Sign in

RECORD

Error Exponents of Low-Density Parity-Check Codes on the Binary Erasure Channel

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Thierry Mora, Olivier Rivoire

Information Theory · Submitted 29 May 2006

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Within this framework, we apply the heuristic cavity method from statistical mechanics to derive the average and typical error exponents of low-density parity-check (LDPC) codes on the binary erasure channel (BEC) under maximum-likelihood decoding.

how it is stated · asserted 0.98 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDcs/0605130 (version 1)
Pith IDO7KFZOZB, Pith's permanent record of this paper and its review
CitationOlivier Rivoire, Thierry Mora. "Error Exponents of Low-Density Parity-Check Codes on the Binary Erasure Channel." arXiv:cs/0605130 (2006). https://pith.science/paper/O7KFZOZB
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,325 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.08 · human participants 0.01 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.09 · compares with prior results 0.07 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method from statistical mechanics to derive the average and typical error exponents of low-density parity-check (LDPC) codes on the binary erasure channel (BEC) under maximum-likelihood decoding.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. contribution 0.92 0.92 0.14 asserted 1.00
s1 Within this framework, we apply the heuristic cavity method from statistical mechanics to derive the average and typical error exponents of low-density parity-check (LDPC) codes on the binary erasure channel (BEC) under maximum-likelihood decoding. method 0.64 0.95 0.44 asserted 0.98

What kind of paper the classifier reports this is: method or tool 0.54 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method from statistical mechanics to derive the average and typical error exponents of low-density parity-check (LDPC) codes on the binary erasure channel (BEC) under maximum-likelihood decoding.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.