Beyond the orthogonal array concept.
From MaRDI portal
The aim of this paper is to investigate a notion of regularity that is more flexible than the orthogonal array concept. A close connection is given between \(t\)-form spaces and \(T\)-designs in a Hamming space. The full \(t\)-distribution matrix, whose entries are special kinds of numbers, is also computed. The proof uses a certain matrix transform involving Krawtchouk polynomials. The paper concludes with a detailed example of the extended binary Golay code. The paper is an excellent piece of research work.
Recommendations
Cites work
- Association schemes and coding theory
- Association schemes and t-designs in regular semilattices
- Extending the t-Design Concept
- Four fundamental parameters of a code and their combinatorial significance
- Harmonics on posets
- scientific article; zbMATH DE number 15444 (Why is no real title available?)
- scientific article; zbMATH DE number 3510705 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Orthogonal Arrays of Strength two and three
Cited in
(4)
This page was built for publication: Beyond the orthogonal array concept.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427968)