Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds

TL;DR

This paper introduces explicit constructions and bounds for subcodes of Reed--Solomon product codes, aiming to enhance minimum distance while maintaining high dimension, with applications in blockchain data availability sampling.

Contribution

It provides new explicit subcode constructions with optimal or near-optimal minimum distance and establishes a novel upper bound on subcode minimum distance.

Findings

Constructed subcodes achieve maximum minimum distance for certain dimensions.

Field size for constructions is linearly bounded by code length.

New upper bound on minimum distance of subcodes of product codes.

Abstract

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roadmap. This motivates us to consider subcodes of such codes with the goal of obtaining a larger minimum distance. In this paper, we present explicit constructions of subcodes of Reed--Solomon product codes, along with bounds on their minimum distance. In particular, they achieve an optimal or near-optimal dimension--distance tradeoff. For component codes of dimension $r$, our construction requires a field whose size is bounded linearly by the overall product code length, and attains the maximum possible minimum distance for subcode dimensions $r^2-1$, $r^2-2$, and all dimensions at most $2r-1$. Furthermore, we establish a new upper bound on the minimum distance of subcodes of the product of two codes with identical parameters.