Skip to main content
Log in

Optimal grid holey packings with block size 3 and 4

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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 \({k = \sum_{j=1}^{g} w_j}\) , 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 \({k\in \{3, 4\}}\) .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge Univ. Press, Cambridge, UK (1999)

    Google Scholar 

  2. Brouwer A.E.: Optimal packings of K 4’s into a K n . J. Combin. Theory A 26, 278–297 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brouwer A.E., Schrijver A., Hanani H.: Group divisible designs with block size four. Discrete Math. 20, 1–10 (1977)

    Article  MathSciNet  Google Scholar 

  4. Colbourn C.J., Dinitz J.H.: The CRC Handbook of Combinatorial Designs.. CRC Press, Boca Raton, FL (2007)

    Google Scholar 

  5. Dinitz J.H., Shalaby N.: Block disjoint difference families for Steiner triple systems: \({v \equiv 3}\) (mod 6). J. Statist. Plan. Infer. 106, 77–86 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Furino S., Miao Y., Yin J.: Frames and Resolvable Designs. CRC Press, Boca Raton, FL (1996)

    MATH  Google Scholar 

  7. Ge G., Wei R.: HGDDs with block size four. Discrete Math. 279, 267–276 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hanani H.: Balanced incomplete block designs and related designs. Discrete Math. 11, 255–369 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  9. Miao Y., Zhu L.: Existence of incomplete group divisible designs. JCMCC 6, 33–49 (1989)

    MATH  MathSciNet  Google Scholar 

  10. Svanström M.: Construction of ternary constant-composition codes with weight three. IEEE Trans. Inform. Theory 46, 2644–2647 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Wei R.: Group divisible designs with equal-sized holes. Ars Combin. 35, 315–323 (1993)

    MATH  MathSciNet  Google Scholar 

  12. Wilson R.M.: Constructions and uses of pairwise balanced designs. Math. Centre Tracts 55, 18–41 (1974)

    Google Scholar 

  13. Yin J.: Packing designs with equal-sized holes. J. Statist. Plan. Infer. 94, 393–403 (2001)

    Article  MATH  Google Scholar 

  14. Yin J., Tang Y.: A new combinatorial approach to the construction of CCCs. Sci. China A 51-3, 321–480 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianmin Wang.

Additional information

Communicated by P. Wild.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wen, B., Wang, J. & Yin, J. Optimal grid holey packings with block size 3 and 4. Des. Codes Cryptogr. 52, 107–124 (2009). https://doi.org/10.1007/s10623-009-9270-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-009-9270-6

Keywords

Mathematics Subject Classification (2000)

Navigation