Skip to main content
Log in

Existence of Generalized Steiner Systems GS(2,4,ν,2)

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

Abstract

Generalized Steiner systems GS(2,4,v,2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance five, in which each codeword has length v and weight four. Etzion conjectured its existence for any integer v≥ 7 and v≡ 1(mod 3). The conjecture has been verified for prime powers v > 7 and v≡ 7(mod 12) by the latter two of the present authors. It has also been pointed out that there does not exist a GS(2,4,7,2). In this paper, constructions using frame generalized Steiner systems, two holey perfect bases and orthogonal Latin squares are discussed. With these constructions the conjecture is confirmed with the exception for v=7 and three possible exceptions for v ∈13, 52, 58.

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. S. Blake-Wilson K. T. Phelps (1999) ArticleTitleConstant weight codes and group divisible design Designs Codes and Cryptography 16 11–27

    Google Scholar 

  2. Cao H., Ji L. and Zhu L. Constructions for generalized Steiner systems GS(3,4,ν ,2),preprint.

  3. K. Chen G. Ge L. Zhu (1999) ArticleTitleGeneralized Steiner triple systems with group size five Journal of Combinatorial Designs 7 441–452

    Google Scholar 

  4. K. Chen G. Ge L. Zhu (2000) ArticleTitleStarters and related codes Journal of Statistical Planning and Inference 86 379–395

    Google Scholar 

  5. C.J. Colbourn J.H. Dinitz (Eds) (1996) The CRC Handbook of Combinatorial Designs CRC Press Boca Raton

    Google Scholar 

  6. T. Etzion (1997) ArticleTitleOptimal constant weight codes over Z k and generalized designs Discrete Mathematics 169 55–82

    Google Scholar 

  7. G. Ge D. Wu (2003) ArticleTitle4−*GDD(3n)s and generalized Steiner systems GS(2,4,ν ,3) Journal of Combinatorial Designs 11 381–393

    Google Scholar 

  8. K. T. Phelps C. Yin (1999) ArticleTitleGeneralized Steiner systems with block three and group size four Ars Combinatoria 53 133–146

    Google Scholar 

  9. K.T. Phelps C. Yin (1997) ArticleTitleGeneralized Steiner systems with block three and group size g≡ 3 (mod 6) Journal of Combinatorial Designs 5 417–432

    Google Scholar 

  10. R. M. Wilson (1974) ArticleTitleConstructions and uses of pairwise balanced designs Mathematics Centre Tracts 55 18–41

    Google Scholar 

  11. D. Wu (2001) ArticleTitleGeneralized Steiner Systems GS(2,4,v ,2) for v=6·2s+1 Journal of Guangxi Normal University 19 33–36

    Google Scholar 

  12. D. Wu L. Zhu (2001) ArticleTitleGeneralized Steiner systems GS(2,4,v ,2) with ν a prime power ≡ 7 (mod 12) Designs Codes and Cryptography 24 285–296 Occurrence Handle10.1023/A:1011229414528

    Article  Google Scholar 

  13. D. Wu G. Ge L. Zhu (2000) ArticleTitleGeneralized Steiner triple systems with group size g=7,8 Ars Combinatoria 57 175–192

    Google Scholar 

  14. J. Yin Y. Lu J. Wang (1999) ArticleTitleMaximum distance holey packings and related designs Science in China (Series A) 42 1262–1269

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. Wu.

Additional information

AMS classification: 05B05, 94B25

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ji, L., Wu, D. & Zhu, L. Existence of Generalized Steiner Systems GS(2,4,ν,2). Des Codes Crypt 36, 83–99 (2005). https://doi.org/10.1007/s10623-004-1164-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-004-1164-z

Keywords

Navigation