Search Results for ""

Let u_(B,b)(n) be the number of digit blocks of a sequence B in the base-b expansion of n. The following table gives the sequence {u_(B)(n)} for a number of blocks B. B OEIS ...

The study of designs and, in particular, necessary and sufficient conditions for the existence of a block design.

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

A p×q submatrix of an m×n matrix (with p<=m, q<=n) is a p×q matrix formed by taking a block of the entries of this size from the original matrix.

A t-(v,k,lambda) block design (abbreviated t-design) is an incidence structure of points and blocks such that the following hold: 1. There are v points, 2. Each block ...

A set (usually of letters) from which a subset is drawn. A sequence of letters is called a word, and a set of words is called a code.

The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...

A set of blocks, also called a resolution class, that partition the set V, where (V,B) is a balanced incomplete block design.

A codeword is an element of an error-correcting code C. If C has length n, then a codeword in C has the form (c_1,c_2,...,c_n), where each c_i is a letter in the alphabet of ...

A sophisticated checksum (often abbreviated CRC), which is based on the algebra of polynomials over the integers (mod 2). It is substantially more reliable in detecting ...