Nonexistence of a few binary orthogonal arrays

详细信息    查看全文

• 作者：Peter Boyvalenkov^a ; ^b ; ^{peter@math.bas.bg} ; Tanya Marinova^c ; ^{tanya.marinova@fmi.uni-sofia.bg} ; Maya Stoyanova^c ; ^{stoyanova@fmi.uni-sofia.bg}
• 关键词：Binary Hamming space ; Orthogonal arrays ; Krawtchouk polynomials ; Distance distributions ; Nonexistence
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：30 January 2017
• 年：2017
• 卷：217
• 期：part_P2
• 页码：144-150
• 全文大小：433 K
• 卷排序：217

文摘

We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations between the distance distributions of connected arrays. This turns out to be strong enough and we prove the nonexistence of binary orthogonal arrays of parameters (length, cardinality, strength)=(9,96,4), (10,192,5)(10,192,5), (10,112,4)(10,112,4), (11,224,5)(11,224,5), (11,112,4)(11,112,4) and (12,224,5)(12,224,5), resolving the first cases where the existence was undecided so far. For the existing arrays our approach allows substantial reduction of the number of feasible distance distributions which could be helpful for classification results (uniqueness, for example).