Search Results for ""

A linear code C is cyclic if for every codeword (c_0,c_1,...,c_(n-1)) in C, the codeword (c_(n-1),c_0,c_1,...,c_(n-2)) is also in C.

A permutation which shifts all elements of a set by a fixed offset, with the elements shifted off the end inserted back at the beginning. For a set with elements a_0, a_1, ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A formal structure for the organization of information. Examples of data structures include the list, queue, stack, and tree.

A database can be roughly defined as a structure consisting of 1. A collection of information (the data), 2. A collection of queries that can be submitted, and 3. A ...

A shift-invariant operator Q for which Qx is a nonzero constant. 1. Qa=0 for every constant a. 2. If p(x) is a polynomial of degree n, Qp(x) is a polynomial of degree n-1. 3. ...

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

A formal description of the constraints on the possible configurations of an experiment which is subject to given conditions. A design is sometimes called an experimental ...

The desmic configuration is three-dimensional configuration of points consisting of three tetrads of points, each two of the tetrads of which are perspective from the four ...

A diafix of a string T=s_1s_2...s_N is a substring s_(i+1)...s_(N-i) (0<=i<N/2). It is therefore not a first (prefix) or last (suffix) part of a string, but rather is a ...