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)

Related topics

Related topics

2 relations
Coding theoryHamming distance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Ahlswede-Khachatrian Theorems: Weighted, Infinite, and Hamming
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a $k$-uniform $t… 
Review
2016
Review
2016
Implementation of single bit Error detection and Correction using Embedded hamming scheme
Multiple bit upsets due to radiation-induced soft errors are a major concern in Nano scale technology nodes. Once such errors… 
2015
2015
Graph Cores via Universal Completability
2011
2011
Duality of translation association schemes coming from certain actions
Translation association schemes are constructed from actions of finite groups on finite abelian groups satisfying certain natural… 
2010
2010
Hamming Graph in Nomura Algebra
Let A be an association scheme on q ≥ 3 vertices. We show that the Bose-Mesner algebra of the generalized Hamming scheme H(n,A… 
2007
2007
Embedding the ith Johnson networks into the hamming network
Embedding of graphs is an important and interesting approach to parallel computing. Generally it can be used to model simulation… 
2004
2004
Modular Adjacency Algebras of Hamming Schemes
To each association scheme G and to each field R, there is associated naturally an associative algebra, the so-called adjacency… 
Review
2000
Review
2000
Association Schemes and Coding Theory
This paper contains a survey of association scheme theory (with its algebraic and analytical aspects) and of its applications to… 
1992
1992
On the Minimal Covering of 3-dimensional Hamming Scheme
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… 
1991
1991
On the Classification of Locally Hamming Distance-Regular Graphs
. A distance-regular graph is locally Hamming if it is locally isomorphic to a Hamming scheme $H(r, 2)$ . This paper rediscovers… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)