# Burst error-correcting code

In coding theory, burst error-correcting codes employ methods of correcting burst errors, which are errors that occur in many consecutive bits rather than occurring in bits independently of each other.

Many codes have been designed to correct random errors. Sometimes, however, channels may introduce errors which are localized in a short interval. Such errors occur in a burst (called burst errors) because they occur in many consecutive bits. Examples of burst errors can be found extensively in storage mediums. These errors may be due to physical damage such as scratch on a disc or a stroke of lightning in case of wireless channels. They are not independent; they tend to be spatially concentrated. If one bit has an error, it is likely that the adjacent bits could also be corrupted. The methods used to correct random errors are inefficient to correct burst errors.

## Definitions

A burst of length 5

A burst of length $\textstyle l$[1]

Say a codeword $\textstyle C$ is transmitted, and it is received as $\textstyle Y = C + E$. Then, the error vector $\textstyle E$ is called a burst of length $\textstyle l$ if the nonzero components of $\textstyle E$ are confined to $\textstyle l$ consecutive components. For example, $\textstyle E = (0\textbf{1000011}0)$ is a burst of length $\textstyle l = 7$.

Although this definition is sufficient to describe what a burst error is, the majority of the tools developed for burst error correction rely on cyclic codes. This motivates our next definition.

A cyclic burst of length $\textstyle l$[1]

An error vector $\textstyle E$ is called a cyclic burst error of length $\textstyle l$ if its nonzero components are confined to $\textstyle l$ cyclically consecutive components. For example, the previously considered error vector $\textstyle E = (010000110)$, is a cyclic burst of length $\textstyle l = 5$, since we consider the error starting at position $\textstyle 6$ and ending at position $\textstyle 1$. Notice the indices are $\textstyle 0$-based, that is, the first element is at position $\textstyle 0$.

For the remainder of this article, we will use the term burst to refer to a cyclic burst, unless noted otherwise.

### Burst description

It is often useful to have a compact definition of a burst error, that encompasses not only its length, but also the pattern, and location of such error. We define a burst description to be a tuple $\textstyle (P,L)$ where $\textstyle P$ is the pattern of the error (that is the string of symbols beginning with the first nonzero entry in the error pattern, and ending with the last nonzero symbol), and $\textstyle L$ is the location, on the codeword, where the burst can be found.[1]

For example, the burst description of the error pattern $\textstyle E = (010000110)$ is $\textstyle D = (1000011,1)$. Notice that such description is not unique, because $\textstyle D' = (11001,6)$ is describing the same burst error. In general, if the number of nonzero components in $\textstyle E$ is $\textstyle w$, then $\textstyle E$ will have $\textstyle w$ different burst descriptions (each starting at a different nonzero entry of $\textstyle E$).

We now present a theorem that remedies some of the issues that arise by the ambiguity of burst descriptions.

#### Theorem: Uniqueness of burst descriptions

If $\textstyle E$ is an error vector of length $\textstyle n$ with two burst descriptions $\textstyle (P_1,L_1)$ and $\textstyle (P_2,L_2)$. If $\textstyle \mathrm{length}(P_1) + \mathrm{length}(P_2) \le n + 1$ (where $\textstyle \mathrm{length}(y)$ is the number of symbols in the error pattern $\textstyle y$), then the two descriptions are identical (that is, their components are equivalent)[2]

Proof: Let $\textstyle w$ be the hamming weight (or the number of nonzero entries) of $\textstyle E$. Then $\textstyle E$ has exactly $\textstyle w$ error descriptions. For $\textstyle w = 0$ or $\textstyle w = 1$, there is nothing to prove. So, we consider the cases where $\textstyle w \ge 2$. Assume that the descriptions are not identical. We notice that each nonzero entry of $\textstyle E$ will appear in the pattern, and so, the components of $\textstyle E$ not included in the pattern will form a cyclic run of 0's, beginning after the last nonzero entry, and continuing just before the first nonzero entry of the pattern. We call the set of indices corresponding to this run as the zero run. Let's consider the zero runs for the error pattern $\textstyle E = (010000110)$.

We immediately observe that each burst description has a zero run associated with it. But most importantly, we notice that each zero run is disjoint. Since we have $\textstyle w$zero runs, and each is disjoint, if we count the number of distinct elements in all the zero runs, we get a total of $\textstyle n-w$. With this observation in mind, we have a total of $\textstyle (n - \mathrm{length}(P_1)) + (n - \mathrm{length}(P_2))$zeros in $\textstyle E$. But, since $\textstyle \mathrm{length}(P_1) + \mathrm{length}(P_2) \le n+1$, this number is $\textstyle \ge n - 1$, which contradicts that $\textstyle w \ge 2$. Thus, the burst error descriptions are identical. A corollaryof the above theorem is that we cannot have two distinct burst descriptions for bursts of length $\textstyle (n+1)/2$.

## Cyclic codes for burst error correction

cyclic codes are defined as follows: Think of the $\textstyle q$ symbols as elements in $\textstyle \mathbb{F}_q$. Now, we can think of words as polynomials over $\textstyle \mathbb{F}_q$, where the individual symbols of a word correspond to the different coefficients of the polynomial. To define a cyclic code, we pick a fixed polynomial, called generator polynomial. The codewords of this cyclic code are all the polynomials that are divisible by this generator polynomial.

Codewords are polynomials of degree $\textstyle \leq n-1$. Suppose that the generator polynomial $\textstyle g(x)$ has degree $\textstyle r$. Polynomials of degree $\textstyle \leq n-1$ that are divisible by $\textstyle g(x)$ result from multiplying $\textstyle g(x)$ by polynomials of degree $\textstyle \leq n-1-r$. We have $\textstyle q^{n-r}$ such polynomials. Each one of them corresponds to a codeword. Therefore, $\textstyle k=n-r$ for cyclic codes.

Cyclic codes can detect all bursts of length up to $\textstyle l=n-k=r$. We will see later that the burst error detection ability of any $\textstyle (n, k)$ code is upper bounded by $\textstyle l \leq n-k$. Because cyclic codes meet that bound, they are considered optimal for burst error detection. This claim is proved by the following theorem:

### Theorem: Cyclic burst correction capability

Every cyclic code with generator polynomial of degree $\textstyle r$ can detect all bursts of length $\textstyle \leq r$.

Proof: To prove this, we need to prove that if you add a burst of length $\textstyle \leq r$ to a codeword (i.e. to a polynomial that is divisible by $\textstyle g(x)$), then the result is not going to be a codeword (i.e. the corresponding polynomial is not going to be divisible by $\textstyle g(x)$). It suffices to show that no burst of length $\textstyle \leq r$ is divisible by $\textstyle g(x)$. Such a burst has the form $\textstyle x^i b(x)$, where $\textstyle b(x)$ has degree $\textstyle < r$. Therefore, $\textstyle b(x)$ is not divisible by $\textstyle g(x)$ (because the latter has degree $\textstyle r$). $\textstyle g(x)$ is not divisible by $\textstyle x$ (Otherwise, all codewords would start with $\textstyle 0$). Therefore, $\textstyle x^i$ is not divisible by $\textstyle g(x)$ as well.

The above proof suggests a simple algorithm for burst error detection/correction in cyclic codes: given a transmitted word (i.e. a polynomial of degree $\textstyle \leq n-1$), compute the remainder of this word when divided by $\textstyle g(x)$. If the remainder is zero (i.e. if the word is divisible by $\textstyle g(x)$), then it is a valid codeword. Otherwise, report an error. To correct this error, subtract this remainder from the transmitted word. The subtraction result is going to be divisible by $\textstyle g(x)$ (i.e. it is going to be a valid codeword).

By the upper bound on burst error detection ($\textstyle l \leq n-k = r$), we know that a cyclic code can not detect all bursts of length $\textstyle l > r$. But luckily, it turns out that cyclic codes can indeed detect most bursts of length $\textstyle > r$. The reason is that detection fails only when the burst is divisible by $\textstyle g(x)$. Over binary alphabets, there exist $\textstyle 2^{l-2}$ bursts of length $\textstyle l$. Out of those, only $\textstyle 2^{l-2-r}$ are divisible by $\textstyle g(x)$. Therefore, the detection failure probability is very small ($\textstyle 2^{-r}$) assuming a uniform distribution over all bursts of length $\textstyle l$.

We now consider a fundamental theorem about cyclic codes that will aid in designing efficient burst-error correcting codes, by categorizing bursts into different cosets.

### Theorem: distinct cosets

A linear code $\textstyle C$ is an $\textstyle l$-burst-error-correcting code iff all the burst errors of length $\textstyle l$ or less lie in distinct cosets of $\textstyle C$.

Proof: Consider two different burst errors $\textstyle \mathbf{e}_1$ and $\textstyle \mathbf{e}_2$ of length $\textstyle l$ or less which lie in same coset of code $\textstyle C$. When we take the difference between the errors $\textstyle \mathbf{e}_1$ and $\textstyle \mathbf{e}_2$, we get $\textstyle \mathbf{c}$ $\textstyle (\mathbf{c} = \mathbf{e}_1 - \mathbf{e}_2)$ such that $\textstyle \mathbf{c}$ is a codeword. Hence, if we receive $\textstyle \mathbf{e}_1$, we can decode it either to $\textstyle \mathbf{0}$ or $\textstyle \mathbf{c}$. In contrast, if all the burst errors $\textstyle \mathbf{e}_1$ and $\textstyle \mathbf{e}_2$ do not lie in same coset, then each burst error is determined by its syndrome. The error can then be corrected through its syndrome. Thus, a linear code $\textstyle C$ is an $\textstyle l$-burst-error-correcting code if and only if all the burst errors of length $\textstyle l$ or less lie in distinct cosets of $\textstyle C$.

### Theorem: Burst error codeword classification

Let $\textstyle C$ be an $\textstyle[n, k]$-linear $\textstyle l$-burst-error-correcting code. Then, no nonzero burst of length $\textstyle 2l$ or less can be a codeword.

Proof: Consider the existence of a codeword $\textstyle c$ which has a burst of length less than or equal to $\textstyle 2l$. Thus, $\textstyle c$ has the pattern $\textstyle(0,1,u,v,1,0)$, where $u$ and $v$ are two words of length $\textstyle \leq l$ − 1. Hence, the words $\textstyle w = (0,1,u,0,0,0)$ and $\textstyle c$ $\textstyle -$ $\textstyle w = (0,0,0,v,1,0)$ are two bursts of length $\textstyle \leq l$. For binary linear codes, they belong to the same coset. This is a contradiction to theorem stated above. Thus, it follows that no nonzero burst of length $\textstyle 2l$ or less can be a codeword.

## Burst error correction bounds

### Upper bounds on burst error detection and correction

By upper bound, we mean a limit on our error detection ability that we can never go beyond. Suppose that we want to design an $\textstyle (n, k)$ code that can detect all burst errors of length $\textstyle \leq l$. A natural question to ask is: given $\textstyle n$ and $\textstyle k$, what is the maximum $\textstyle l$ that we can never achieve beyond? In other words, what is the upper bound on the length $\textstyle l$ of bursts that we can detect using any $\textstyle (n, k)$ code? The following theorem provides an answer to this question.

### Theorem: Burst error detection ability

The burst error detection ability of any $\textstyle (n, k)$ code is $\textstyle l \leq n-k$.

Proof: To prove this, we start by making the following observation: A code can detect all bursts of length $\textstyle \leq l$ if and only if no two codewords differ by a burst of length $\textstyle \leq l$. Suppose that we have two code words $\textstyle \mathbf{c}_1$ and $\textstyle \mathbf{c}_2$ that differ by a burst $\textstyle \mathbf{b}$ of length $\textstyle \leq l$. Upon receiving $\textstyle \mathbf{c}_1$, we can not tell whether the transmitted word is indeed $\textstyle \mathbf{c}_1$ with no transmission errors, or whether it is $\textstyle \mathbf{c}_2$ with a burst error $\textstyle \mathbf{b}$ that occurred during transmission. Now, suppose that every two codewords differ by more than a burst of length $\textstyle l$. Even if the transmitted codeword $\textstyle \mathbf{c}_1$ is hit by a burst $\textstyle \mathbf{b}$ of length $\textstyle l$, it is not going to change into another valid codeword. Upon receiving it, we can tell that this is $\textstyle \mathbf{c}_1$ with a burst $\textstyle \mathbf{b}$. By the above observation, we know that no two codewords can share the first $\textstyle n-l$ symbols. The reason is that even if they differ in all the other $\textstyle l$ symbols, they are still going to be different by a burst of length $\textstyle l$. Therefore, the number of codewords $\textstyle q^k$ satisfies $\textstyle q^k \leq q^{n-l}$. By taking the logarithm to the base $\textstyle q$ and rearranging, we can see that $\textstyle l \leq n-k$.

Now, we repeat the same question but for error correction: given $\textstyle n$ and $\textstyle k$, what is the upper bound on the length $\textstyle l$ of bursts that we can correct using any $\textstyle (n, k)$ code? The following theorem provides a preliminary answer to this question. However later on, we will see that the Rieger bound is going to provide a stronger answer..

### Theorem: Burst error correction ability

The burst error correction ability of any $\textstyle (n, k)$ code satisfies $\textstyle l \leq n-k-\log_q (n-l)+2$

Proof: We start with the following observation: A code can correct all bursts of length $\textstyle \leq l$ if and only if no two codewords differ by the sum of two bursts of length $\textstyle \leq l$. Suppose that two codewords $\textstyle \mathbf{c}_1$ and $\textstyle \mathbf{c}_2$ differ by two bursts $\textstyle \mathbf{b}_1$ and $\textstyle \mathbf{b}_2$ of length $\textstyle \leq l$ each. Upon receiving $\textstyle \mathbf{c}_1$ hit by a burst $\textstyle \mathbf{b}_1$, we could interpret that as if it was $\textstyle \mathbf{c}_2$ hit by a burst $\textstyle -\mathbf{b}_2$. We can not tell whether the transmitted word is $\textstyle \mathbf{c}_1$ or $\textstyle \mathbf{c}_2$. Now, suppose that every two codewords differ by more than two bursts of length $\textstyle l$. Even if the transmitted codeword $\textstyle \mathbf{c}_1$ is hit by a burst of length $\textstyle l$, it is not going to look like another codeword that has been hit by another burst. For each codeword $\textstyle \mathbf{c}$, let $\textstyle B(\mathbf{c})$ denote the set of all words that differ from $\textstyle \mathbf{c}$ by a burst of length $\textstyle \leq l$. Notice that $\textstyle B(\mathbf{c})$ includes $\textstyle \mathbf{c}$ itself. By the above observation, we know that for two different codewords $\textstyle \mathbf{c}_i$ and $\textstyle \mathbf{c}_j$, $\textstyle B(\mathbf{c}_i)$ and $\textstyle B(\mathbf{c}_j)$ are disjoint. We have $\textstyle q^k$ codewords. Therefore, we can say that $\textstyle q^k |B( \mathbf{c})| \leq q^n$. Moreover, we have $\textstyle (n-l)q^{l-2} \leq |B(\mathbf{c})|$. By plugging the latter inequality into the former, then taking the base $\textstyle q$ logarithm and rearranging, we get the above theorem. This theorem is weaker than the Rieger bound, which we will discuss later.

### Rieger bound

#### Theorem: The Rieger bound

If $\textstyle l$ is the burst error correcting ability of an $\textstyle[n, k]$ linear block code, then $2l \le n - k$.

Proof: Any linear code that can correct any burst pattern of length $\textstyle l$ or less cannot have a burst of length $\textstyle 2l$ or less as a codeword. If it had a burst of length $\textstyle 2l$ or less as a codeword, then a burst of length $\textstyle l$ could change the codeword to a burst pattern of length $\textstyle l$, which also could be obtained by making a burst error of length $\textstyle l$ in all zero codeword. If vectors are non-zero in first $\textstyle 2l$ symbols, then the vectors should be from different subsets of an array so that their difference is not a codeword of bursts of length $\textstyle 2l$. Ensuring this condition, the number of such subsets is at least equal to number of vectors. Thus, the number of subsets would be at least $q^{2l}$. Hence, we have at least $\textstyle 2l$ distinct symbols, otherwise, the difference of two such polynomials would be a codeword that is a sum of 2 bursts of length $\textstyle \leq l$. Thus, this proves the Rieger Bound. A linear burst-error-correcting code achieving the above Rieger bound is called an optimal burst-error-correcting code.

### Further bounds on burst error correction

There is more than one upper bound on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC). One such bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction, is the Abramson bound (a corollary of the Hamming bound for burst-error correction) when the cyclic burst length is less than half the block length.[3]

#### Theorem: Number of bursts

For $\textstyle 1 \le l \le (n+1)/2$, over a binary alphabet, there are $\textstyle n2^{l-1}+1$ vectors of length $\textstyle n$ which are bursts of length $\textstyle \le l$.[1]

Proof: Since the burst length is $\textstyle \le (n+1)/2$, there is a unique burst description associated with the burst. The burst can begin at any of the $\textstyle n$ positions of the pattern. Each pattern begins with the symbol $\textstyle 1$ and contain a length of $\textstyle l$. We can think of it as the set of all strings that begin with $\textstyle 1$ and have length $\textstyle l$. Thus, there are a total of $\textstyle 2^{l-1}$ possible such patterns, and a total of $\textstyle n2^{l-1}$ bursts of length $\textstyle \le l$. If we include the all-zero burst, we have $\textstyle n2^{l-1}+1$ vectors representing bursts of length $\textstyle \le l$.

#### Theorem: Bound on the number of codewords

If $\textstyle 1 \le l \le (n+1)/2$, a binary $\textstyle l$-burst error correcting code has at most $\textstyle 2^n/(n2^{l-1}+1)$ codewords.

Proof: Since $\textstyle l \le (n+1)/2$, we know that there are $\textstyle n2^{l-1}+1$ bursts of length $\textstyle \le l$. Say the code has $\textstyle M$ codewords, then there are $\textstyle Mn2^{l-1}$ codewords that differ from a codeword by a burst of length $\textstyle \le l$. Each of the $\textstyle M$ words must be distinct, otherwise the code would have distance $\textstyle < 1$. Therefore, $\textstyle M(2^{l-1}+1) \le 2^n$ implies $M \le (2^n)/(n2^{l-1}+1)$ as it was needed to be shown.

#### Theorem: Abramson's bounds

If $\textstyle 1 \le b \le (n+1)/2$ is a binary linear $\textstyle [n,k] l$-burst error correcting code, its block-length must satisfy:

$\textstyle n \le 2^{r-b+1} -1,$

where $\textstyle r = n-k$ is the code redundancy. An alternative formulation is

$\textstyle r \ge \lceil \log_2(n+1) \rceil + (b-1).$

Proof: For a linear $\textstyle [n,k]$ code, there are $\textstyle 2^k$ codewords. By our previous result, we know that $\textstyle 2^k \le \frac{2^n}{(n2^{b-1}+1)}$. Isolating $\textstyle n$, we get $\textstyle n \le 2^{r-b+1}-2^{-b+1}$. Since $\textstyle n$ must be an integer, we have $\textstyle n \le 2^{r-b+1}-1$. We can rearrange this final result, to obtain our bound on $\textstyle r$.

## Fire codes[3][4][5]

While cyclic codes in general are powerful tools for detecting burst errors, we now consider a family of binary cyclic codes named Fire Codes, which possess good single burst error correction capabilities. By single burst, say of length $\textstyle l$, we mean that all errors that a received codeword possess lie within a fixed span of $\textstyle l$ digits.

Let $\textstyle p(x)$ be an irreducible polynomial of degree $\textstyle m$ over $\textstyle \mathbb{F}_2$, and let $\textstyle p$ be the period of $\textstyle p(x)$. The period of $\textstyle p(x)$, and indeed of any polynomial, is defined to be the least positive integer $\textstyle r$ such that $\textstyle p(x) \mid (x^r - 1)$. Let $\textstyle l$ be a positive integer satisfying $\textstyle l \le m$ and $\textstyle 2l-1$ not divisible by $\textstyle p$, where $\textstyle p$ is the period of $\textstyle p(x)$. An $\textstyle l$-burst-error correcting Fire Code $\textstyle G$ is defined by the following generator polynomial: $\textstyle g(x) = (x^{2l-1}+1)p(x)$.

Theorem: $\textstyle p(x)$ and $\textstyle (x^{2l-1}+1)$ are relatively prime

Proof: Assume they are not. Then let $d(x) = \mathrm{GCD}(p(x),(x^{2l-1}+1))$. Since $\textstyle p(x)$ is irreducible, then $\textstyle \deg(d(x))$ is either $\textstyle 0$ or $\textstyle \deg(p(x))$. Assume $\textstyle \deg(d(x))$ is non-zero, then $\textstyle p(x) = c\;d(x)$ for some constant $\textstyle c$. But, $\textstyle (1/c)p(x)$ is a divisor of $\textstyle (x^{2l-1}+1)$ since $\textstyle d(x)$ is a divisor of $\textstyle (x^{2l-1}+1)$. But this contradicts our assumption that $\textstyle p(x)$ does not divide $\textstyle (x^{2l-1}+1)$. Thus, $\textstyle \deg(d(x))$ is indeed $\textstyle 0$ – making $\textstyle p(x)$ and $\textstyle (x^{2l-1}+1)$ relatively prime.

Theorem: If $\textstyle p(x)$is a polynomial of period $\textstyle p$, then $\textstyle p(x)$ divides $\textstyle x^k-1$, if and only if $\textstyle p \mid k$

Proof If $\textstyle p \mid k$, then $\textstyle x^k-1 = (x^p-1)(1 + x^p + x^{2p} + \ldots + x^{k/p})$. Thus, $\textstyle p(x)$ divides $\textstyle x^k-1$. Let $\textstyle p(x)$ divide $\textstyle x^k-1$. Then, $\textstyle k \ge p$. We show that $\textstyle k$ is divisible by $\textstyle p$ by induction on $\textstyle k$. The base case $\textstyle k=p$ follows. Therefore assume $\textstyle k$ > $\textstyle p$. We know that $\textstyle p(x)$ divides both (since it has period $\textstyle p$) $\textstyle x^p -1 = (x-1)(1 + x + \ldots + x^{p-1})$ and $\textstyle x^k - 1 = (x-1)(1 + x + \ldots + x^{k-1})$.

But $\textstyle p(x)$ is irreducible, therefore it must divide both $\textstyle (1 + x + \ldots + x^{p-1})$ and $\textstyle (1 + x + \ldots + x^{k-1})$; thus, it also divides the difference of the last two polynomials, $\textstyle x^p(1 + x + \ldots + x^{p-k-1})$. Then, it follows that $\textstyle p(x)$ divides $\textstyle (1 + x + \ldots + x^{p-k-1})$. Finally, it also divides: $\textstyle x^{k-p}-1 = (x-1)(1 + x + \ldots + x^{p-k-1})$. By the induction hypothesis, $\textstyle p \mid k-p$, then $\textstyle p \mid k$.

A corollary to this theorem is that since $\textstyle p(x) = x^p - 1$ has period $\textstyle p$, then $\textstyle p(x)$ divides $\textstyle x^k-1$ if and only if $\textstyle p \mid k$.

Theorem: The Fire Code is $\textstyle l$-burst error correcting[4][5]

If we can show that all bursts of length $\textstyle l$ or less occur in different cosets, we can use them as coset leaders that form correctable error patterns. The reason is simple: we know that each coset has a unique syndrome decoding associated with it, and if all bursts of different lengths occur in different cosets, then all have unique syndromes, facilitating error correction.

Proof Let $\textstyle x^ia(x)$ and $\textstyle x^jb(x)$ be polynomials with degrees $\textstyle l_1-1$ and $\textstyle l_2-1$, representing bursts of length $\textstyle l_1$ and $\textstyle l_2$ respectively. Further, $\textstyle l_1 \le l$ and $\textstyle l_2 \le l$. The integers $\textstyle i$ and $\textstyle j$ represent the starting positions of the bursts, and are less than the block length of the code. For contradiction sake, assume that $\textstyle x^{i}a(x)$ and $\textstyle x^{j}b(x)$ are in the same coset. Then, $\textstyle v(x) = x^ia(x) + x^jb(x)$ is a valid codeword (since both terms are in the same coset). Without loss of generality, pick $\textstyle i \le j$. By the division theorem, dividing $\textstyle j-i$ by $\textstyle 2l-1$ yields, $\textstyle j-i = g(2l-1)+r$, for integers $\textstyle g$ and $\textstyle r$, $\textstyle 0 \le r < \textstyle 2l-1$. We rewrite the polynomial $\textstyle v(x)$ as follows: $\textstyle v(x) = x^ia(x) + x^{i + g(2l-1) + r}$ $\textstyle = x^ia(x) + x^{i + g(2l-1) + r} + 2x^{i+r}b(x)$ $\textstyle = x^i(a(x) + x^bb(x)) + x^{i+r}b(x)(x^{g(2l-1)}+1)$

Notice that at the second manipulation, we introduced the term $\textstyle 2x^{i+r}b(x)$. We are allowed to do so, since Fire Codes operate on $\textstyle \mathbb{F}_2$. By our assumption, $\textstyle v(x)$ is a valid codeword, and thus, must be a multiple of $\textstyle g(x)$. As mentioned earlier, since the factors of $\textstyle g(x)$ are relatively prime, $\textstyle v(x)$ has to be divisible by $\textstyle x^{2l-1}+1$. Looking closely at the last expression derived for $\textstyle v(x)$ we notice that $\textstyle x^{g(2l-1)}+1$ is divisible by $\textstyle x^{2l-1}+1$ (by the corollary of our previous theorem). Therefore, $\textstyle a(x) + x^bb(x)$ is either divisible by $\textstyle x^{2l-1}+1$ or is $\textstyle 0$. Applying the division theorem again, we get

$\textstyle a(x) + x^bb(x) = d(x)(x^{2l-1}+1)$

for some polynomial $\textstyle d(x)$. Let $\textstyle \delta = \deg(d(x))$, thus $\textstyle \deg(d(x)(x^{2l-1}+1))$ is $\textstyle \delta + 2l -1$.Notice that $\textstyle \deg(a(x)) = l_1 - 1$ which is clearly $\textstyle < 2l-1$. This means that the degree of $\textstyle a(x) + x^bb(x)$ is established from the term $\textstyle x^bb(x)$, which is $\textstyle b + l_2 -1$. Equating the degree of both sides, gives us $\textstyle b + l_2 - 1 = 2l - 1 + \delta$.

Since $\textstyle l_1 \le l$ and $\textstyle l_2 \le l$, subtracting $\textstyle l_2$ from both sides yield: $\textstyle b \ge l_1 + \delta$, which implies $\textstyle b > l_1 -1$ and $\textstyle b > \textstyle \delta$. Notice that if we expand $\textstyle a(x) + x^bb(x)$ we get

$\textstyle 1 + a_1x + a_2x^2 + \ldots + x^{l_1-1} + x^b(1 + b_1x + b_2x^2 + \ldots + x^{l_2-1}).$

In particular, notice that the term $\textstyle x^b$ appears, in the above expansion. But, since $\textstyle \delta < b < 2l -1$, the resulting expression $\textstyle d(x)(x^{2l-1}+1)$ does not contain $\textstyle x^b$, therefore $\textstyle d(x) = 0$ and subsequently $\textstyle a(x) + x^bb(x) = 0$. This requires that $\textstyle b = 0$, and $\textstyle a(x) = b(x)$. We can further revise our division of $\textstyle j-i$ by $\textstyle g(2l-1)$ to reflect $\textstyle b=0$, that is $\textstyle j-i = g(2l-1)$. Substituting back into $\textstyle v(x)$ gives us,

$\textstyle v(x) = x^ib(x)(x^{j-1}+1).$

Since the degree of $\textstyle b(x)$ is $\textstyle l_2-1 < l$, we have $\textstyle \deg(b(x)) < \deg(p(x)) = m$. But $\textstyle p(x)$ is irreducible, therefore $\textstyle b(x)$ and $\textstyle p(x)$ must be relatively prime. Since $\textstyle v(x)$ is a codeword, $\textstyle x^{j-1}+1$ must be divisible by $\textstyle p(x)$, as it cannot be divisible by $\textstyle x^{2l-1}+1$. Therefore, $\textstyle j-i$ must be a multiple of $\textstyle p$. But it must also be a multiple of $\textstyle 2l-1$, which implies it must be a multiple of $\textstyle n = \mathrm{LCM}(2l-1,p)$ but that is precisely the block-length of the code. Therefore, $\textstyle j-i$ cannot be a multiple of $\textstyle n$ since they are both less than $\textstyle n$. Thus, our assumption of $\textstyle v(x)$ being a codeword is incorrect, and therefore $\textstyle x^ia(x)$ and $\textstyle x^jb(x)$ are in different cosets, with unique syndromes, and therefore correctable.

### Example: 5-burst error correcting fire code

With the theory presented in the above section, let us consider the construction of a $\textstyle 5$-burst error correcting Fire Code. Remember that to construct a Fire Code, we need an irreducible polynomial $\textstyle p(x)$, an integer $\textstyle l$, representing the burst error correction capability of our code, and we need to satisfy the property that $\textstyle 2l-1$ is not divisible by the period of $\textstyle p(x)$. With these requirements in mind, consider the irreducible polynomial $\textstyle p(x) = 1 + x^2 + x^5$, and let $\textstyle l = 5$. Since $\textstyle p(x)$ is a primitive polynomial, its period is $\textstyle 2^5 - 1 = 31$. We confirm that $\textstyle 2l - 1 = 9$ is not divisible by $\textstyle 31$. Thus, $\textstyle g(x) = (x^9+1)(1 + x^2 + x^5) = 1 + x^2 + x^5 + x^9 + x^11 + x^{14}$ is a Fire Code generator. We can calculate the block-length of the code by evaluating the least common multiple of $\textstyle p$ and $\textstyle 2l-1$. In other words, $\textstyle n = \mathrm{LCM}(9,31) = 279$. Thus, the Fire Code above is a cyclic code capable of correcting any burst of length $\textstyle 5$ or less.

## Binary Reed–Solomon codes

Certain families of codes, such as Reed–Solomon, operate on alphabet sizes larger than binary. This property awards such codes powerful burst error correction capabilities. Consider a code operating on $\textstyle \mathbb{F}_{2^m}$. Each symbol of the alphabet can be represented by $\textstyle m$ bits. If $\textstyle C$ is an $\textstyle [n,k]$ Reed–Solomon code over $\textstyle \mathbb{F}_{2^m}$, we can think of $\textstyle C$ as an $\textstyle [mn,mk]_2$ code over $\textstyle \mathbb{F}_{2}$.

The reason such codes are powerful for burst error correction is that each symbol is represented by $\textstyle m$ bits, and in general, it is irrelevant how many of those $\textstyle m$ bits are erroneous; whether a single bit, or all of the $\textstyle m$ bits contain errors, from a decoding perspective it is still a single symbol error. In other words, since burst errors tend to occur in clusters, there is a strong possibility of several binary errors contributing to a single symbol error.

Notice that a burst of $\textstyle (m+1)$ errors can affect at most $\textstyle 2$ symbols, and a burst of $\textstyle 2m+1$ can affect at most $\textstyle 3$ symbols. Then, a burst of $\textstyle tm+1$ can affect at most $\textstyle t + 1$ symbols; this implies that a $\textstyle t$-symbols-error correcting code can correct a burst of length at most $\textstyle (t-1)m+1$.

In general, a $\textstyle t$-error correcting Reed–Solomon code over $\textstyle \mathbb{F}_{2^m}$ can correct any combination of

$\frac{t}{1+\lfloor (l+m-2)/m \rfloor}$

or fewer bursts of length $\textstyle l$, on top of being able to correct $\textstyle t$-random worst case errors.

### An example of a binary RS code

Let $\textstyle G$ be a $\textstyle [255,223,33]$ RS code over $\textstyle \mathbb{F}_{28}$. This code was employed by NASA in their Cassini-Huygens spacecraft.[6] It is capable of correcting $\textstyle \lfloor 33/2 \rfloor = 16$ symbol errors. We now construct a Binary RS Code $\textstyle G'$ from $\textstyle G$. Each symbol will be written using $\textstyle \lceil \log_2(255) \rceil = 8$ bits. Therefore, the Binary RS code will have $\textstyle [2040,1784,33]_2$ as its parameters. It is capable of correcting any single burst of length $\textstyle l = 121$.

## Interleaved codes

Interleaving is used to convert convolutional codes from random error correcters to burst error correcters.The basic idea behind the use of interleaved codes is to jumble symbols at the receiver. This leads to randomization of bursts of received errors which are closely located and we can then apply the analysis for random channel. Thus, the main function performed by the interleaver at transmitter is to alter the input symbol sequence. At the receiver, the deinterleaver will alter the received sequence to get back the original unaltered sequence at the transmitter.

### Burst error correcting capacity of interleaver

Theorem: If the burst error correcting ability of some code is $\textstyle l$, then the burst error correcting ability of its $\textstyle \lambda$-way interleave is $\textstyle \lambda l$.

Proof: Suppose that we have an $\textstyle (n, k)$ code that can correct all bursts of length $\textstyle \leq l$. Interleaving can provide us with a $\textstyle (\lambda n, \lambda k)$ code that can correct all bursts of length $\textstyle \leq \lambda l$, for any given $\textstyle \lambda$. If we want to encode a message of an arbitrary length using interleaving, first we divide it into blocks of length $\textstyle \lambda k$. We write the $\textstyle \lambda k$ entries of each block into a $\textstyle \lambda \times k$ matrix using row-major order. Then, we encode each row using the $\textstyle (n, k)$ code. What we will get is a $\textstyle \lambda \times n$ matrix. Now, this matrix is read out and transmitted in column-major order. The trick is that if there occurs a burst of length $\textstyle h$ in the transmitted word, then each row will contain approximately $\textstyle \frac{h}{\lambda}$ consecutive errors (More specifically, each row will contain a burst of length at least $\textstyle \lfloor\frac{h}{\lambda}\rfloor$ and at most $\textstyle \lceil\frac{h}{\lambda}\rceil$). If $\textstyle h \leq \lambda l$, then $\textstyle \frac{h}{\lambda} \leq l$ and the $\textstyle (n, k)$ code can correct each row. Therefore, the interleaved $\textstyle (\lambda n, \lambda k)$ code can correct the burst of length $\textstyle h$. Conversely, if $\textstyle h > \lambda l$, then at least one row will contain more than $\textstyle \frac{h}{\lambda}$ consecutive errors, and the $\textstyle (n, k)$ code might fail to correct them. Therefore, the error correcting ability of the interleaved $\textstyle (\lambda n, \lambda k)$ code is exactly $\textstyle \lambda l$. The BEC efficiency of the interleaved code remains the same as the original $\textstyle (n, k)$ code. This is true because: $\frac{2\lambda l}{\lambda n - \lambda k}\quad=\quad\frac{2l}{n-k}$

### Block interleaver

The figure below shows a 4 by 3 interleaver.

An example of a block interleaver

The above interleaver is called as a block interleaver. Here, the input symbols are written sequentially in the rows and the output symbols are obtained by reading the columns sequentially. Thus, this is in the form of $\textstyle M \times N$ array. Generally, $\textstyle N$ is length of the codeword.

Capacity of block interleaver: For an $\textstyle M \times N$ block interleaver and burst of length $\textstyle l$, the upper limit on number of errors = ${\dfrac{l}{M}}$. This is obvious from the fact that we are reading the output column wise and the number of rows is $\textstyle M$. By the theorem of Burst Error Correcting Capacity of Interleaver stated above, for error correction capacity up to $\textstyle t$, the maximum burst length allowed = $\textstyle Mt$ For burst length of $\textstyle Mt+1$, the decoder may fail.

Efficiency of block interleaver ($\gamma$): It is found by taking ratio of burst length where decoder may fail to the interleaver memory. Thus, we can formulate $\gamma$ as $\gamma={\dfrac{Mt+1}{MN}} \approx {\dfrac{t}{N}}$

Drawbacks of block interleaver : As it is clear from the figure, the columns are read sequentially, the receiver can interpret single row only after it receives complete message and not before that. Also, the receiver requires a considerable amount of memory in order to store the received symbols and has to store the complete message. Thus, these factors give rise to two drawbacks, one is the latency and other is the storage (fairly large amount of memory). These drawbacks can be avoided by using the convolutional interleaver described below.

### Convolutional interleaver

Cross interleaver is a kind of multiplexer-demultiplexer system. In this system, delay lines are used to progressively increase length. Delay line is basically an electronic circuit used to delay the signal by certain time duration. Let $\textstyle n$ be the number of delay lines and $\textstyle d$ be the number of symbols introduced by each delay line. Thus, the separation between consecutive inputs = $\textstyle nd$ symbols Let the length of codeword ≤ $\textstyle n$. Thus, each symbol in the input codeword will be on distinct delay line. Let a burst error of length $\textstyle l$ occur. Since the separation between consecutive symbols is $\textstyle nd$, the number of errors that deinterleaved output may contain is ${\dfrac{l}{nd+1}}$ By the theorem of Burst Error Correcting Capacity of Interleaver stated above, for error correction capacity up to $\textstyle t$, maximum burst length allowed = $\textstyle (nd+1)(t-1)$ For burst length of $\textstyle (nd+1)(t-1)+1$,decoder may fail.

An example of a convolutional interleaver
An example of a deinterleaver

Efficiency of cross interleaver ($\gamma$): It is found by taking the ratio of burst length where decoder may fail to the interleaver memory. In this case, the memory of interleaver can be calculated as $(0 + 1 + 2 + 3 + \cdots + (n-1))d = \dfrac{n \cdot d \cdot (n-1)}{2}$ Thus, we can formulate $\gamma$ as $\gamma={\dfrac{(nd+1) \cdot (t-1)+1}{nd \cdot (n-1)/2}}$

Performance of cross interleaver : As shown in the above interleaver figure, the output is nothing but the diagonal symbols generated at the end of each delay line. In this case, when the input multiplexer switch completes around half switching, we can read first row at the receiver. Thus, we need to store maximum of around half message at receiver in order to read first row. This drastically brings down the storage requirement by half. Since just half message is now required to read first row, the latency is also reduced by half which is good improvement over the block interleaver. Thus, the total interleaver memory is split between transmitter and receiver.

## Applications

### Compact disc

Without error correcting codes, digital audio would not be technically feasible.[7] The Reed–Solomon codes can correct a corrupted symbol with a single bit error just as easily as it can correct a symbol with all bits wrong. This makes the RS codes particularly suitable for correcting burst errors.[5] By far, the most common application of RS codes is in compact discs. In addition to basic error correction provided by RS codes, protection against burst errors due to scratches on the disc is provided by a cross interleaver.[3]

Current compact disc digital audio system was developed by N. V. Philips of The Netherlands and Sony Corporation of Japan (agreement signed in 1979).

A compact disc comprises a 120 mm aluminized disc coated with a clear plastic coating, with spiral track, approximately 5 km in length, which is optically scanned by a laser of wavelength ~0.8 μm, at a constant speed of ~1.25 m/s. For achieving this constant speed, rotation of the disc is varied from ~8 rev/s while scanning at the inner portion of the track to ~3.5 rev/s at the outer portion. Pits and lands are the depressions (0.12 μm deep) and flat segments constituting the binary data along the track (0.6 μm width).[8]

The CD process can be abstracted as a sequence of the following sub-processes: -> Channel encoding of source of signals -> Mechanical sub-processes of preparing a master disc, producing user discs and sensing the signals embedded on user discs while playing – the channel -> Decoding the signals sensed from user discs

The process is subject to both burst errors and random errors.[7] Burst errors include those due to disc material (defects of aluminum reflecting film, poor reflective index of transparent disc material), disc production (faults during disc forming and disc cutting etc.), disc handling (scratches – generally thin, radial and orthogonal to direction of recording) and variations in play-back mechanism. Random errors include those due to jitter of reconstructed signal wave and interference in signal. CIRC (Cross-Interleaved Reed–Solomon code) is the basis for error detection and correction in the CD process. It corrects error bursts up to 3,500 bits in sequence (2.4 mm in length as seen on CD surface) and compensates for error bursts up to 12,000 bits (8.5 mm) that may be caused by minor scratches.

Encoding: Sound-waves are sampled and converted to digital form by an A/D converter. The sound wave is sampled for amplitude (at 44.1 kHz or 44,100 pairs, one each for the left and right channels of the stereo sound). The amplitude at an instance is assigned a binary string of length 16. Thus, each sample produces two binary vectors from $\textstyle \mathbb{F}_2^{16}$ or 4 $\textstyle \mathbb{F}_2^{8}$ bytes of data. Every second of sound recorded results in 44,100 × 32 = 1,411,200 bits (176,400 bytes) of data.[5] The 1.41 Mbit/s sampled data stream passes through the error correction system eventually getting converted to a stream of 1.88 Mbit/s.

Input for the encoder consists of input frames each of 24 8-bit symbols (12 16-bit samples from the A/D converter, 6 each from left and right data (sound) sources). A frame can be represented by $\textstyle L_1 R_1 L_2 R_2 \ldots L_6 R_6$ where $\textstyle L_i$ and $\textstyle R_i$ are bytes from the left and right channels from the $\textstyle i^{th}$ sample of the frame.

Initially, the bytes are permuted to form new frames represented by $\textstyle L_1 L_3 L_5 R_1 R_3 R_5 L_2 L_4 L_6 R_2 R_4 R_6$ where $\textstyle L_i,R_i$represent $\textstyle i^{th}$ left and right samples from the frame after 2 intervening frames.

Next, these 24 message symbols are encoded using C2 (28,24,5) Reed–Solomon code which is a shortened RS code over $\textstyle \mathbb{F}_{256}$. This is two-error-correcting, being of minimum distance 5. This adds 4 bytes of redundancy, $\textstyle P_1 P_2$ forming a new frame: $\textstyle L_1 L_3 L_5 R_1 R_3 R_5 P_1 P_2 L_2 L_4 L_6 R_2 R_4 R_6$. The resulting 28-symbol codeword is passed through a (28.4) cross interleaver leading to 28 interleaved symbols. These are then passed through C1 (32,28,5) RS code, resulting in codewords of 32 coded output symbols. Further regrouping of odd numbered symbols of a codeword with even numbered symbols of the next codeword is done to break up any short bursts that may still be present after the above 4-frame delay interleaving. Thus, for every 24 input symbols there will be 32 output symbols giving $\textstyle R = 24/32$. Finally one byte of control and display information is added.[5] Each of the 33 bytes is then converted to 17 bits through EFM (eight to fourteen modulation) and addition of 3 merge bits. Therefore the frame of six samples results in 33 bytes × 17 bits (561 bits) to which are added 24 synchronization bits and 3 merging bits yielding a total of 588 bits.

Decoding: The CD player (CIRC decoder) receives the 32 output symbol data stream. This stream passes through the decoder D1 first. It is up to individual designers of CD systems to decide on decoding methods and optimize their product performance. Being of minimum distance 5 The D1,D2 decoders can each correct a combination of $\textstyle e$ errors and $\textstyle f$ erasures such that $\textstyle 2e+f<5$.[5] In most decoding solutions, D1 is designed to correct single error. And in case of more than 1 error, this decoder outputs 28 erasures. The deinterlever at the succeeding stage distributes these erasures across 28 D2 codewords. Again in most solutions, D2 is set to deal with erasures only (a simpler and less expensive solution). If more than 4 erasures were to be encountered, 24 erasures are output by D2. Thereafter, an error concealment system attempts to interpolate (from neighboring symbols) in case of uncorrectable symbols, failing which sounds corresponding to such erroneous symbols get muted.

Performance of CIRC:[7] CIRC conceals long bust errors by simple linear interpolation. 2.5 mm of track length (4000 bits) is the maximum completely correctable burst length. 7.7 mm track length (12,300 bits) is the maximum burst length that can be interpolated. Sample interpolation rate is one every 10 hours at Bit Error Rate (BER) $= \textstyle 10^{-4}$ and 1000 samples per minute at BER = $\textstyle 10^{-3}$ Undetectable error samples (clicks): less than one every 750 hours at BER = $\textstyle 10^{-3}$ and negligible at BER = $\textstyle 10^{-4}$.