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)

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

- Shyamsundar Venkataraman, Rui Santos, Anup Das, Akash Kumar
- 2014 24th International Conference on Fieldâ€¦
- 2014

Single Event Upsets (SEUs) inadvertently change the configuration bits of Static-RAM (SRAM)-based Field Programmable Gate Arraysâ€¦Â (More)

Is this relevant?

2011

2011

Symmetric chains, Gelfandâ€“Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme

The de Bruijnâ€“Tengbergenâ€“Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chainâ€¦Â (More)

Is this relevant?

2007

2007

- Beniamin Mounits, Tuvi Etzion, Simon Litsyn
- Adv. in Math. of Comm.
- 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)

Is this relevant?

2005

2005

- Tuvi Etzion
- 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

- Tuvi Etzion
- SIAM J. Discrete Math.
- 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

- Chih-Wen Weng
- Graphs and Combinatorics
- 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

- A. Robert Calderbank, Jean-Marie Goethals
- Eur. J. Comb.
- 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?