On existence of two symbol complete orthogonal arrays

DOI10.1016/0097-3165(94)90059-0zbMath0801.05015OpenAlexW1969214470MaRDI QIDQ1323840

Rahul Mukerjee, Sanpei Kageyama

Publication date: 27 November 1994

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90059-0

zbMATH Keywords

orthogonal array

Mathematics Subject Classification ID

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

Related Items (3)

On the existence of saturated and nearly saturated asymmetrical orthogonal arrays ⋮ On tight 4-designs in Hamming association schemes ⋮ On the existence of nested orthogonal arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 Orthogonal Arrays of Strength 4 Achieving Rao's Bound
• ON TIGHT DESIGNS

This page was built for publication: On existence of two symbol complete orthogonal arrays