Skip to main content
SpringerLink
Log in

Super-simple (ν, 5, 5) Designs

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

Abstract

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. In this article, we investigate the existence of a super-simple (ν, 5, 5) balanced incomplete block design and show that such a design exists if and only if ν ≡ 1 (mod 4) and ν ≥ 17 except possibly when ν = 21. Applications of the results to optical orthogonal codes are also mentioned.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. J. R. Abel A. E. Brouwer C. J. Colbourn J. H. Dinitz (1996) Mutually orthogonal Latin squares C. J. Colbourn J. H. Dinitz (Eds) C.R.C. Handbook of Combinatorial Designs CRC Press Boca Raton, FL 111–142

    Google Scholar 

  2. P. Adams D. Bryant A. Khodkar (1996) ArticleTitleOn the existence of super-simple designs with block size 4 Aequationes Math. 52 230–246 Occurrence Handle10.1007/BF01818349 Occurrence Handle97d:05027

    Article  MathSciNet  Google Scholar 

  3. I. Bluskov (1997) ArticleTitleNew Designs J. Combin. Math. Combin. Comput. 23 212–220 Occurrence Handle0897.05010 Occurrence Handle97h:05019

    MATH  MathSciNet  Google Scholar 

  4. I. Bluskov H. Hämäläinen (1998) ArticleTitleNew upper bounds on the minimum size of covering designs J. Combin. Designs 6 21–41 Occurrence Handle10.1002/(SICI)1520-6610(1998)6:1<21::AID-JCD2>3.0.CO;2-Y

    Article  Google Scholar 

  5. I. Bluskov K. Heinrich (2001) ArticleTitleSuper-simple designs with ν ≤ 32 J. Statist. Plann. Inference 95 121–131 Occurrence Handle2002b:05014

    MathSciNet  Google Scholar 

  6. K. Chen (1995) ArticleTitleOn the existence of super-simple (ν,4,3)-BIBDs J. Combin. Math. Combin. Comput. 17 149–159 Occurrence Handle0827.05009 Occurrence Handle95m:05026

    MATH  MathSciNet  Google Scholar 

  7. K. Chen (1996) ArticleTitleOn the existence of super-simple (ν,4,4)-BIBDs J. Statist. Plann. Inference 51 339–350 Occurrence Handle0849.05007 Occurrence Handle97c:05021

    MATH  MathSciNet  Google Scholar 

  8. K. Chen Z. Cao R. Wei (2005) ArticleTitleSuper-simple balanced incomplete block designs with block size 4 and index 6 J. Statist. Plann. Inference 133 537–554 Occurrence Handle10.1016/j.jspi.2004.01.013 Occurrence Handle2194492

    Article  MathSciNet  Google Scholar 

  9. K. Chen and R. Wei, Super-simple (ν,5,4) designs, submitted.

  10. W. Chu C.J. Colbourn (2004) ArticleTitleRecusive constructions for optimal (ν,4,2)-OOCs J. Combin. Designs 12 1–13 Occurrence Handle10.1002/jcd.20003 Occurrence Handle2006c:05044

    Article  MathSciNet  Google Scholar 

  11. R. Fuji-Hara Y. Miao (2000) ArticleTitleOptimal orthogonal codes: their bounds and new optimal constructions IEEE Trans. Inform. Theory 46 2396–2406 Occurrence Handle2001k:94080

    MathSciNet  Google Scholar 

  12. H.-D. O. F. Gronau D. L. Kreher A. C. H. Ling (2004) ArticleTitleSuper-simple (ν,5,2)-designs Discrete Applied Mathematics 138 65–77 Occurrence Handle2005a:05030

    MathSciNet  Google Scholar 

  13. H.-D. O. F. Gronau R. C. Mullin (1992) ArticleTitleOn super-simple 2−(ν,4,λ) designs J. Combin. Math. Combin. Comput. 11 113–121 Occurrence Handle92m:05019

    MathSciNet  Google Scholar 

  14. S. Hartmann (1999) ArticleTitleAsymptotic results on suborthogonal \(\bar{G}\)-decompositions of complete digraphs Discrete Appl. Math. 95 311–320 Occurrence Handle10.1016/S0166-218X(99)00083-9 Occurrence Handle0933.05123 Occurrence Handle2001b:05179

    Article  MATH  MathSciNet  Google Scholar 

  15. S. Hartmann (2000) ArticleTitleSuperpure digraph designs J. Combin. designs 10 239–255

    Google Scholar 

  16. S. Hartmann U. Schumacher (2000) ArticleTitleSuborthogonal double covers of complete graphs Congr. Number. 147 33–40 Occurrence Handle2001m:05207

    MathSciNet  Google Scholar 

  17. A. Khodkar (1994) ArticleTitleVarious super-simple designs with block size four Australas. J. Combin. 9 201–210 Occurrence Handle0807.05006 Occurrence Handle95m:05028

    MATH  MathSciNet  Google Scholar 

  18. H. K. Kim V. Lebedev (2004) ArticleTitleOn optimal superimposed codes J. Combin. Designs 12 79–91 Occurrence Handle10.1002/jcd.10056 Occurrence Handle2005c:94079

    Article  MathSciNet  Google Scholar 

  19. D. R. Stinson R. Wei L. Zhu (2000) ArticleTitleNew Constructions for perfect hash families and related structures using related combinatorial designs and codes J. Combin. Designs 8 189–200 Occurrence Handle10.1002/(SICI)1520-6610(2000)8:3<189::AID-JCD4>3.0.CO;2-A Occurrence Handle2001i:68037

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lakehead University Thunder Bay, ON, P7B 5E1, Canada

    Kejun Chen & Ruizhong Wei

Authors
  1. Kejun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruizhong Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kejun Chen.

Additional information

Communicated by: C. Colbourn

Research supported by NSERC grant 239135-01.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, K., Wei, R. Super-simple (ν, 5, 5) Designs. Des Codes Crypt 39, 173–187 (2006). https://doi.org/10.1007/s10623-005-3256-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-3256-9

Keywords

AMS Classification

Search

Navigation