On Orthogonal Arrays of Strength 4 Achieving Rao's Bound

DOI10.1112/jlms/s2-19.3.385zbMath0452.05013OpenAlexW2087187733MaRDI QIDQ3898507

Ryuzaburo Noda

Publication date: 1979

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-19.3.385

zbMATH Keywords

orthogonal array

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (12)

\(Q\)-polynomial coherent configurations ⋮ On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\) ⋮ On orthogonal arrays of strength 3 and 5 achieving Rao's bound ⋮ On orthogonal arrays attaining Rao's bounds ⋮ On the existence of saturated and nearly saturated asymmetrical orthogonal arrays ⋮ Tight relative 2- and 4-designs on binary Hamming association schemes ⋮ On tight 4-designs in Hamming association schemes ⋮ On the existence of nested orthogonal arrays ⋮ New examples of Euclidean tight 4-designs ⋮ Tight 2-designs and perfect 1-codes in Doob graphs ⋮ A study of orthogonal arrays from the point of view of design theory ⋮ On existence of two symbol complete orthogonal arrays

This page was built for publication: On Orthogonal Arrays of Strength 4 Achieving Rao's Bound