Search Results for ""

Given a ring R with identity, the general linear group GL_n(R) is the group of n×n invertible matrices with elements in R. The general linear group GL_n(q) is the set of n×n ...

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...

Let V=R^k be a k-dimensional vector space over R, let S subset V, and let W={w in V:w·n^^=0} be a subspace of V of dimension k-1, where n^^ is a unit normal vector of W. Then ...

In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...

Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

Given a linear code C of length n and dimension k over the field F, a parity check matrix H of C is a n×(n-k) matrix whose rows generate the orthogonal complement of C, i.e., ...

Given an integer e>=2, the Payam number E_+/-(e) is the smallest positive odd integer k such that for every positive integer n, the number k·2^n+/-1 is not divisible by any ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...