Preprint Mathematics
Eight-point fiber certificates and binary-input list recovery of folded Reed–Solomon codes
- Manuscript
- Archived
- Edition
- 1 · 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 dimension cost at most nine, attained by the Boolean three-cube. A folded-Wronskian argument gives an average-radius list-recovery bound for primitive-power folded Reed–Solomon codes with input lists of size two and output cap seven. Supporting results treat structured sixteen-point configurations.
Keywords folded Reed–Solomon codes · list recovery · affine configurations · fiber certificates · folded Wronskian
Scope of the work
The main certificate applies to eight points over arbitrary fields. The general sixteen-point bound and output-cap-fifteen extension remain open. The coding result is a list-size bound; it does not supply a new decoding algorithm.
Reproduction notes
The complete package contains the eleven-page manuscript, LaTeX source, analytic proof and checksum receipt. Historical finite diagnostic evidence is documented in the package; the general statements rest on the analytic proof.
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 1). Luminary Research Archive. https://luminaryoddities.com/researcharchive/eight-point-fiber-certificates-binary-input-list-recovery-folded-reed-solomon-codes/v/1
BibTeX
@techreport{luminary_eight_point_fiber_certificates_binary_input_list_recovery_folded_reed_solomon_codes_v1,
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 = {Preprint},
note = {Version 1},
url = {https://luminaryoddities.com/researcharchive/eight-point-fiber-certificates-binary-input-list-recovery-folded-reed-solomon-codes/v/1}
}Reader correspondence
Share feedback
Questions, observations, and corrections are welcome. Your message goes privately to the research team and refers to edition 1.
Sign in to Luminary