REVIEW 1 cited by
Pruned Collapsed Projection-Aggregation Decoding of Reed-Muller Codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The paper proposes to decode Reed-Muller (RM) codes by projecting onto only a few subspaces such that the number of projections is significantly reduced. It reveals that the probability that error pairs are canceled simultaneously in two different projections is determined by their intersection size. Then, correlation coefficient which indicates the intersection size of two subspaces in a collection is introduced for collecting subspaces. Simulation results show that our proposed approach with a small number of projections onto collected subspaces performs close to the original approach.
Forward citations
Cited by 1 Pith paper
-
Density Evolution of Soft-Decision Collapsed Projection-Aggregation Decoding for Reed-Muller Codes over the BIAWGN Channel
Soft CPA decoding of RM codes is exact-marginal and symmetric; density evolution (with hard-decision approximations) captures its rapid soft-information collapse and yields vanishing error only at vanishing rate.
Discussion (0). Continue with ORCID to comment.