Hamming scheme

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2016
02419852016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Three-weight projective codes C are considered for which the restrietion to C of the Hamming association scheme Hn(q) is an… (More)
Is this relevant?
2014
2014
Single Event Upsets (SEUs) inadvertently change the configuration bits of Static-RAM (SRAM)-based Field Programmable Gate Arrays… (More)
  • figure 3
  • figure 2
  • figure 6
  • figure 7
  • figure 4
Is this relevant?
2011
2011
The de Bruijn–Tengbergen–Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain… (More)
Is this relevant?
2007
2007
Abstract. Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming distance d. Upper… (More)
Is this relevant?
2007
2007
Embedding of graphs is an important and interesting approach to parallel computing. Generally it can be used to model simulation… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 5
Is this relevant?
2005
2005
The main goal of this article is to present several connections between perfect codes in the Johnson scheme and designs, and… (More)
Is this relevant?
2004
2004
To each association scheme G and to each field R, there is associated naturally an associative algebra, the so-called adjacency… (More)
Is this relevant?
1996
1996
Although it was conjectured by Delsarte in 1973 that no nontrivial perfect codes exist in the Johnson scheme, only very partial… (More)
Is this relevant?
1995
1995
Let d denote a non-negative integer. A symmetric, d-class association scheme (or simply a scheme) is a configuration Y = (X, Ri0… (More)
Is this relevant?
1985
1985
We consider codes in the Hamming association scheme Hn (q) with interesting metric properties. We describe how a uniformly packed… (More)
Is this relevant?