# cyclpoly

Produce generator polynomials for binary cyclic code

## Description

## Examples

## Input Arguments

## Output Arguments

## More About

## Algorithms

Generator polynomials are found by looping through degree-(`N`

–
`K`

) polynomials and finding those that are divisors of the polynomial
*x*^{N} – 1. If
`opt`

is omitted, `cyclpoly`

returns the first
polynomial it finds that satisfies this condition. If `opt`

is
`'min'`

or `'max'`

, `cyclpoly`

returns
the generator polynomial with either the smallest or greatest possible weight respectively. If
`opt`

is `'all'`

, `cyclpoly`

returns
all the polynomials it finds that satisfies this condition in a matrix of binary row vectors,
which each row representing an individual polynomial.

## Version History

**Introduced before R2006a**