Search Results for ""
1 - 10 of 108 for Hamming_schemeSearch Results
A local-ringed space which is locally isomorphic to an affine scheme.
Let P be the set of prime ideals of a commutative ring A. Then an affine scheme is a technical mathematical object defined as the ring spectrum sigma(A) of P, regarded as a ...
If K is a simplicial complex, let V be the vertex set of K. Furthermore, let K be the collection of all subsets {a_0,...,a_n} of V such that the vertices a_0, ..., a_n span a ...
A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...
The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.
An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...
The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...
If the abstract simplicial complex S is isomorphic with the vertex scheme of the simplicial complex K, then K is said to be a geometric realization of S, and is uniquely ...
The two-dimensional version of the ham sandwich theorem.
A syllogism, also known as a rule of inference, is a formal logical scheme used to draw a conclusion from a set of premises. An example of a syllogism is modus ponens.
...
View search results from all Wolfram sites (2298 matches)