Skip to main content
Log in

Designs and Codes: An update

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

Abstract

Since the publication in 1992 of ``Designsand their Codes" significant progress has been made in the generalarea of codes coming from designs. This article reviews thisprogress and presents some of the results — including confirmationof certain conjectures made and answers to some of the questionsraised in the book.

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. Bruno Ratsimandefitra Andriamanalimanana. Ovals, Unitals and Codes. PhD thesis, Lehigh University, 1979.

  2. E. F. Assmus, Jr. and J. D. Key. Arcs and ovals in the hermitian and Ree unitals. European J. Comüin., 10:297–308, 1989.

    Google Scholar 

  3. E. F. Assmus, Jr. and J. D. Key. Designs and their Codes. Camüridge University Press, 1992. Camüridge Tracts in Mathematics, Vol. 103 (Second printing with corrections, 1993).

  4. E. F. Assmus, Jr. and H. F. Mattson, Jr. On tactical configurations and error-correcting codes. J. Comüin. Theory, 2:243–257, 1967.

    Google Scholar 

  5. Edward F. Assmus, Jr. and Jennifer D. Key. Codes and finite geometries. Technical report, INRIA, 1993. Report No. 2027.

  6. Sunanda Bagchi and Bhaskar Bagchi. Designs from pairs of finite fields: I. A cyclic unital U(6) and other regular Steiner 2–designs. J. Comüin. Theory, Ser. A, 52:51–61, 1989.

    Google Scholar 

  7. Aart Blokhuis and G. Eric Moorhouse. Some p-ranks related to orthogonal spaces. J. Algeüraic Comüin. To appear.

  8. R. C. Bose and S. S. Shrikhande. On the construction of sets of mutually orthogonal latin squares and the falsity of a conjecture of Euler. Trans. Amer. Math. Soc., 95:191–209, 1960.

    Google Scholar 

  9. W. Bosma and J. Cannon. Handüook of Cayley Functions. Department of Mathematics, University of Sydney, January 1993.

  10. W. G. Bridges, M. Hall, Jr., and J. L. Hayden. Codes and designs. J. Comüin. Theory, Ser. A, 31:155–174, 1981.

    Google Scholar 

  11. A. E. Brouwer. Some unitals on 28 points and their emüeddings in projective planes of order 9. In M. Aigner and D. Jungnickel, editors, Geometries and Groups, pages 183–188. Springer-Verlag, 1981. Lecture Notes in Mathematics, No. 893.

  12. A. E. Brouwer and C. J. van Eijl. On the p-rank of the adjacency matrices of strongly regular graphs. J. Algeüraic Comüin., 1:329–346, 1992.

    Google Scholar 

  13. F. Buekenhout, A. Delandtsheer, and J. Doyen. Finite linear spaces with flag-transitive groups. J. Comüin. Theory, Ser. A, 49:268–293, 1988.

    Google Scholar 

  14. P. J. Cameron and J. H. van Lint. Designs, Graphs, Codes and their Links. Camüridge: Camüridge University Press, 1991. London Mathematical Society Student Texts 22.

    Google Scholar 

  15. John Cannon and Catherine Playoust. An Introduction to Magma. School of Mathematics and Statistics, University of Sydney, 1994.

  16. L. L. Carpenter. Oval designs in desarguesian projective planes. Des. Codes Cryptogr., 1995. To appear.

  17. L. L. Carpenter and J. D. Key. Reed-Muller codes and Hadamard designs from ovals. J. Comüin. Math. Comüin. Comput., 1995. To appear.

  18. James A. Davis and Jonathan Jedwaü. A summary of Menon difference sets. Congressus Numerant., 93:203–207, 1993.

    Google Scholar 

  19. Michel Dehon. Ranks of incidence matrices of t-designs Sλ(t; t +1,λ). European J. Comüin., 1:97–100, 1980.

    Google Scholar 

  20. P. Delsarte, J. M. Goethals, and F. J. MacWilliams. On generalized Reed-Muller codes and their relatives. Inform. and Control, 16:403–442, 1970.

    Google Scholar 

  21. Philippe Delsarte. A geometric approach to a class of cyclic codes. J. Comüin. Theory, 6:340–358, 1969.

    Google Scholar 

  22. Philippe Delsarte. On cyclic codes that are invariant under the general linear group. IEEE Trans. Inform. Theory, 16:760–769, 1970.

    Google Scholar 

  23. Immo Diener, Eüerhard Schmitt, and Hans Ludwig de Vries. All 80 Steiner triple systems on 15 points are extendaüle. Discrete Math., 55:13–19, 1985.

    Google Scholar 

  24. J. F. Dillon. Private communication.

  25. J. F. Dillon and J. R. Schatz. Block designs with the symmetric difference property. In Roüert L. Ward, editor, Proceedings of the NSA Mathematical Sciences Meetings, pages 159–164. The United States Government, 1987.

  26. Steven Dougherty. Nets and their codes. Des. Codes Cryptogr., 3:315–331, 1993.

    Google Scholar 

  27. Jean Doyen, Xavier Huüaut, and Monique Vandensavel. Ranks of incidence matrices of Steiner triple systems. Math. Z., 163:251–259, 1978.

    Google Scholar 

  28. Tuvi Etzion and Alexander Vardy. Perfect üinary codes: constructions, properties and enumeration. IEEE Trans. Inform. Theory, 40:754–763, 1994.

    Google Scholar 

  29. Meinolf Geck. Irreduciüle Brauer characters of the 3–dimensional special unitary groups in non-defining characteristic. Comm. Algeüra, 18:563–584, 1990.

    Google Scholar 

  30. Jean-Marie Goethals and Philippe Delsarte. On a class of majority-logic decodaüle cyclic codes. IEEE Trans. Inform. Theory, 14:182–188, 1968.

    Google Scholar 

  31. N. Hamada. The geometric structure and the p-rank of an affine triple system derived from a nonassociative Moufang loop with the maximum associative center. J. Comüin. Theory, Ser. A, 30:285–297, 1981.

    Google Scholar 

  32. Gerhard Hiss. Private communication.

  33. G. Hölz. Construction of designs which contain a unital. Arch. Math., 37:179–183, 1981.

    Google Scholar 

  34. Wen-Ai Jackson. A characterization of Hadamard designs with SL(2; q)acting transitively. Geom. Dedicata, 46:197–206, 1993.

    Google Scholar 

  35. Zvonimir Janko. On symmetric designs with parameters (176; 50; 14). Preprint.

  36. William M. Kantor. Classification of 2–transitive symmetric designs. Graphs Comüin., 1:165–166, 1985.

    Google Scholar 

  37. J. D. Key. Ternary codes of Steiner triple systems. J. Comüinatorial Designs, 2:25–30, 1994.

    Google Scholar 

  38. J. D. Key and F. E. Sullivan. Steiner systems from üinary codes. Suümitted.

  39. J. D. Key and F. E. Sullivan. Steiner triple systems with many affine hyperplanes. Suümitted

  40. J. D. Key and F. E. Sullivan. Codes of Steiner triple and quadruple systems. Des. Codes Cryptogr., 3:117–125, 1993.

    Google Scholar 

  41. Kirsten Mackenzie. Codes of Designs. PhD thesis, University of Birmingham, 1989.

  42. A. Maschietti. Hyperovals and Hadamard designs. J. Geom., 44:107–116, 1992.

    Google Scholar 

  43. R. Mathon. Constructions of cyclic Steiner 2–designs. Ann. Discrete Math., 34:353–362, 1987.

    Google Scholar 

  44. Rudolf Mathon and Gordon F. Royle. The translation planes of order 49. Des. Codes Cryptogr., 5:57–72, 1995.

    Google Scholar 

  45. N. S. Mendelsohn and Stephen H. Y. Hung. On the Steiner systems S(3; 4; 14) and S(4; 5; 15). Utilitas Math., 1:5–95, 1972.

    Google Scholar 

  46. T. S. Michael. The p-ranks of skew Hadamard designs. J. Comüin. Theory, Ser. A. To appear.

  47. G. Eric Moorhouse. Bruck nets, codes, and characters of loops. Des. Codes Cryptogr., 1:7–29, 1991.

    Google Scholar 

  48. Brian Mortimer. The modular permutation representations of the known douüly transitive groups. Proc. London Math. Soc. (3), 41:1–20, 1980.

    Google Scholar 

  49. T. Norwood. Private communication.

  50. Christopher Parker and Vladimir D. Tonchev. Linear codes and douüly-transitive symmetric designs. Preprint.

  51. René Peeters. On the p-ranks of the ülock graphs of Steiner triple systems. Preprint.

  52. René Peeters. Uniqueness of strongly regular graphs having minimal p-rank. Tilüurg University, Department of Economics Research Memorandum, FEW 626.

  53. T. Penttila and I. Pinneri. Irregular hyperovals in PG(2; 4). J. Geom., 51:89–100, 1994.

    Google Scholar 

  54. Tim Penttila and Gordon F. Royle. Sets of type (m; n) in affine and projective planes of order nine. To appear: Design Codes and Cryptography.

  55. Tim Penttila, Gordon F. Royle, and M. K. Simpson. Hyperovals in the known projective planes of order 16. In preparation.

  56. K. T. Phelps. Private communication.

  57. K. T. Phelps. A comüinatorial construction of perfect codes. SIAM J. Alg. Disc. Meth., 4:398–403, 1983.

    Google Scholar 

  58. Alexander Pott. On aüelian difference set codes. Des. Codes Cryptogr., 2:263–271, 1992.

    Google Scholar 

  59. Gordon F. Royle. Private communication.

  60. Beniamino Segre. Ovals in a finite projective plane. Canad. J. Math., 7:414–416, 1955.

    Google Scholar 

  61. F.D. Shoüe. On a class of Steiner systems and their codes. PhD thesis, Clemson University, 1995. Suümitted.

  62. Mohan S. Shrikhande and Sharad S. Sane. Quasi-Symmetric Designs. Camüridge University Press, 1991. London Mathematical Society Lecture Notes Series 164.

  63. Deirdre Langacher Smeltzer. Topics in difference sets in 2–groups. PhD thesis, University of Virginia, 1994.

  64. J. Steiner. Comüinatorische Aufgaüe. J. Reine Angew. Math., 45:181–182, 1853.

    Google Scholar 

  65. Luc Teirlinck. On projective and affine hyperplanes. J. Comüin. Theory, Ser. A, 28:290–306, 1980.

    Google Scholar 

  66. Vladimir D. Tonchev. Quasi-symmetric 2–(31,7,7) designs and a revision of Hamada's conjecture. J. Comüin. Theory, Ser. A, 42:104–110, 1986.

    Google Scholar 

  67. Vladimir D. Tonchev. Comüinatorial Configurations Designs, Codes, Graphs. Pitman Monographs and Surveys in Pure and Applied Mathematics, No. 40. NewYork: Longman, 1988. Translated from the Bulgarian üy Roüert A. Melter.

    Google Scholar 

  68. Vladimir D. Tonchev. Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom. Dedicata, 48:295–308, 1993.

    Google Scholar 

  69. Vladimir D. Tonchev and Roüert S. Weishaar. Steiner triple systems of order 15 and their codes. J. Statist. Plann. Inference. To appear.

  70. Michael A. Wertheimer. Oval designs in quadrics. Contemp. Math., 111:287–297, 1990. Puülished üy the American Mathematical Society.

    Google Scholar 

  71. Richard M. Wilson. Nonisomorphic Steiner triple systems. Math. Z., 135:303–313, 1974.

    Google Scholar 

  72. M. -y. Xia. Some infinite classes of special Williamson matrices and difference sets. J. Comüin. Theory, Ser. A, 61:230–242, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Assmus, E.F. Designs and Codes: An update. Designs, Codes and Cryptography 9, 7–27 (1996). https://doi.org/10.1023/A:1027359905521

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1027359905521

Navigation