Hamming space
id:
hamming-space-295-13244814
title:
Hamming space
text:
In statistics and coding theory, a Hamming space is usually the set of all 2 N 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). In coding theory, if Q has q elements, then any sub
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hamming_space
date created:
date modified:
2023-10-24T01:35:37Z
main entity:
{"identifier":"Q5645799","url":"https://www.wikidata.org/entity/Q5645799"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b4/Hamming_distance_3_bit_binary.svg","width":190,"height":150}
fields total:
13
integrity:
14