Random linear codes have sharp thresholds for local properties

A Universal Threshold Theory for Local Properties of Random Linear Codes

Information TheoryComputational Complexity

Summary

Random linear codes are used in computer science to encode data. This paper shows that for many local properties—those depending on a small set of codewords—the chance that a random code has the property changes abruptly around a specific code size. The authors prove that this threshold is closely predicted by a simple mathematical estimate called the expectation threshold. They also show this insight works not just for fully random codes but for certain pseudorandom codes too, expanding its usefulness to more practical coding schemes.

What this means in practice

  • For coding engineers: Design pseudorandom codes with guaranteed local properties matching random codes’ performance, improving efficient error correction schemes.
  • For data storage engineers: Develop linear hashing schemes with predictable maximum load for arbitrary data sets, enhancing hashing reliability beyond classical random assumptions.

A theory result. No direct application yet.

Authors

Vinayak M. Kumar, Ray Li, Jonathan Mosheiff, Gilad Shavit

Abstract

Thresholds for local properties tell us which guarantees to expect from random linear codes (RLCs) and help us carry those guarantees over to structured codes. A monotone property is $b$-local if a collection of at most $b$ codewords can witness its satisfaction or failure, as in list decoding and list recovery. The threshold of $\mathcal P$ is the code dimension at which the probability that an RLC in $\mathbb{F}_q^n$ satisfies $\mathcal P$ crosses $1/2$ in a sharp transition. We show that the threshold of a $b$-local property $\mathcal P$ is within $O(b)$ dimensions of the expectation threshold. This is the dimension predicted by the best union bound over covers of $\mathcal P$: families of subspaces such that the span of every witness contains at least one member. This gives a general derandomization statement: Any decreasing local property satisfied by RLCs at a given rate holds at a similar rate for pseudorandom ensembles that fool the cover union bound. In addition to previously studied ensembles, these include codes whose parity-check matrix is sampled from a small-bias distribution. Because our threshold characterization applies to all local properties, this derandomization also reaches properties beyond the scope of earlier reductions, including maximum loads in linear hashing for arbitrary input sets, rank-metric list decoding, and list decoding from insertion-deletion errors and burst errors. Our theorem unifies and strengthens prior works on row-symmetric and coordinate-wise linear characterizations, which located the threshold to within $O(q^{2b}\log_q n)$ and $O(b^2+nb/\log_2 q)$ dimensions, respectively. We obtain $O(b)$ error for every $b$-local property, independently of alphabet size. Under suitable pseudorandomness bounds, the rate loss vanishes for every $b=o(n)$, compared to $b=O(\log n)$ for earlier frameworks.