# gfdeconv

Divide polynomials over Galois field

## Description

`[`

divides two GF(`q`

,`r`

] = gfdeconv(`b`

,`a`

,`field`

)*p ^{m}*) polynomials, where

`field`

is a matrix containing the *m*-tuple of all elements in GF(

*p*).

^{m}*p*is a prime number, and

*m*is a positive integer.

`b`

, `a`

, and `q`

are in the same Galois field.In this syntax, each coefficient is specified in exponential format, specifically
[-Inf, 0, 1, 2, ...]. The elements in exponential format represent the
`field`

elements [0, 1, *α*,
*α*^{2}, ...] relative to some primitive
element *α* of
GF(*p ^{m}*).

## Examples

## Input Arguments

## Output Arguments

## Tips

The gfdeconv function performs computations in GF(

*p*), where^{m}*p*is prime, and*m*is a positive integer. It divides polynomials over a Galois field. To work in GF(2), use the^{m}`deconv`

function of the`gf`

object with Galois arrays. For details, see Multiplication and Division of Polynomials.To divide elements of a Galois field, you can also use

`gfdiv`

instead of`gfdeconv`

. Algebraically, dividing polynomials over a Galois field is equivalent to deconvolving vectors containing the coefficients of the polynomials. This deconvolution operation uses arithmetic over the same Galois field.

## See Also

### Functions

**Introduced before R2006a**