Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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… Expand
  • figure 1
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… Expand
2014
2014
Single Event Upsets (SEUs) inadvertently change the configuration bits of Static-RAM (SRAM)-based Field Programmable Gate Arrays… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 5
2010
2010
We introduce a class of association schemes that generalizes the Hamming scheme. We derive generating functions for their… Expand
2006
2006
We compute the Terwilliger algebra of a Hamming scheme H(d, q). This algebra can be described as symmetric d-tensors on the… Expand
Review
1998
Review
1998
This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to… Expand
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… Expand
1988
1988
Abstract A 2-design is said to be quasi-symmetric if there are two block intersection sizes. We obtain inequalities satisfied by… Expand
Highly Cited
1982
Highly Cited
1982
Abstract An analogue of the Erdos-Ko-Rado Theorem is proved for the Hamming scheme H ( n , q ).