Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
New Construction of Symmetric Orthogonal Arrays of Strength t Jiao DU Qiaoyan WEN Jie ZHANG Xin LIAO Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E96-A No.9 pp.1901-1904 Publication Date: 2013/09/01 Online ISSN: 1745-1337 DOI: 10.1587/transfun.E96.A.1901 Print ISSN: 0916-8508 Type of Manuscript: LETTER Category: Coding Theory Keyword: orthogonal arrays, orthogonal partition, latin square, count, Full Text: PDF(93.4KB)>>
Summary: Orthogonal arrays have important applications in statistics and computer science, as well as in coding theory. In this letter, a new construction method of symmetric orthogonal arrays of strength t is proposed, which is a concatenation of two orthogonal partitions according to a latin square. As far as we know, this is a new construction of symmetric orthogonal arrays of strength t, where t is a given integer. Based on the different latin squares, we also study the enumeration problem of orthogonal partitions, and a lower bound on the count of orthogonal partitions is derived. | ||||||||||
| ||||||||||
