Limits RegistryPUBLIC RECORD
Limits RegistryDevised by Irving Reed and Gustave Solomon in 1960, Reed-Solomon codes achieve the theoretical maximum possible minimum distance for their length and dimension (the Singleton bound), a property called maximum-distance-separable (MDS). This optimality is the reason Reed-Solomon codes have remained in continuous practical use for over 60 years, from CDs and DVDs to QR codes, satellite links, RAID 6 storage arrays, and NASA deep-space probes.
The question, scope, and sources behind this Registry record.
Devised by Irving Reed and Gustave Solomon in 1960, Reed-Solomon codes achieve the theoretical maximum possible minimum distance for their length and dimension (the Singleton bound), a property called maximum-distance-separable (MDS). This optimality is the reason Reed-Solomon codes have remained in continuous practical use for over 60 years, from CDs and DVDs to QR codes, satellite links, RAID 6 storage arrays, and NASA deep-space probes.
Reed-Solomon codes achieve equality in the Singleton bound (d <= n - k + 1) for any block length n and dimension k over a sufficiently large finite field, making them maximum-distance-separable (MDS) — the best possible error-correcting distance for their length and rate.
Change a parameter to stress-test whether a proposed result is still inside the published specification. This is an audit aid, not a proof checker.
This record has no editable parameters. Read the formal question and assumptions before challenging it.
Current frontiers derived from accepted Claims.
An observed or demonstrated result; no opposing bound is implied.
The frontier is not sacred
Most progress starts with a disagreement that survives contact with evidence. If you can push the known lower bound up or pull the upper bound down, show us the work.
≥ when you have shown that at least this value is achievable.≤ when you have shown that anything above this value is impossible.No vibes. State the value, define the scope, and link the paper, proof, code, or reproduction that lets another person check it. Editors review every challenge before the public record changes.
Challenge this recordAssertions tied to evidence, attribution, and review.
The frontier as it changed over time.
Only accepted Claims matching the current specification contribute to the displayed bounds. Strict inequalities remain open; contradictory Claims require editorial review.
1 accepted Claim, with 1 linked evidence records.
Permanent ID limitsregistry.com/limits/LR-REED-SOLOMON-SINGLETON-BOUND
No active verified bounties are linked to this Limit.
View verified bounty tracker ↗No accepted machine-checked reproductions are recorded for this Limit.
Limits Registry. LR-REED-SOLOMON-SINGLETON-BOUND. Reed-Solomon codes achieve the maximum-distance-separable optimality bound. 2026.