Bose, R.C., Parker, E.T. and Shrikhande, S., Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture. Can. J. Math. v12. 189-203.

Google Scholar

[4]

Bose, R.C. and Shrikhande, S., On the construction of sets of mutually orthogonal Latin squares and the falsity of a conjecture of Euler. Trans. Am. Math. Soc. v95. 191-200.

Crossref

Google Scholar

[5]

Bruck, R.H. and Ryset, H.J., The nonexistence of certain finite projective planes. Can. J. Math. v1. 88-93.

Google Scholar

[6]

Chowla, S., Erdös, P. and Straus, E.G., On the maximal number of pairwise orthogonal Latin squares of a given order. Can. J. Math. v12. 204-208.

Google Scholar

[7]

Chowla, S. and Ryser, H.J., Combinatorial problems. Can. J. Math. v2. 93-99.

Google Scholar

[8]

Collens, R.J., An introduction to a computer system for balanced incomplete block design research. 1973. The University of Manitoba, Winnipeg, Manitoba, Canada.

Google Scholar

[9]

Connor Jr., W.S., On the structure of balanced incomplete block designs. Ann. Math. Statist. v23. 57-71.

Crossref

Google Scholar

[10]

Dickson, L.E., . 1952. History of the Theory of Numbers, 1952.Chelsea, New York.

Google Scholar

[11]

Dulmage, A.L., Johnson, D.M. and Mendelson, N.S., Orthomorphisms of groups and orthogonal Latin squares. Can. J. Math. v13. 356-372.

Google Scholar

[12]

Fisher, R.A. and Yates, F., Statistical Tables for Biological, Agricultural and Medical Research. 1963. 6th.ed. Oliver and Boyd, London.

Google Scholar

[13]

Fort Jr., M.K. and Hedlund, G.A., Minimzl coverings of pairs by triples. Pacific J. Math. v8. 709-719.

Google Scholar

[14]

Hall Jr., M., Combinatorial Theory. 1967. Blaisdell, Waltham, Mass.

Google Scholar

[15]

Hall Jr., M. and Connor, W.S., An embedding theorem for balanced incomplete block designs. Can. J. Math. v6. 35-41.

Google Scholar

[16]

Hanani, H., The existence and construction of balanced incomplete block designs. Ann. Math. Statist. v32. 361-385.

Crossref

Google Scholar

[17]

Hanani, H., On the number of orthogonal Latin squares. J. Combin. Theory. v8. 247-271.

Google Scholar

[18]

Hanani, H., On balanced incomplete block designs with blocks having five elements. J. Combin. Theory. v12. 184-201.

Google Scholar

[19]

Hanani, H., On transversal designs. In: Combinatories. Proc. of the Advanced Study Institute, 55. Math. Centre, Amsterdam. pp. 42-52.

Google Scholar

[20]

MacNeish, H.F., Euler squares. Ann. Math. v23. 221-227.

Crossref

Google Scholar

[21]

W.H. Mills, Two new block designs, Utilitas Math., to appear.

Google Scholar

[22]

Mullin, R.C. and Stanton, R.G., Classification and embedding of balanced incomplete block designs. Sankhyã. v30. 91-100.

Google Scholar

[23]

Parker, E., Construction of some sets of mutually orthogonal Latin squares. Proc. Am. Math. Soc. v10. 946-949.

Crossref

Google Scholar

[24]

Rao, C.R., A study of BIB designs with replications r = 11 to 15. Sankhyã. v23. 117-127.

Google Scholar

[25]

Über eine Steinersche combinatorische Aufgabe. Z. Reine Angew. Math. v56. 326-344.

Google Scholar

[26]

Rogers, K., A note on orthogonal Latin squares. Pacific J. Math. v14. 1395-1397.

Google Scholar

[27]

Schönheim, J., On coverings. Pacific J. Math. v14. 1405-1411.

Google Scholar

[28]

Schönheim, J., On maximal systems of k-tuples. Studia Sci. Math. Hungar. v1. 363-368.

Google Scholar

[29]

Sprott, D.A., Listing of BIB designs from r = 16 to 20. Sankhyã. v24. 203-204.

Google Scholar

[30]

Steiner, J., Combinatorische Aufgabe. Z. Reine Angew. Math. v45. 181-182.

Google Scholar

[31]

Takeuchi, K., A table of difference sets generating balanced incomplete block designs. Rev. Internl. Statist. Inst. v30. 361-366.

Crossref

Google Scholar

[32]

Tarry, G. and Tarry, G., Le problème des 36 officiers. Compt. Rend. Assoc. Fr. Av. Sci. v1. 122-123.

Google Scholar

[33]

Wilson, R.M., Cyclomotomy and difference families in elementary Abelian groups. J. Number Theory. v4. 17-47.

Google Scholar

[34]

R.M. Wilson, Concerning the number of mutually orthogonal Latin squares, in print.

Google Scholar

[35]

R.M. Wilson, oral communication.

Google Scholar

Cited By

View all

Liu SJi L(2024)Combinatorial constructions of optimal low-power error-correcting cooling codesDesigns, Codes and Cryptography10.1007/s10623-024-01391-092:8(2235-2252)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10623-024-01391-0
Fang ZZhou JWang L(2022)Maximum w-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codesDiscrete Mathematics10.1016/j.disc.2021.112754345:4Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1016/j.disc.2021.112754
Liang MJi L(2022)On (t, L)-fold perfect authentication and secrecy codes with arbitrationDesigns, Codes and Cryptography10.1007/s10623-018-00602-987:9(2003-2026)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/s10623-018-00602-9
Show More Cited By

Recommendations

Virtually balanced incomplete block designs
A web solution for Partially Balanced Incomplete Block experimental designs

WS-PBIBD generates randomized layout of PBIB designs used for agriculture research.The analysis of data obtained from general block design can also be performed.e-Learning material on block designs is provided for easy reference of researchers.A .NET ...
Balanced Incomplete Block Designs with Block Size 7

The object of this paper is the construction of balanced incomplete block designs with k=7. This paper continues the work begun by Hanani, who solved the construction problem for designs with a block size of 7, and with λ=6, 7, 21 and 42. The construction ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Discrete Mathematics Volume 11, Issue 3

January, 1975

211 pages

ISSN:0012-365X

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 January 1975

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

83
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu SJi L(2024)Combinatorial constructions of optimal low-power error-correcting cooling codesDesigns, Codes and Cryptography10.1007/s10623-024-01391-092:8(2235-2252)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1007/s10623-024-01391-0
Fang ZZhou JWang L(2022)Maximum w-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codesDiscrete Mathematics10.1016/j.disc.2021.112754345:4Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1016/j.disc.2021.112754
Liang MJi L(2022)On (t, L)-fold perfect authentication and secrecy codes with arbitrationDesigns, Codes and Cryptography10.1007/s10623-018-00602-987:9(2003-2026)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/s10623-018-00602-9
Chen GChen KZhang YJiang N(2021)Super-simple group divisible designs with block size 4 and index λ = 7,8Discrete Mathematics10.1016/j.disc.2021.112592344:12Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1016/j.disc.2021.112592
Forbes A(2020)Group Divisible Designs with Block Size Four and Type Graphs and Combinatorics10.1007/s00373-020-02213-536:6(1687-1703)Online publication date: 1-Nov-2020
https://dl.acm.org/doi/10.1007/s00373-020-02213-5
Asif MZhou WYu QLi XKhan N(2019)A Deterministic Construction for Jointly Designed Quasicyclic LDPC Coded-Relay CooperationWireless Communications & Mobile Computing10.1155/2019/52493732019Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1155/2019/5249373
Baicheva TTopalova S(2019)Classification of optimal (v, k, 1) binary cyclically permutable constant weight codes with $$k=5,$$k=5, 6 and 7 and small lengthsDesigns, Codes and Cryptography10.1007/s10623-018-0534-x87:2-3(365-374)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1007/s10623-018-0534-x
Niu XCao H(2018)Constructions and bounds for separating hash familiesDiscrete Mathematics10.1016/j.disc.2018.06.018341:9(2627-2638)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1016/j.disc.2018.06.018
Ji L(2018)Group divisible designs with large block sizesDesigns, Codes and Cryptography10.1007/s10623-017-0448-z86:10(2255-2260)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10623-017-0448-z
Forbes AGriggs TForbes T(2017)Archimedean graph designsIIDiscrete Mathematics10.1016/j.disc.2017.02.016340:7(1598-1611)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.disc.2017.02.016
Show More Cited By

Abstract

References

Cited By

Recommendations

Virtually balanced incomplete block designs

A web solution for Partially Balanced Incomplete Block experimental designs

Balanced Incomplete Block Designs with Block Size 7

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations