Justesen code

Binary Justesen Codes
Named after	Jørn Justesen
Classification
Type	Linear block code
Block length	${\displaystyle n}$
Message length	${\displaystyle k}$
Rate	=${\displaystyle {\frac {R}{2}}={\frac {k}{2n}}}$
Distance	${\displaystyle \delta n}$ where ${\displaystyle \delta \geq {\Big (}1-R-\epsilon {\Big )}H_{2}^{-1}{\big (}{\frac {1}{2}}-\epsilon {\big )}\sim 0.11(1-R-\epsilon )}$ for small ${\displaystyle \epsilon >0}$.
Alphabet size	2
Notation	${\displaystyle \left[n,k/2,\delta n\right]_{2}}$-code
Properties
constant rate, constant relative distance, constant alphabet size
v t e

In coding theory, Justesen codes form a class of error-correcting codes that have a constant rate, constant relative distance, and a constant alphabet size.

Before the Justesen error correction code was discovered, no error correction code was known that had all of these three parameters as a constant.

Subsequently, other ECC codes with this property have been discovered, for example expander codes. These codes have important applications in computer science such as in the construction of small-bias sample spaces.

Justesen codes are derived as the code concatenation of a Reed–Solomon code and the Wozencraft ensemble.

The Reed–Solomon codes used achieve constant rate and constant relative distance at the expense of an alphabet size that is linear in the message length.

The Wozencraft ensemble is a family of codes that achieve constant rate and constant alphabet size, but the relative distance is only constant for most of the codes in the family.

The concatenation of the two codes first encodes the message using the Reed–Solomon code, and then encodes each symbol of the codeword further using a code from the Wozencraft ensemble – using a different code of the ensemble at each position of the codeword.

This is different from usual code concatenation where the inner codes are the same for each position. The Justesen code can be constructed very efficiently using only logarithmic space.