Skip to main content
Log in

Nonisomorphic complete sets of F-rectangles with prime power dimensions

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

Abstract

A technique for constructing nonisomorphic complete sets of frequency rectangles with prime power dimensions is described. This procedure is used to establish a conservative general lower bound for the number of possible nonisomorphic complete sets of frequency rectangles of prime power order. Several cases are considered in detail which improve the lower bound for those orders. The technique can also be applied to the construction of inequivalent orthogonal arrays of strength 2.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. C. Bose, On the application of the properties of Galois fields to the problem of construction of Hyper-Graeco-Latin squares,Sankhyā, Vol. 3 (1938) pp. 323–338.

    Google Scholar 

  2. J. Dénes and A. D. Keedwell,Latin Squares and Their Applications, Academic Press, New York (1974).

    Google Scholar 

  3. J. Dénes, G. L. Mullen, and S. J. Suchower, Another generalized Golomb-Posner code,IEEE Trans. Inform. Theory, Vol. IT-36 (1990) pp. 408–411.

    Google Scholar 

  4. W. T. Federer, A. S. Hedayat, and J. P. Mandeli, Pairwise orthogonal F-rectangle designs,J. Statist. Plann. Inference, Vol. 10 (1984) pp. 365–374.

    Google Scholar 

  5. W. T. Federer and J. P. Mandeli, Orthogonal F-rectangles, orthogonal arrays, and codes,J. Combin. Theory Ser. A, Vol. 43 (1986) pp. 149–164.

    Google Scholar 

  6. C. F. Laywine, Complete sets of frequency squares with subsquares,Utilitas Math., Vol. 40 (1991) pp. 87–95.

    Google Scholar 

  7. C. F. Laywine and G. L. Mullen, Generalizations of Bose's equivalence between complete sets of mutually orthogonal latin squares and affine planes,J. Combin. Theory Series A, Vol. 61 (1992) pp. 13–35.

    Google Scholar 

  8. G. L. Mullen, Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order,Discrete Math., Vol. 69 (1988) pp. 79–84.

    Google Scholar 

  9. G. L. Mullen and S. J. Suchower, Frequency hyperrectangles, error-correcting codes, and fractional replication plans,J. Combin. Inform. System Sci., Vol. 18 (1993) pp. 5–18.

    Google Scholar 

  10. C. R. Rao, Some combinatorial problems of arrays and applications to design of experiments, A Survey of Combinatorial Theory (J. N. Srivastava, ed.), North-Holland, Amsterdam (1973) pp. 349–359.

    Google Scholar 

  11. S. J. Schwager, W. T. Federer, and B. L. Raktoe, Nonisomorphic complete sets of orthogonal F-squares and Hadamard matrices,Commun. Statist. Theor. Meth., Vol. 13 (1984) pp. 1391–1406.

    Google Scholar 

  12. S. J. Suchower, Subfield permutation polynomials and orthogonal subfield systems in finite fields,Acta Arith., Vol. 46 (1990) pp. 307–315.

    Google Scholar 

  13. S. J. Suchower, Polynomial representations of complete sets of frequency hyperrectangles with prime power dimensions.J. Combin. Theory Series A, Vol. 62 (1993) pp. 46–65.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by: S. Vanstone

Rights and permissions

Reprints and permissions

About this article

Cite this article

Suchower, S.J. Nonisomorphic complete sets of F-rectangles with prime power dimensions. Des Codes Crypt 5, 155–174 (1995). https://doi.org/10.1007/BF01397668

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01397668

Keywords

Navigation