Orthogonal hypercubes and related designs

Journal of Statistical Planning and Inference

Volumn 73, Issue 1-2, 1998, Pages 177-188

  Mullen, Gary L ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040083404     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-3758(98)00059-7     Document Type: Article

References (43)

1. Bose R.C. On the application of the properties of Galois fields to the problem of construction of hyper-Graeco-Latin squares. Sankhy. ā , 3:1938;323-338.
2. Brant L.J., Mullen G.L. A study of frequency cubes. Discrete Math. 69:1988;115-121.
3. Cheng C.-S. Optimal designs for the elimination of multi-way heterogeneity. Ann. Statist. 6:1978;1262-1272.
4. Cheng C.-S. Orthogonal arrays with variable numbers of symbols. Ann. Statist. 8:1980;447-453.
5. Dénes, J., Keedwell, A.D., 1974. Latin Squares and Their Applications, Academic Press, New York.
6. Dénes, J., Keedwell, A.D., 1991. Latin Squares, Annals of Discrete Math., vol. 46, North-Holland, Amsterdam.
7. Federer W.T., Mandeli J.P. Orthogonal. F -rectangles, orthogonal arrays, and codes J. Combin. Theory, Ser. A. 43:1986;149-164.
8. Finizio, N.J., Lewis, J.T., 1994. Enumeration of maximal codes. 25th Southeastern Conf. Comb., Graph Theory, and Computing. Boca Raton, FL.
9. Hedayat A.S., Raghavarao D., Seiden E. Further contributions to the theory of. F -squares design Ann. Statist. 3:1975;712-716.
10. Hedayat A.S., Seiden E. F -square and orthogonal F -squares design: a generalization of latin square and orthogonal latin square design Ann. Math. Statist. 41:1970;2035-2044.
11. Höhler, P., 1970. Eine Verallgemeinerung von orthogonalen lateinischen Quadraten auf höhere Dimensionen Dissertation Dokt. Math. Eidgenöss, Hochschule Zürich.
12. Huang T., Laurent M. (s,r;μ) -nets and alternating forms graphs Discrete Math. 114:1993;237-252.
13. Kishen K. On the construction of latin and hyper-Graeco-Latin cubes and hypercubes. J. Indian Soc. Agricultural Statist. 2:1950;20-48.
14. Lawrence, M.K., 1995. Combinatorial bounds and constructions in the theory of uniform point distributions in unit cubes, connections with orthogonal arrays and a poset generalization of a related problem in coding theory. Ph.D. Thesis, University of Wisconsin.
15. Laywine C.F. Subsquares in orthogonal latin squares as subspaces in affine geometries: a generalization of an equivalence of Bose. Des. Codes Cryptogr. 3:1992;21-28.
16. Laywine C.F. Complete sets of orthogonal frequency squares and affine resolvable designs. Utilitas Math. 43:1993;161-170.
17. Laywine C. On the dimension of affine resolvable designs and hypercubes. J. Combin. Des. 4:1996;235-246.
18. Laywine C., Mullen G.L. Latin cubes and hypercubes of prime order. Fibonacci Quart. 23:1985;139-145.
19. Laywine C.F., Mullen G.L. Generalizations of Bose's equivalence between complete sets of mutually orthogonal latin squares and affine planes. J. Combin. Theory, Ser. A. 61:1992;13-35.
20. Laywine, C.F., Mullen, G.L., 1993. Mutually orthogonal frequency hypercubes and affine geometries, In: Jungnickel, D., Vanstone, S.A. (Eds.), Coding Theory, Design Theory, Group Theory. Wiley, New York, pp. 183-193.
21. Laywine, C.F., Mullen, G.L., The failure of the Euler conjecture for order 6 and dimensions d>2 . Preprint.
22. Laywine C.F., Mullen G.L., Whittle G. D -dimensional hypercubes and the Euler and MacNeish conjectures Monatsh. Math. 119:1995;223-238.
23. Mandeli J.P., Federer W.T. On the construction of mutually orthogonal. F -hyperrectangles Utilitas Math. 25:1984;315-324.
24. Mavron V.C. On the structure of affine designs. Math. Z. 125:1972;298-316.
25. Morgan, I.H., 1994. Equiorthogonal frequency hypercubes. Ph.D. Thesis. The Pennsylvania State University.
26. Morgan, I.H., 1998. Equiorthogonal frequency hypercubes:preliminary theory, Des. Codes Cryptogr. 13, 177-185.
27. Morgan, I.H., preprint. Construction of complete sets of mutually equiorthogonal frequency hypercubes. Discrete Math., to appear.
28. Mullen G.L. Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. Disc. Math. 69:1988;79-84.
29. Mullen G.L. Combinatorial methods in the construction of point sets with uniformity properties. Math. and Comput. Modelling. 23:1996;1-8.
30. Mullen G.L. A candidate for the 'next Fermat problem'. Math. Intelligencer. 17:1995;18-22.
31. Mullen, G.L., Mahalanabis, A., Niederreiter, H., 1995. Tables of (t,m,s) -net and sequence parameters. In: Niederreiter, H., Shiue, P.J.-S. (Eds.), Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Lecture Notes in Statist. vol. 106. Springer, New York, pp. 58-86.
32. Mullen G.L., Schmid W.Ch. An equivalence between. (t,m,s) -nets and strongly orthogonal hypercubes J. Combin. Theory, Ser. A. 76:1996;164-174.
33. Mullen G.L., Suchower S.J. Frequency hypercubes, error-correcting codes and fractional replication plans. J. Combin. Inform and Systems Sci. 18:1993;5-18.
34. Mullen, G.L., Weber, R.E., 1980. Latin cubes of order ≤5 . Discrete Math. 32, 291-297.
35. Mullen G.L., Whittle G. Point sets with uniformity properties and orthogonal hypercubes. Monatsh. Math. 113:1992;265-273.
36. Niederreiter H. Point sets and sequences with small discrepancy. Monatsh. Math. 104:1987;273-337.
37. Niederreiter H. Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes. Discrete Math. 106/107:1992;361-367.
38. Owen, A.B., 1995. Randomly permuted (t,m,s) -nets and (t,s) sequences. In: Niederreiter, H., Shiue, P.J.-S. (Eds.), Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Lecture Notes in Statist. vol. 106. Springer, New York, pp. 299-317.
39. Shrikhande S.S. Affine resolvable balanced incomplete block designs: a survey. Aequationes Math. 14:1976;251-269.
40. Suchower S.J. On the maximal number of mutually orthogonal. F -hyperrectangles Utilitas Math. 36:1989;77-82.
41. Suchower S.J. Polynomial representation of complete sets of frequency hyperectangles with prime power dimensions. J. Combin. Theory, Ser. A. 62. 1993;46-65.
42. Suchower, S.J., 1994. Nonisomorphic complete sets of F -rectangles with varying numbers of symbols. In: Mullen, G.L., Shiue, P.J.-S. (Eds.), Finite Fields: Theory, Applications, and Algorithms. Contemporary Math., Amer. Math. Soc. vol. 168. pp. 353-362.
43. Suchower S.J. Nonisomorphic complete sets of. F -rectangles with prime power dimensions Des., Codes Cryptogr. 5:1995;155-174.