About: Hamming space

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Hamming space Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/5tfKc9LuMv

In statistics and coding theory, a Hamming space (named after American mathematician Richard Hamming) is usually the set of all binary strings of length N. It is used in the theory of coding signals and transmission. More generally, a Hamming space can be defined over any alphabet (set) Q as the set of words of a fixed length N with letters from Q. If Q is a finite field, then a Hamming space over Q is an N-dimensional vector space over Q. In the typical, binary case, the field is thus GF(2) (also denoted by Z2).

Attributes	Values
rdfs:label	Hamming space (en)
rdfs:comment	In statistics and coding theory, a Hamming space (named after American mathematician Richard Hamming) is usually the set of all binary strings of length N. It is used in the theory of coding signals and transmission. More generally, a Hamming space can be defined over any alphabet (set) Q as the set of words of a fixed length N with letters from Q. If Q is a finite field, then a Hamming space over Q is an N-dimensional vector space over Q. In the typical, binary case, the field is thus GF(2) (also denoted by Z2). (en)
foaf:depiction
dct:subject	Linear algebra Coding theory
Wikipage page ID	4566542 (xsd:integer)
Wikipage revision ID	1099728496 (xsd:integer)
Link from a Wikipage to another Wikipage	Module (mathematics) Block code Richard Hamming Vector space Error detection and correction GF(2) Gray isometry Modular arithmetic Alphabet (computer science) Lee distance Statistics Linear code Linear subspace Linear algebra Coding theory Finite field Cardinality Hamming code Hamming distance Code Coding theory Word (formal language theory) Variable-length code Metric (mathematics) Finite ring Subset Submodule Codeword Binary string dbr:Ring-linear_code
sameAs	Hamming space Hamming space Hamming space
dbp:wikiPageUsesTemplate	dbt:Algebra-stub dbt:Reflist
thumbnail	wiki-commons:Special:FilePath/Hamming_distance_3_bit_binary.svg?width=300
has abstract	In statistics and coding theory, a Hamming space (named after American mathematician Richard Hamming) is usually the set of all binary strings of length N. It is used in the theory of coding signals and transmission. More generally, a Hamming space can be defined over any alphabet (set) Q as the set of words of a fixed length N with letters from Q. If Q is a finite field, then a Hamming space over Q is an N-dimensional vector space over Q. In the typical, binary case, the field is thus GF(2) (also denoted by Z2). In coding theory, if Q has q elements, then any subset C (usually assumed of cardinality at least two) of the N-dimensional Hamming space over Q is called a q-ary code of length N; the elements of C are called codewords. In the case where C is a linear subspace of its Hamming space, it is called a linear code. A typical example of linear code is the Hamming code. Codes defined via a Hamming space necessarily have the same length for every codeword, so they are called block codes when it is necessary to distinguish them from variable-length codes that are defined by unique factorization on a monoid. The Hamming distance endows a Hamming space with a metric, which is essential in defining basic notions of coding theory such as error detecting and error correcting codes. Hamming spaces over non-field alphabets have also been considered, especially over finite rings (most notably over Z4) giving rise to modules instead of vector spaces and (identified with submodules) instead of linear codes. The typical metric used in this case the Lee distance. There exist a Gray isometry between (i.e. GF(22m)) with the Hamming distance and (also denoted as GR(4,m)) with the Lee distance. (en)
prov:wasDerivedFrom	wikipedia-en:Hamming_space?oldid=1099728496&ns=0
page length (characters) of wiki page	4262 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Hamming_space
is Link from a Wikipage to another Wikipage of	Elementary abelian group Gray code Linear code Finite field Isosceles set Code (coding theory) Hamming distance Nonlinear dimensionality reduction
is Wikipage redirect of	Code (coding theory)
is foaf:primaryTopic of	wikipedia-en:Hamming_space

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software