Skip to main content
Log in

The asymptotic existence of frames with a pair of orthogonal frame resolutions

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

Motivated by the applications to generalized Howell designs and multiply constant-weight codes, we establish an asymptotic existence theorem for (k, λ)-frames of type gn with a pair of orthogonal frame resolutions via decompositions of edge-colored complete digraphs into prescribed edge-colored subgraphs.

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. Abel R J R, Bailey R F, Burgess A C, et al. On generalized Howell designs with block size three. Des Codes Cryptogr, 2016, 81: 365–391

    Article  MathSciNet  MATH  Google Scholar 

  2. Abel R J R, Chan N, Colbourn C J, et al. Doubly resolvable nearly Kirkman triple systems. J Combin Designs, 2013, 21: 342–358

    Article  MathSciNet  MATH  Google Scholar 

  3. Abel R J R, Lamken E R, Wang J. A few more Kirkman squares and doubly near resolvable BIBDs with block size 3. Discrete Math, 2008, 308: 1102–1123

    Article  MathSciNet  MATH  Google Scholar 

  4. Chan J H. Asymptotic existence results on specific graph decompositions. Master Thesis. University of Victoria, 2010

    Google Scholar 

  5. Chan J H, Dukes P J, Lamken E R, et al. The asymptotic existence of resolvable group divisible designs. J Combin Designs, 2013, 21: 112–126

    MathSciNet  MATH  Google Scholar 

  6. Chee Y M, Cherif Z, Danger J-L, et al. Multiply constant-weight codes and the reliability of loop physically unclonable functions. IEEE Trans Inform Theory, 2014, 60: 7026–7034

    Article  MathSciNet  MATH  Google Scholar 

  7. Chee Y M, Gao F, Kiah H M, et al. Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families. Proc IEEE Int Symp Inf Theory, 2014, 1436–1440

    Google Scholar 

  8. Cherif Z, Danger J-L, Guilley S, et al. Multiply constant weight codes. Proc IEEE Int Symp Inf Theory, 2013, 306–310

    Google Scholar 

  9. Colbourn C J, Lamken E R, Ling A C H, et al. The existence of Kirkman squares-doubly resolvable (v, 3, 1)-BIBDs. Des Codes Cryptogr, 2002, 26: 169–196

    Article  MathSciNet  MATH  Google Scholar 

  10. Furino S, Miao Y, Yin J. Frames and Resolvable Designs. Boca Raton: CRC Press, 1996

    MATH  Google Scholar 

  11. Ge G, Miao Y. PBDs, frames, and resolvability. In: Colbourn C J, Dinitz J H, eds. CRC Handbook of Combinatorial Designs. Boca Raton: CRC Press, 2007, 261–265

    Google Scholar 

  12. Jiang L, Wang K, Yin J X. Asymptotic existence of frame-GBTDs. Sci China Math, 2015, 58: 1795–1802

    Article  MathSciNet  MATH  Google Scholar 

  13. Lamken E R. 3-complementary frames and doubly near resolvable (v, 3, 2)-BIBDs. Discrete Math, 1991, 88: 59–78

    Article  MathSciNet  MATH  Google Scholar 

  14. Lamken E R. The existence of doubly near resolvable (v, 3, 2)-BIBDs. J Combin Designs, 1994, 2: 427–440

    Article  MathSciNet  MATH  Google Scholar 

  15. Lamken E R. The existence of doubly resolvable (v, 3, 2)-BIBDs. J Combin Theory Ser A, 1995, 72: 50–76

    Article  MathSciNet  MATH  Google Scholar 

  16. Lamken E R. Designs with mutually orthogonal resolutions and decompositions of edge-colored graphs. J Combin Designs, 2009, 17: 425–447

    Article  MathSciNet  MATH  Google Scholar 

  17. Lamken E R. The asymptotic existence of DR(v, k, k − 1)-BIBDs. Des Codes Cryptogr, 2015, 77: 553–562

    Article  MathSciNet  MATH  Google Scholar 

  18. Lamken E R, Vanstone S A. Existence results for doubly near resolvable (v, 3, 2)-BIBDs. Discrete Math, 1993, 120: 135–148

    Article  MathSciNet  MATH  Google Scholar 

  19. Lamken E R, Wilson R M. Decompositions of edge-colored complete graphs. J Combin Theory Ser A, 2000, 89: 149–200

    Article  MathSciNet  MATH  Google Scholar 

  20. Liu J Q. Asymptotic existence theorems for frames and group divisible designs. J Combin Theory Ser A, 2007, 114: 410–420

    Article  MathSciNet  MATH  Google Scholar 

  21. Schrijver A. Theory of Linear and Integer Programming. Chichester: Wiley, 1986

    MATH  Google Scholar 

  22. Wang X, Wei H, Shangguan C, et al. New bounds and constructions for multiply constant-weight codes. IEEE Trans Inform Theory, 2016, 62: 6315–6327

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant Nos. 11431003 and 11471032), and Fundamental Research Funds for the Central Universities (Grant Nos. 2016JB-M071 and 2016JBZ012). The authors express their sincere appreciations to the anonymous referees who made suggestions to improve the readability of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tao Feng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, C., Chang, Y. & Feng, T. The asymptotic existence of frames with a pair of orthogonal frame resolutions. Sci. China Math. 62, 1839–1850 (2019). https://doi.org/10.1007/s11425-017-9386-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-017-9386-2

Keywords

MSC(2010)

Navigation