Premium
Optimal holey packings OHP 4 (2, 4, n ,3)'s
Author(s) -
Wang Jianmin,
Yan J.
Publication year - 2006
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20084
Subject(s) - mathematics , combinatorics , code (set theory) , constant (computer programming) , computer science , set (abstract data type) , programming language
An optimal holey packing OHP d (2, k, n, g ) is equivalent to a maximal ( g + 1)‐ary ( n , k , d ) constant weight code. In this paper, we provide some recursive constructions for OHP d (2, k , n , g )'s and use them to investigate the existence of an OHP 4 (2, 4, n , 3) for n ≡ 2, 3 (mod 4). Combining this with Wu's result (18), we prove that the necessary condition for the existence of an OHP 4 (2, 4, n , 3), namely, n ≥ 5 is also sufficient, except for n ∈ {6, 7} and except possibly for n = 26. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 111–123, 2006
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom