REVIEW 3 cited by
Improved List Size for Folded Reed-Solomon 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
abstract
Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate $R$ that can be list decoded up to radius $1-R-\epsilon$ with lists of size $\mathcal{O}(1/ \epsilon^2)$. This improves the best known list size among explicit list decoding capacity achieving codes. We also show a more general result that for any $k\geq 1$, there are explicit FRS codes with rate $R$ and distance $1-R$ that can be list decoded arbitrarily close to radius $\frac{k}{k+1}(1-R)$ with lists of size $(k-1)^2+1$. Our results are based on a new and simple combinatorial viewpoint of the intersections between Hamming balls and affine subspaces that recovers previously known parameters. We then use folded Wronskian determinants to carry out an inductive proof that yields sharper bounds.
Forward citations
Cited by 3 Pith papers
-
Explicit Codes approaching Generalized Singleton Bound using Expanders
AEL expander amplification is shown to preserve a strengthened average-radius list decoding property with erasures, yielding explicit codes with constant alphabet and optimal list size near the generalized Singleton bound.
-
Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
Folded Reed–Solomon codes exhibit (δ,ε)-proximity gaps up to the capacity radius δ=1−R−η, with ε≈O((n/η+1/η³)/q), proved via subspace designs and a new line-stitching mechanism.
-
BloQBench: A Blockchain Benchmarking Framework for Quantum Supremacy
An Ethereum contract generates hard-to-factor integer locks whose on-chain factorization is meant to certify cryptographic quantum supremacy and trigger quantum-secure signatures.
Discussion (0). Continue with ORCID to comment.