Research Article · Preprint Mathematics
Independent Squares and Average-Radius Obstructions for Linear Codes
- Primary subject
- Mathematics
- Subject subfields
- Coding Theory
- Paper type
- Research Article
- Manuscript stage
- Preprint
- Manuscript
- Archived
- Edition
- 1 · Permanent link
Overview
Abstract
Independent affine squares yield binary-input average-radius list-recovery obstructions for linear codes over finite fields. The paper proves an exact two-fiber certificate cost, develops unequal shortening groups, and gives sixteen-word folded Reed–Solomon constructions with mean relative error 3/4. Complete proofs, three certificates, and a portable reproduction package accompany the manuscript.
Keywords average-radius list recovery · linear codes · folded Reed–Solomon codes · independent affine squares · two-fiber certificates
Scope of the work
Linear codes over finite fields, binary input lists, independent-square profiles, and standard full-length folded Reed–Solomon realizations.
Reproduction notes
The downloadable package includes the manuscript, LaTeX source, three certificates, standard-library reproduction scripts, and saved verification receipts.
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). Independent Squares and Average-Radius Obstructions for Linear Codes (Version 1). Luminary Research Archive. https://research.luminaryoddities.com/independent-squares-average-radius-obstructions-linear-codes/v/1
BibTeX
@techreport{luminary_independent_squares_average_radius_obstructions_linear_codes_v1,
title = {Independent Squares and Average-Radius Obstructions for Linear Codes},
author = {Scott Schubr},
year = {2026},
institution = {Luminary Research Archive},
type = {Research Article},
note = {Version 1},
url = {https://research.luminaryoddities.com/independent-squares-average-radius-obstructions-linear-codes/v/1}
}Loading discussion…