Hamming scheme
id:
hamming-scheme-296-308158
title:
Hamming scheme
text:
The Hamming scheme, named after Richard Hamming, is also known as the hyper-cubic association scheme, and it is the most important example for coding theory. In this scheme X = F n , the set of binary vectors of length n , and two vectors x , y ∈ F n are i -th associates if they are Hamming distance i apart. Recall that an association scheme is visualized as a complete graph with labeled edges. The graph has v vertices, one for each point of X , and the edge joining vertices x and y is labeled i
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hamming_scheme
date created:
date modified:
2020-07-18T03:49:09Z
main entity:
{"identifier":"Q5645800","url":"https://www.wikidata.org/entity/Q5645800"}
image:
fields total:
13
integrity:
13