Let be independent. In the general exponential-dispersion formulation, with known weights and common dispersion , their densities have the form
Thus
The systematic component is , and a specified one-to-one differentiable link relates it to the mean by
The unknown model parameters are the regression coefficient and, when it is not fixed by the family, the dispersion .
The log-likelihood is
up to terms independent of the parameters, where is determined from .
For a Poisson response,
so the natural parameter is and . The canonical link sets the linear predictor equal to the natural parameter and is therefore
Let be a primitive th root of unity in an extension of , where . A BCH code of length , initial exponent , and design distance is the cyclic code whose generator polynomial is the least common multiple over of the minimal polynomials of
Thus every codeword polynomial vanishes at these consecutive powers.
Suppose a nonzero codeword has weight , with
where the positions are distinct modulo and every is nonzero. The first root conditions give
The coefficient matrix is a Vandermonde matrix in the distinct elements , followed by multiplication of its columns by the nonzero factors . Its determinant is therefore
Hence all would be zero, a contradiction. The minimum distance consequently satisfies .
A code of minimum distance detects every pattern of at most errors and uniquely corrects every pattern of at most errors, because Hamming balls of that radius are disjoint. A BCH code of design distance is therefore guaranteed to detect errors and to correct
errors; its actual capabilities may be larger if .

There are unlisted articles, also show them or only show them.