Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Subspace codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that… 
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… 
2010
2010
We introduce a class of association schemes that generalizes the Hamming scheme. We derive generating functions for their… 
2009
2009
  • E. Bannai
  • European journal of combinatorics (Print)
  • 2009
  • Corpus ID: 207208396
Highly Cited
2006
Review
1998
Review
1998
This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to… 
1993
1993
We show fort>3 the nonexistence of binary [2t−2, 2t−2t−1, 5] codes. 
1992
1992
R, S, and T arefinitesets, andweput i?={1, 2 r), S={1,2,... , s}, and T-{\, 2,... , t}. Elements of R, S, and T are called row… 
1988
1988
Highly Cited
1981
Highly Cited
1981
  • Y. Egawa
  • Journal of combinatorial theory. Series A
  • 1981
  • Corpus ID: 22176477