On orthogonal arrays of strength 3 and 5 achieving Rao's bound

DOI10.1007/BF01788102zbMath0601.05010MaRDI QIDQ1080855

Ryuzaburo Noda

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

orthogonal array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (4)

Harmonic index designs in binary Hamming schemes ⋮ On the existence of nested orthogonal arrays ⋮ New examples of Euclidean tight 4-designs ⋮ On existence of two symbol complete orthogonal arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending symmetric designs
• On Orthogonal Arrays of Strength 4 Achieving Rao's Bound
• On the uniqueness of the Golay codes
• Orthogonal Arrays of Index Unity

This page was built for publication: On orthogonal arrays of strength 3 and 5 achieving Rao's bound