Research Article · Preprint Mathematics
Eight-point fiber certificates and binary-input list recovery of folded Reed–Solomon codes
- Primary subject
- Mathematics
- Subject subfields
- Coding Theory
- Paper type
- Research Article
- Manuscript stage
- Preprint
- Manuscript
- Archived
- Edition
- 2 · Permanent link
Overview
Abstract
For eight distinct points over an arbitrary field, we construct a finite nonnegative rational certificate bounding the total population of the two largest fibers of every linear quotient. The certificate has intercept two and total dimension cost at most nine, and its weights are fixed independently of the quotient. This cost is attained by the Boolean three-cube. A standard folded-Wronskian argument then gives average-radius list recovery with input lists of size two and output cap seven for primitive-power folded Reed–Solomon codes whenever (k-1)/(n(s-6))<2/3-8ρ/9, with folding s≥7. The asymptotic tradeoff is the corresponding case of the existing Chen–Zhang conjecture. As supporting results, we prove that three arbitrary replacements of vertices of a Boolean four-cube preserve certificate cost at most 56/3, and exhibit an all-field family of affine dimension six attaining that cost.
Keywords folded Reed–Solomon codes · list recovery · affine configurations · fiber certificates · folded Wronskian
Scope of the work
All-field eight-point quotient-fiber certificates with intercept two and dimension cost at most nine, and the resulting binary-input/output-cap-seven average-radius bound for the stated primitive-power folded Reed–Solomon regime, with structured sixteen-point extensions.
Reproduction notes
The paper has 11 pages. The editable-source archive contains 11 files. Compile manuscript/main.tex from its directory with the included section and reference files; the mathematical proofs are analytic.
The manuscript
Read the paper
The complete manuscript, as published in this edition.
If the reader is unavailable on your device, open or download the PDF directly.
A stable scholarly record
Cite this edition
Scott Schubr. (2026). Eight-point fiber certificates and binary-input list recovery of folded Reed–Solomon codes (Version 2). Luminary Research Archive. https://research.luminaryoddities.com/eight-point-fiber-certificates-binary-input-list-recovery-folded-reed-solomon-codes/v/2
BibTeX
@techreport{luminary_eight_point_fiber_certificates_binary_input_list_recovery_folded_reed_solomon_codes_v2,
title = {Eight-point fiber certificates and binary-input list recovery of folded Reed–Solomon codes},
author = {Scott Schubr},
year = {2026},
institution = {Luminary Research Archive},
type = {Research Article},
note = {Version 2},
url = {https://research.luminaryoddities.com/eight-point-fiber-certificates-binary-input-list-recovery-folded-reed-solomon-codes/v/2}
}Loading discussion…