Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

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

Is this relevant?

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

Is this relevant?

2010

2010

We introduce a class of association schemes that generalizes the Hamming scheme. We derive generating functions for their… Expand

Is this relevant?

2010

2010

The de Bruijn–Tengbergen–Kruyswijk (BTK) construction is a simple algorithm that produces an explicit symmetric chain… Expand

Is this relevant?

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

Is this relevant?

1993

1993

We show fort>3 the nonexistence of binary [2t−2, 2t−2t−1, 5] codes.

Is this relevant?

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

Is this relevant?

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

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

Is this relevant?

1982

1982

Abstract An analogue of the Erdos-Ko-Rado Theorem is proved for the Hamming scheme H ( n , q ).

Is this relevant?