Bibliography
Published online by Cambridge University Press: 05 October 2015
- Type
- Chapter
- Information
- Designs and their Codes , pp. 317 - 336Publisher: Cambridge University PressPrint publication year: 1992
References
[1] and . On a combinatorial generalization of 27 lines associated with a cubic surface. J. Austral. Math. Soc, 10:485–492, 1969.Google Scholar
[3] . Über nicht–Desarguessche Ebenen mit transitiver Translationsgruppe. Math. Z., 60:156–186, 1954.Google Scholar
[6] . The binary code arising from a 2–design with a nice collection of ovals. IEEE Trans. Inform. Theory, 29:367–369, 1983.CrossRefGoogle Scholar
[7] On the theory of designs. In , editor, Surveys in Combinatorics, 1989, pages 1–21. Cambridge: Cambridge University Press, 1989. London Mathematical Society Lecture Note Series 141.Google Scholar
[9] and . On an infinite class of Steiner systems with t = 3 and k = 6. J. Combin. Theory, Ser. A, 42:55–60, 1986.CrossRefGoogle Scholar
[10] and . Arcs and ovals in the hermitian and Ree unitals. European J. Combin., 10:297–308, 1989.CrossRefGoogle Scholar
[12] and . Baer subplanes, ovals and unitals.In , editor, Coding Theory and Design Theory, Part I, pages 1–8. New York: Springer–Verlag, 1990. IMA Volumesin Mathematics and its Applications, 20.Google Scholar
[14] and . Hadamard matrices and their designs: a coding–theoretic approach. Trans. Amer. Math. Soc, 330:269–293, 1992.CrossRefGoogle Scholar
[15] and Ovals in projective designs. J. Combin. Theory, Ser. A, 27:307–324, 1979.CrossRefGoogle Scholar
[17] and On tactical configurations and error–correcting codes. J. Combin. Theory, 2:243–257, 1967.CrossRefGoogle Scholar
[20] , , and . Research to Develop the Algebraic Theory of Codes. Applied Research Laboratory, Sylvania Electronic Systems, June 1967. No. AFCRL–67–0365. Contract No. AF19(628)–5998.
[22] and . Ovals from the point of view of coding theory. In , editor, Higher Combinatorics, pages 213–216. Dordrecht: D. Reidel, 1977. Proceedings of the NATO Conference, Berlin 1976.Google Scholar
[27] and . Even order inversive planes, generalized quadrangles and codes. Geom. Dedicata, 22:137–147, 1987.Google Scholar
[28] and . Designs from pairs of finite fields: I. A cyclic unital [/(6) and other regular Steiner 2–designs. J. Combin. Theory, Ser. A, 52:51–61, 1989.Google Scholar
[29] and . Intersection of unitals in the desarguesian plane. In Proceedings of the S.E. Conference on Combinatorics, Graph Theory and Computing, 1989.Google Scholar
[30] . Un'estensione del teorema di Segre–Kustaanheimo. Boll. Un. Mat Ital, Gruppo IV, Serie III, 10:498–506, 1955.Google Scholar
[31] . Combinatorics of Finite Geometries. Cambridge: Cambridge University Press, 1986.Google Scholar
[32] . Topics about 3–Moufang loops and Hall triple systems. Simon Stevin, 54(2): 107–128, 1980.Google Scholar
[33] and . The automorphism group of the generalized Reed–Muller codes. Paris: INRIA Rapports de Recherche No. 1363, 1991.
[34] . Factoring polynomials over finite fields. Bell System Tech. J., 46:1853–1859, 1967.Google Scholar
[35] and . Weight distributions of the cosets of the (32,6) Reed–Muller code. IEEE Trans. Inform. Theory, 18:203– 207, 1972.Google Scholar
[37] , , and . Design Theory. Mannheim, Wien, Zürich: Bibliographisches Institut Wissenschaftsverlag, 1985.Google Scholar
[38] and . Non–isomorphic solutions of some balanced incomplete block designs. I. J. Combin. Theory, 9:174–191, 1970.Google Scholar
[39] and . Permutation Groups and Combinatorial Structures. Cambridge: Cambridge University Press, 1979. London Mathematical Society Lecture Notes Series 33.Google Scholar
[40] . Transform techniques for error control codes. IBM J. Res. Develop., 23:299–315, 1979.Google Scholar
[45] and . On a class of error correcting binary group codes. Inform, and Control, 3:68–79, 1960.Google Scholar
[46] and . A note on a result in the theory of code construction. Inform, and Control, 2:183–194, 1959.Google Scholar
[47] and . 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
[48] . On the connection between the ordinary and the modular characters of groups of finite order. Ann. Math., 42:926–935, 1941.Google Scholar
[49] . Algebraic duality theorems with combinatorial applications. Linear Algebra Appl, 22:157–162, 1978.Google Scholar
[50] . Some unitals on 28 points and their embeddings in projective planes of order 9. In and , editors, Geometries and Groups, pages 183–188. Berlin: Springer–Verlag, 1981. Lecture Notes in Mathematics, 893.Google Scholar
[51] , , and A.|Neumaier. Distance–Regular Graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete, Folge 3, Band 18. Berlin, New York: Springer–Verlag, 1989.Google Scholar
[52] . Construction problems in finite projective spaces. In , editor, Finite Geometric Structures and their Applications, pages 105–188. C.I.M.E., Edizioni Cremonese, Roma, 1973. Corso tenuto a Bressannone dal 18 al 27 Giugno 1972.Google Scholar
[53] and . The construction of translation planes from projective spaces. J. Algebra, 1:85–102, 1964.Google Scholar
[54] . Blocking sets in finite projective planes. SIAM J. Appl. Math., 21:380–392, 1971.Google Scholar
[55] and . Intersections in projective space I: Combinatorics. Math. Z., 193:215–225, 1986.Google Scholar
[56] and . On the p–rank of incidence matrices and a question of E. S. Lander. Contemp. Math., 111:39–45, 1990.Google Scholar
[57] . Existence of unitals in finite translation planes of order q2 with a kernel of order q. Geom. Dedicata, 5:189–194, 1976.Google Scholar
[58] , , and J.|Doyen. Finite linear spaces with flag–transitive groups. J. Combin. Theory, Ser. A, 49:268–293, 1988.Google Scholar
[59] , , , , , and . Linear spaces with flag–transitive automorphism groups. Preprint.
[60] . Uber die zur Kummerkonfiguration analogen Schematavon 16 Punkten und 16 Blocken und ihre Gruppen. Abh. Math. Sem. Univ. Hamburg, 26:129–144, 1963.Google Scholar
[61] , , and . A strengthening of the Assmus–Mattson theorem. IEEE Trans. Inform. Theory, 37:1261–1268, 1991.Google Scholar
[63] . Parallelisms of Complete Designs. Cambridge: Cambridge University Press, 1976. London Mathematical Society Lecture Notes Series 23.Google Scholar
[64] and . Graphs, Codes and Designs. Cambridge: Cambridge University Press, 1980. London Mathematical Society Lecture Notes Series 43.Google Scholar
[65] . Difference Sets in Elementary Abelian Groups. Les Presses de l'Univérsite de Montreal, 1979. Seminaire de Mathématiques Supérieures, Département de Mathématiques et de Statistique, Université de Montréal.
[66] . Cayley: A Language for Group Theory. Department of Mathematics, University of Sydney, July 1982.Google Scholar
[67] . Codés cycliques étendus invariants sous le groupe affine. Thése de Doctorat d'État, Université Paris VII, 1987.Google Scholar
[68] . A new description of some polynomial codes: the primitive generalized Reed–Muller code. Technical report, Université Paris VII, 1985.Google Scholar
[69] . Une généralisation de la construction de Berman des codes de Reed et Muller p–aires. Communications in Algebra, 16:2231–2246, 1988.Google Scholar
[70] . Codes cycliques étendus affines–invariants et antichaines d'un ensemble partiellement ordonné. Discrete Math., 80:229–247, 1990.Google Scholar
[71] . Hyper ovals in desarguesian planes of even order. Ann. of Discrete Math., 37:87–94, 1988.Google Scholar
[72] W. E.|Cherowitzo. Hyper ovals in the translation planes of order 16. J. Combin. Math. & Combin. Comput., 9:39–55, 1991.
[73] . Three lectures on exceptional groups. In and , editors, Finite Simple Groups, pages 215–247. New York, London: Academic Press, 1971. Proceedings of an Instructional Conference Organized by the London Mathematical Society — a NATO Advanced Study Institute.Google Scholar
[74] and . On the enumeration of self–dual codes. J. Combin. Theory, Ser. A, 28:26–53, 1980.Google Scholar
[75] and . Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften 290. New York: Springer–Verlag, 1988.Google Scholar
[76] . The regular dodecahedron and the binary Golay code. Ars Combin., 29B:55–64, 1990.Google Scholar
[78] and . The translation planes of order twenty–five. J. Combin. Theory, Ser. A, 59:193–217, 1992.Google Scholar
[79] . Ranks of incidence matrices of t–designs S (t,t + 1, A). European J. Combin., 1:97–100, 1980.Google Scholar
[80] . A geometric approach to a class of cyclic codes. J. Combin. Theory, 6:340–358, 1969.Google Scholar
[81] . On cyclic codes that are invariant under the general linear group. IEEE Trans. Inform. Theory, 16:760–769, 1970.Google Scholar
[82] . Majority logic decodable codes derived from finite inversive planes. Inform, and Control, 18:319–325, 1971.Google Scholar
[83] , , and . On generalized Reed–Muller codes and their relatives. Inform, and Control, 16:403– 442, 1970.Google Scholar
[85] . Finite Geometries. Ergebnisse der Mathematik undihrer Grenzbegiete, Band 44. Berlin, Heidelberg, New York: Springer–Verlag, 1968.Google Scholar
[86] and . Some characterizations of finite projective spaces. Arch. Math., 11:465–469, 1960.Google Scholar
[87] and . The classification of the translation planes of order 16, I. Geom. Dedicata, 15:137–153, 1983.Google Scholar
[89] . Linear Groups with an Exposition of the Galois Field Theory. New York: Dover Publications, 1958. (With an introduction by Wilhelm Magnus).Google Scholar
[90] . La Géométrie des Groupes Classiques. Ergebnisseder Mathematik und ihrer Grenzgebiete, Neue Folge, Band 5. Berlin, Gottingen, Heidelberg: Springer–Verlag, second edition, 1963.Google Scholar
[91] . Sur les Groupes Classiques. Actualites scientifiques et industrielles 1040. Paris: Hermann, third edition, 1973.Google Scholar
[92] . Private communication.
[93] . A survey of bent functions. NSAL–S–203,092.
[96] and . Block designs with the symmetric difference property. In , editor, Proceedings of the NSA Mathematical Sciences Meetings, pages 159–164. The United States Government, 1987.Google Scholar
[98] . Linear spaces and Steiner systems. In M.|Aigner and , editors, Geometries and Groups, pages 30–42. Berlin: Springer–Verlag, 1981. Lecture Notes in Mathematics, 893.Google Scholar
[99] , , and . Ranks of incidence matrices of Steiner triple systems. Math. Z., 163:251–259, 1978.Google Scholar
[100] . Translation planes of order q2: asymptotic estimates. Trans. Amer. Math. Soc, 238:301–308, 1978.Google Scholar
[101] , , and . Complete arcs in planes of square order. Ann. Discrete Math., 30:243–250, 1986.Google Scholar
[104] . Affine planes and permutation polynomials. In , editor, Coding Theory and Design Theory, Part II, pages 99–100. Springer–Verlag, 1990. IMA Volumes in Mathematics and its Applications, 21.Google Scholar
[105] and . On a class of majority–logic decodable cyclic codes. IEEE Trans. Inform. Theory, 14:182–188, 1968.Google Scholar
[106] and . Strongly regular graphs derived from combinatorial designs. Canad. J. Math., 22:597–614, 1970.Google Scholar
[109] and Williams. On the number of information symbols in difference–set cyclic codes. Bell System Tech. J., 45:1057–1070, 1966.Google Scholar
[111] . Intersection triangles and block intersection numbers of Steiner systems. Math. Z., 139:87–104, 1974.Google Scholar
[112] and . Linear Geometry. Graduate Texts in Mathematics: 49. New York: Springer Verlag, second edition, 1977.Google Scholar
[113] . Résolution d'une question relative aux determinants. Bull. Sci. Math., 2:240–246, 1893.Google Scholar
[114] and . The Classical Groups and K–Theory. Grundlehren der mathematischen Wissenschaften 291. New York: Springer–Verlag, 1989.Google Scholar
[118] Automorphisms of Steiner triple systems. Proc. Sympos. Pure Math., 6:47–66, 1962.Google Scholar
[120] Ovals in the desarguesian plane of order 16. Ann. Mat. Pura Appl. (4), 102:159–176, 1975. CLXXIV della Raccolta sotto gli auspici del Consiglio Nazionale delle Ricerche.CrossRefGoogle Scholar
[121] Semi–automorphisms of Hadamard matrices. Math. Proc. Camb. Phil. Soc, 77:459–473, 1975.CrossRefGoogle Scholar
[124] . The rank of the incidence matrix of points and d–flats in finite geometries. J. Sci. Hiroshima Univ. Ser. A–I, 32:381–396, 1968.Google Scholar
[125] . On the p–rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J., 3:153–226, 1973.Google Scholar
[126] . The geometric structure and the p–rank of an affine triple system derived from a nonassociative Moufang loop with the maximum associative center. J. Combin. Theory, Ser. A, 30:285–297, 1981.Google Scholar
[127] and . On the BIB design having the minimum p–rank. J. Combin. Theory, Ser. A, 18:131–140, 1975.Google Scholar
[128] . Error detecting and error correcting codes. Bell System Tech. J., 29:147–160, 1950.Google Scholar
[131] . The existence and construction of balanced incomplete block designs. Ann. Math. Statist, 32:361–386, 1961.Google Scholar
[133] . On codes and projective designs. Technical Report 344, Kyoto University Mathematics Research Institute Seminar Notes, 1979.
[134] . A First Course in Coding Theory. Oxford Applied Mathematics and Computing Science Series. Oxford: Oxford University Press, 1986.Google Scholar
[136] . Projective Geometries over Finite Fields. Oxford: Oxford University Press, 1979.Google Scholar
[137] . Finite Projective Spaces of Three Dimensions. Oxford: Oxford University Press, 1985.Google Scholar
[138] . On the incidence matrix of the Ree unital. Preprint.
[140] . Construction of designs which contain a unital. Arch. Math., 37:179–183, 1981.Google Scholar
[141] . The synthesis of linear sequential coding networks. In , editor, Information Theory. London: Butterworths Scientific Publishers, 1956. Papers read at a Symposium on ‘Information Theory’ held in London in 1955.Google Scholar
[143] and . Projective Planes. Graduate Texts in Mathematics 6. New York: Springer–Verlag, 1973.Google Scholar
[146] . On the totality of the solutions for the symmetrical incomplete block designs A = 2, k = 5 or 6. Sankhya, 7:204–208, 1945.Google Scholar
[147] , , and . Classification of 3–(24,12,5) designs and 24–dimensional Hadamard matrices. J. Combin. Theory, Ser. A, 31:66–93, 1981.Google Scholar
[148] and . On symmetric and quasi–symmetric designs with the symmetric difference property and their codes. J. Combin. Theory, Ser. A, 59:40–50, 1992.Google Scholar
[149] . Plane geometries associated with certain 2–transitive groups. J. Algebra, 37:489–521, 1975.Google Scholar
[150] . Symplectic groups, symmetric designs and line ovals. J. Algebra, 33:43–58, 1975.Google Scholar
[151] . Homogeneous designs and geometric lattices. J. Combin. Theory, Ser. A, 38:66–74, 1985.Google Scholar
[153] , , and . Some results on cyclic codes which are invariant under the affine group and their applications. Inform, and Control, 11:475–496, 1967.Google Scholar
[154] , , and . New generalizations of the Reed–Muller codes. Part I: Primitive codes. IEEE Trans. Inform. Theory, 14:189–199, 1968.Google Scholar
[156] . Unital intersections in finite projective planes. Geom. Dedicata, 11:107–117, 1981.Google Scholar
[159] J. D.|Key. Extendable Steiner systems. Geom. Dedicata, 41:201–205, 1992.
[160] and . An upper bound for the p–rank of a translation plane. J. Combin. Theory, Ser. A, 56:297–302, 1991.Google Scholar
[162] and . Steiner triple systems with doubly transitive automorphism groups: a corollary to the classification theorem for finite simple groups. J. Combin. Theory, Ser. A, 36:105–110, 1984.Google Scholar
[163] and . On an infinite class of Steiner systems constructed from affine spaces. Arch. Math., 47:376–378, 1986.Google Scholar
[164] . A summary of noncyclic difference sets, k < 20. J. Combin. Theory, Ser. A, 25:62–67, 1978.Google Scholar
[165] . Classification of Hadamard matrices of order 28 with Hall sets. Preprint.
[168] and . Construction of Hadamard matrices of order 28. Graphs Combin., 2:247–257, 1986.Google Scholar
[170] . Techniques for enumerating Veblen–Wedderburn systems. J. Assoc. Comput. Mach., 7:330–337, 1960.Google Scholar
[172] . Über den p–Rang von Inzidenzmatrizen. J. Combin. Theory, Ser. A, 43:138–139, 1986.Google Scholar
[173] . On self–dual, doubly even codes of length 32. J. Combin. Theory, Ser. A, 51:63–76, 1989.Google Scholar
[175] . Old and new results on ovals in finite projective planes. In , editor, Surveys in Combinatorics, 1991, pages 41–72. Cambridge: Cambridge University Press, 1991. London Mathematical Society Lecture Note Series 166.Google Scholar
[176] . The search for a finite projective plane of order 10. Amer. Math. Monthly, 98:305–318, 1991.Google Scholar
[177] , , and . A computer search for finite projective planes of order 9. Discrete Math., 92:187–195, 1991.Google Scholar
[178] , , and . On self–dual ternary codes generated by the inequivalent Hadamard matrices of order 24. Preprint.
[179] , , and . The non–existence of finite projective planes of order 10. Canad. J. Math., 41:1117–1123, 1989.Google Scholar
[180] , , , and . The non–existence of ovals in a projective plane of order 10. Discrete Math., 45:319–321, 1983.Google Scholar
[181] . Symmetric Designs: an Algebraic Approach. Cambridge: Cambridge University Press, 1983. London Mathematical Society Lecture Notes Series 74.Google Scholar
[182] and . Classical codes as ideals in group algebras. Des. Codes Cryptogr., 2:273–285, 1992.Google Scholar
[183] , , and . Self–dual codes over GF(5). J. Combin. Theory, Ser. A, 32:178–194, 1982.Google Scholar
[184] , , and . On ternary self–dual codes of length 24. IEEE Trans. Inform. Theory, 27:176–180, 1981.Google Scholar
[185] and . Introduction to Finite Fields and their Applications. Cambridge: Cambridge University Press, 1986.Google Scholar
[186] . Coding Theory. Lecture Notes in Mathematics, 201. Berlin: Springer–Verlag, 1970.Google Scholar
[188] . Introduction to Coding Theory. Graduate Texts in Mathematics 86. New York: Springer–Verlag, 1982.Google Scholar
[189] . Algebraic geometric codes. In , editor, Coding Theory and Design Theory, Part I, pages 137–162. New York: Springer–Verlag, 1990. IMA Volumes in Mathematics and its Applications, 20.Google Scholar
[190] . Codes and combinatorial designs. In et al., editors, Design Theory, Coding Theory and Group Theory. New York: Wiley Inter science.
[191] and . Introduction to Coding Theory and Algebraic Geometry. DMV Seminar Band 12. Basel: Birkhauser Verlag, 1988.Google Scholar
[193] . Charakterisierungen der endlichen desarguesschen projektiven Ebenen. Math. Z., 85:419–450, 1964.Google Scholar
[194] . Some remarks concerning the Ree group of type (G2). J. Algebra, 3:256–259, 1966.Google Scholar
[195] . Lectures on projective planes. Technical report, University of Illinois at Chicago Circle, 1968/69.
[196] . Transitive Erweiterungen endlicher Permutationsgruppen. Lecture Notes in Mathematics, 84. Berlin: Springer–Verlag, 1969.Google Scholar
[198] and . k –Archi completi nei piani proietivi desarguesiani di rango 8 e 16. Technical report, Centro Calcoli Numerici,Politecnico di Milano, 1958.
[202] and . On the p–rank of the design matrix of a difference set. Inform, and Control, 12:474–489, 1968.Google Scholar
[203] and . The Theory of Error– Correcting Codes. Amsterdam: North–Holland, 1983.
[205] and . Simple 6–(33,8,36) designs from PFL2(32). In Computational Group Theory, pages 337–352. New York: Academic Press, 1984.Google Scholar
[206] . A classification of the cosets of the Reed–Muller code R (l,6). Math. Comp., 57:403–414, 1991.Google Scholar
[207] . Addition Theorems: The Addition Theorems of Group Theory and Number theory. Interscience Tracts in Pure and Applied Mathematics: 18. New York: Interscience Publishers, 1965.Google Scholar
[209] . Book Review: Theory and Practice of Error Control Codes, by . IEEE Trans. Inform. Theory, 31:553–554, 1985.Google Scholar
[210] . Constructions of cyclic Steiner 2–designs. Ann. Discrete Math.. 34:353–362, 1987.Google Scholar
[211] . Book Review: The Theory of Error–Correcting Codes, by and . SI AM Review, 22:513–519, 1980.Google Scholar
[212] . and . A new treatment of Bose–Chaudhuri codes. J. Soc. Indust. Appl. Math., 9:654–669, 1961.CrossRefGoogle Scholar
[213] and . A search for a non–desarguesian plane of prime order. In and , editors, Finite Geometries, pages 199–208. New York: Marcel Dekker, 1985. Lecture Notes in Pure and Applied Mathematics, 103.Google Scholar
[218] . Bruck nets, codes, and characters of loops. Des. Codes Cryptogr., 1:7–29, 1991.Google Scholar
[219] . The modular permutation representations of the known doubly transitive groups. Proc. London Math. Soc. (3), 41:1–20, 1980.Google Scholar
[220] . On minimum weight codewords in QR codes. J. Combin. Theory, Ser. A, 48:104–119, 1988.Google Scholar
[224] . Finite Translation Planes. Lecture Notes in Mathematics, 158. Berlin: Springer–Verlag, 1970.Google Scholar
[225] and . On projective and affine planes with transitive collineation groups. Math. Z., 71:186–199, 1959.Google Scholar
[227] . Some remarks on representation theory in finite geometry. In and , editors, Geometries and Groups, pages 68–110. Berlin: Springer–Verlag, 1981. Lecture Notes in Mathematics, 893.Google Scholar
[228] . An elementary introduction to algebraic methods for finite projective planes. Technical Report 50, Universita di Roma La Sapienza, Marzo 1984. Seminario di Geometrie Combinatorie, diretto da G. Tallini.
[231] . Caratterizzazione delle quadriche di uno spazio (tridimensionale) lineare sopra un corpo finito. Boll. Uni. Mat. Ital, Gruppo IV, Serie III, 10:507–513, 1955.Google Scholar
[233] and . Finite Generalized Quadrangles. Research Notes in Mathematics 110. Boston: Pitman, 1984.Google Scholar
[234] and . Private communication.
[236] . Unitary block designs. In , editor, Graph Theory and Combinatorics, pages 98–105. Pitman, 1979. Research Notes in Math., 34.Google Scholar
[237] . Symmetry codes over GF(3) and new 5–designs. J. Combin. Theory, 12:119–142, 1972.Google Scholar
[238] . The Theory of Error–Correcting Codes. New York: John Wiley and Sons, 1989. Second Edition.Google Scholar
[239] and . Binary self–dual codes of length 24. Bull. Amer. Math. Soc, 80:1173–1178, 1974.Google Scholar
[240] . Applications of the DFT to abelian difference sets. Arch. Math., 51:283–288, 1988.Google Scholar
[241] . Cyclic error–correcting codes in two symbols. Electronics Research Directorate, Air Force Cambridge Research Center, September 1957. AFCRC–TN–57–103. ASTIA Document AD133749.
[242] . An algorism for factoring xn — 1 over a finite field. Electronics Research Directorate, Air Force Cambridge Research Center, October 1959. AFCRC–TN–59–775.
[243] . The use of coset equivalence in the analysis and decoding of group codes. Electronics Research Directorate, Air Force Cambridge Research Center, June 1959. AFCRC–TN–59–164.
[244] . Some remarks concerning curves of second degree in a finite plane. Ann. Acad. Sci. Fenn. Ser. AI, (134), 1952.Google Scholar
[246] . A family of simple groups associated with the simple Lie algebra of type (G2). Amer. J. Math., 83:432–462, 1961.Google Scholar
[247] . Generalized Reed–Muller codes and finite geometries. PhD thesis, Lehigh University, 1993.Google Scholar
[249] . A class of majority logic decodable codes. IEEE Trans. Inform. Theory, 13:305–307, 1967.Google Scholar
[251] . The Fp span of the incidence matrix of a finite projective plane. Geom. Dedicata, 8:407–415, 1979.Google Scholar
[252] and . Generalized t–designs and weighted majority decoding. Inform, and Control, 42:261–282, 1979.Google Scholar
[254] . Sui determinant! di valore massimo. Rendiconti Reale Istituto Lombardo di Scienze e Lettere (Milan Rendiconti), 31:1441– 1446, 1898.Google Scholar
[255] . A linear complexity approach to cyclic codes. PhD thesis, Swiss Federal Institute of Technology, Zurich, 1988. Diss. ETH No. 8730.
[256] . Equations over Finite Fields: An elementary approach. Berlin: Springer–Verlag, 1976.Google Scholar
[257] and . Hecke operators and the weight distributions of certain codes. J. Combin. Theory, Ser. A, 57:163–186, 1991.Google Scholar
[258] . A non–existence theorem for an infinite family of symmetrical block designs. Ann. Eugenics, pages 286–287, 1949.Google Scholar
[260] . A mathematical theory of communication. Bell System Tech. J., 27:379–423,623–656, 1948.Google Scholar
[261] . Associated t–designs and automorpism groups of certain linear codes. PhD thesis, Lehigh University, 1969.Google Scholar
[262] and . Quasi–Symmetric Designs. Cambridge: Cambridge University Press, 1991. London Mathematical Society Lecture Notes Series, 164.Google Scholar
[263] and . On a method of constructing incomplete block designs. Sankhya, A, 24:25–32, 1962.Google Scholar
[265] . A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc, 43:377–385, 1938.Google Scholar
[267] . On the p–rank of the incidence matrix of points and hyperplanes in a finite projective geometry. J. Combin. Theory, 7:122–129, 1969.Google Scholar
[269] . Thoughts on Inverse Orthogonal Matrices, simultaneous Sign–succession, and Tessellated Pavements in two or more colours, with applications to Newton's Rule, Ornamental Tile–work, and the Theory of Numbers. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 34:461–475, December 1867.Google Scholar
[270] . On projective and affine hyperplanes. J. Combin. Theory, Ser. A, 28:290–306, 1980.Google Scholar
[271] . Non–trivial t–designs without repeated blocks exist for all t. Discrete Math., 65:301–311, 1987.Google Scholar
[272] . Extensions of finite generalized quadrangles. Symposia Mathematica, 28:127–143, 1986. Published by Istituto Nazionale di Alta Matematica Francesco Severi and distributed by Academic Press.Google Scholar
[273] . Solution of a classical problem on finite inversive planes. In , , , and , editors, Finite Geometries, Buildings, and Related Topics, pages 145–159. Oxford: Oxford University Press, 1990.Google Scholar
[274] . Fixed point free involutions and finite projective planes. In , editor, Finite Simple Groups II, pages 321–337. New York: Academic Press, 1980.Google Scholar
[275] . On the nonexistence of perfect codes over finite fields. SI AM J. Appl. Math., 24:88–96, 1973.Google Scholar
[276] . Les groupes simples de Suzuki et de Ree. Seminaire Bourbaki, 13, 210:1–18, 1960/61.Google Scholar
[278] . Projective and Analytic Geometry. Pitman, 1947.
[279] . Hadamard matrices of order 28 with automorphisms of order 7. J. Combin. Theory, Ser. A, 40:62–81, 1985.Google Scholar
[280] . Quasi–symmetric 2–(31,7,7) designs and a revision of Hamada's conjecture. J. Combin. Theory, Ser. A, 42:104–110, 1986.Google Scholar
[281] . Combinatorial Configurations. Pitman Monographs and Surveys in Pure and Applied Mathematics, 40. New York: Longman, 1988.Google Scholar
[284] . On nongroup close–packed codes. Probl. Kibemet, 8:337–339, 1962. Translated from the Russian in Probleme der Kybernetik, 8(1965), 375–378.Google Scholar
[285] and . Non–desarguesian and non–pascalian geometries. Trans. Amer. Math. Soc, 8:379–388, 1907.Google Scholar
[287] . Some Steiner Quadruple Systems 5(3,4,16) such that all 16 derived Steiner Triple Systems 5(2,3,15) are isomorphic. Ars Combin., 24A: 107–129, 1987.Google Scholar
[288] . Orbits on finite incidence structures. Symposia Mathematica, 28:219–229, 1986.Google Scholar
[292] New generalizations of the Reed–Muller codes. Part II: Nonprimitive codes. IEEE Trans. Inform. Theory, 14:199–205, 1968.Google Scholar
[297] . A characterization of the classical unitals. In , , and , editors, Finite Geometries, pages 445–454. Marcel Dekker,Inc, 1983. Lecture Notes in Pure and Applied Mathematics, 82.Google Scholar
[298] . The ‘Snake Oil’ method for proving combinatorial identities. In , editor, Surveys in Combinatorics, 1989, pages 208–217. Cambridge: Cambridge University Press, 1989. London Mathematical Society Lecture Note Series 141.
[299] . Inequalities in S(t,k,v). Lecture notes, IMA, Minnesota, 1988.