Pith. Sign in

RECORD

Chained Successive Cancellation Decoding of the Extended Golay code

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
Peter Trifonov

Information Theory · Submitted 19 Jan 2018

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

The authors' main claim The extended Golay code is shown to be representable as a chained polar subcode.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1801.06315 (version 1)
Pith IDX3XXACFO, Pith's permanent record of this paper and its review
CitationPeter Trifonov. "Chained Successive Cancellation Decoding of the Extended Golay code." arXiv:1801.06315 (2018). https://pith.science/paper/X3XXACFO
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.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,433 input tokens.

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

The abstract, sentence by sentence

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

The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.

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 The extended Golay code is shown to be representable as a chained polar subcode. contribution 0.79 0.79 0.50 asserted 1.00
s1 This enables its decoding with the successive cancellation algorithm and its stack generalization. contribution 0.37 0.63 0.23 asserted 0.94
s2 The decoder can be further simplified by employing fast Hadamard transform. method 0.87 0.69 0.08 asserted 0.65
s3 The complexity of the obtained algorithm is comparable with that of the Vardy algorithm. result 0.93 0.76 0.17 asserted 1.00

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

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

The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.

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.