Premium
Directed PBDs with Block Sizes from K Where { 4 } ⊆ K ⊆ { 4 , … , 9 }
Author(s) -
Wei Hengjia,
Ge Gennian
Publication year - 2017
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.21555
Subject(s) - mathematics , combinatorics , block (permutation group theory) , set (abstract data type) , discrete mathematics , arithmetic , computer science , programming language
The research on directed PBDs is motivated by the construction of t ‐deletion/insertion‐correcting codes. Fuji‐Hara, Miao, Wang, and Yin have determined the existence of directed PBDs with block sizes from the set K = { 4 , 5 } and the set K = { 4 , 6 } completely. In this paper, we consider the cases of { 4 } ⊆ K ⊆ { 4 , … , 9 } . We settle almost completely for these cases, leaving finite values undetermined.
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