Optimal grid holey packings with block size 3 and 4 |
| |
| Authors: | Bin Wen Jianmin Wang Jianxing Yin |
| |
| Affiliation: | (1) Department of Mathematics, Suzhou University, Suzhou, 215006, People’s Republic of China;(2) Department of Mathematics, Changshu Institute of Technology, Suzhou, 215500, People’s Republic of China |
| |
| Abstract: | The notion of a grid holey packing (GHP) was first proposed for the construction of constant composite codes. For a GHP (k, 1; n × g) of type [w 1, . . . , w g ], where  , the fundamental problem is to determine the packing number N([w 1, . . . , w g ], 1; n × g), that is, the maximum number of blocks in such a GHP. In this paper we determine completely the values of N([w 1, . . . , w g ], 1; n × g) in the case of block size  . |
| |
| Keywords: | Grid holey packing Optimal Segmental grid holey packing |
| 本文献已被 SpringerLink 等数据库收录！ |
|
