In coding theory, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight. Let C ⊂ F 2...

Look up enumerator in Wiktionary, the free dictionary. Enumerator may refer to: Iterator (computer science) An enumerator in the context of iteratees...

equal to the degree of the corresponding polynomial. Polynomial sequences are a topic of interest in enumerative combinatorics and algebraic combinatorics...

check Damm algorithm Dual code EXIT chart Error-correcting code Enumerator polynomial Fletcher's checksum Forward error correction Forward-backward algorithm...

In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions. They are related to Stirling...

The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a...

repetition of values may be necessary in this case. Diophantine: There is a polynomial p with integer coefficients and variables x, a, b, c, d, e, f, g, h, i...

In combinatorial mathematics, a rook polynomial is a generating polynomial of the number of ways to place non-attacking rooks on a board that looks like...

and runs in polynomial time (as opposed to, say, exponential time) exists, meaning the task completion time is bounded above by a polynomial function on...

computer science) In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems. NP is...

from an arbitrary field, its reciprocal polynomial or reflected polynomial, denoted by p∗ or pR, is the polynomial p ∗ ( x ) = a n + a n − 1 x + ⋯ + a 0...

preprocessing phase is generally assumed to be polynomial in the input. Backtracking: The simplest way to enumerate all solutions is by systematically exploring...

regression or local polynomial regression, also known as moving regression, is a generalization of the moving average and polynomial regression. Its most...

provide a general algorithm that, for any given Diophantine equation (a polynomial equation with integer coefficients and a finite number of unknowns), can...

In mathematics, an integral polytope has an associated Ehrhart polynomial that encodes the relationship between the volume of a polytope and the number...

orthogonal polynomials are the classical orthogonal polynomials, consisting of the Hermite polynomials, the Laguerre polynomials and the Jacobi polynomials. The...

elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed...

symmetric polynomial is a polynomial P(X1, X2, ..., Xn) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally...

In mathematics, the Zernike polynomials are a sequence of polynomials that are orthogonal on the unit disk. Named after optical physicist Frits Zernike...

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays...

restrictive properties that such a code must satisfy. In particular, the enumerator polynomial of the code is completely determined by the number of words of weights...

In mathematics, Gottlieb polynomials are a family of discrete orthogonal polynomials given by ℓ n ( x , λ ) = e − n λ ∑ k ( 1 − e λ ) k ( n k ) ( x k...

In mathematics, tropical geometry is the study of polynomials and their geometric properties when addition is replaced with minimization and multiplication...

mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(pm). This means that a polynomial F(X) of degree m...

Narayana polynomials are a class of polynomials whose coefficients are the Narayana numbers. The Narayana numbers and Narayana polynomials are named after...

functions precisely corresponds to the generating functions that enumerate quasi-polynomial sequences of the form f n = p 1 ( n ) ρ 1 n + ⋯ + p ℓ ( n ) ρ...

of symmetric polynomials, namely between power sums and elementary symmetric polynomials. Evaluated at the roots of a monic polynomial P in one variable...

quasi-polynomials are instead periodic functions with integral period. Quasi-polynomials appear throughout much of combinatorics as the enumerators for...

In combinatorial mathematics, the necklace polynomial, or Moreau's necklace-counting function, introduced by C. Moreau (1872), counts the number of distinct...

spanning trees in a graph, showing that this number can be computed in polynomial time from the determinant of a submatrix of the graph's Laplacian matrix;...