References

References

 [1]

M. Aigner. Kombinatorik, 2. Matroide und Transversaltheorie. Springer Verlag, Berlin, Heidelberg, New York, 1976. ISBN 3-540-07949-1.

 [2]

E. Arnold. Äquivalenzklassen linearer Codes. Master's thesis, Universität Bayreuth, 1993.

 [3]

C. Benecke, R. Grund, R. Hohberger, A. Kerber, R. Laue, and T. Wieland. Chemical Isomerism, a Challenge for Algebraic Combinatorics and for Computer Science. In G. Cohen, M. Giusti, and T. Mora, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 1995, volume 948 of Lecture Notes in Computer Science, pages 4-20. Springer, 1995.

 [4]

F. Bergeron, G. Labelle, and P. Leroux. Théorie des espèces et combinatoire des structures, volume 19 of Répertoire des Publications du LACIM. Laboratoire de combinatoire et d'informatique mathématique, 1994. ISBN 2-89276-135-2.

 [5]

A. Betten. Gruppenaktionen auf Verbänden und die Konstruktion kombinatorischer Objekte. Master's thesis, Universität Bayreuth, June 1995.

 [6]

A. Betten, H. Fripertinger, A. Kerber, A. Wassermann, and K.-H. Zimmermann. Fehlerkorrigierende lineare Codes, eine Einführung. To be published at Springer.

 [7]

T. Brylawski and D. Lucas. Uniquely representable combinatorial geometries. Atti dei Convegni Lincei, 17:83-104, 1976. Colloquio internazionale sulle Teorie Combinatoire con la Collaborazione della American Mathematical Society, 1973, Accad. Naz. Lincei, Rome.

 [8]

P.J. Cameron, C.J. Colbourn, R.C. Read, and N.C. Wormald. Cataloguing the graphs on 10 vertices. Journal of Graph Theory, 9:551 - 562, 1985.

 [9]

C.J. Colbourn and R.C. Read. Orderly algorithms for generating restricted classes of graphs. Journal of Graph Theory, 3:187 - 195, 1979.

 [10]

N.G. de Bruijn. Pólya's Theory of Counting. In E.F. Beckenbach, editor, Applied Combinatorial Mathematics, chapter 5, pages 144 - 184. Wiley, New York, 1964.

 [11]

J.D. Dixon and H.S. Wilf. The random selection of unlabeled graphs. Journal of Algorithms, 4:205 - 213, 1983.

 [12]

H. Fripertinger. Cycle indices of linear, affine and projective groups. To appear in the Journal of Linear Algebra and Its Applications.

 [13]

H. Fripertinger. Enumeration, construction and random generation of block codes. Submitted to Designs, Codes and Cryptography.

 [14]

H. Fripertinger. Enumeration of Mosaics. To be published.

 [15]

H. Fripertinger. Enumeration in Musical Theory. Séminaire Lotharingien de Combinatoire, 476/S-26:29 - 42, 1992. ISSN 0755-3390.

 [16]

H. Fripertinger. Endliche Gruppenaktionen auf Funktionenmengen. Das Lemma von Burnside -- Repräsentantenkonstruktionen -- Anwendungen in der Musiktheorie. Bayreuther Mathematische Schriften, 45:19 - 135, 1993. ISSN 0172-1062.

 [17]

H. Fripertinger. Endliche Gruppenaktionen in Funktionenmengen. Das Lemma von Burnside -- Repräsentantenkonstruktionen -- Anwendungen in der Musiktheorie. PhD thesis, Karl-Franzens-Universität Graz, 1993.

 [18]

H. Fripertinger. Enumeration of isometry classes of linear (n,k)-codes over GF(q) in SYMMETRICA. Bayreuther Mathematische Schriften, 49:215 - 223, 1995. ISSN 0172-1062.

 [19]

H. Fripertinger. Zyklenzeiger linearer Gruppen und Abzählung linearer Codes. Séminaire Lotharingien de Combinatoire, Actes 33:1 - 10, 1995. ISSN 0755-3390.

 [20]

H. Fripertinger. The Cycle Index of the Symmetry Group of the Fullerene C₆₀. match, 33:121-138, 1996.

 [21]

H. Fripertinger. Enumeration of Linear Codes by Applying Methods from Algebraic Combinatorics. Grazer Math. Berichte, 328:31 - 42, 1996.

 [22]

H. Fripertinger. The Three-dimensional Cycle Index of the Leapfrog of a Polyhedron. J. Chem. Inf. Comput. Sci., 37(3):535-537, 1997.

 [23]

H. Fripertinger and A. Kerber. Isometry Classes of Indecomposable Linear Codes. In G. Cohen, M. Giusti, and T. Mora, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 1995, volume 948 of Lecture Notes in Computer Science, pages 194-204. Springer, 1995.

 [24]

H. Fripertinger and P. Schöpf. Endofunctions of given cycle-type. Submitted to The Annales des Sciences Mathematiques du Quebec.

 [25]

R. Grund. Symmetrieklassen von Abbildungen und die Konstruktion von diskreten Strukturen. Bayreuther Mathematische Schriften, 31:19 - 54, 1990. ISSN 0172-1062.

 [26]

R. Grund. Konstruktion molekularer Graphen mit gegebenen Hybridisierungen und überlappungsfreien Fragmenten. Bayreuther Mathematische Schriften, 49:1 - 113, 1995. ISSN 0172-1062.

 [27]

R. Hager, A. Kerber, R. Laue, D. Moser, and W. Weber. Construction of orbit representatives. Bayreuther Mathematische Schriften, 35:157 - 169, 1991. ISSN 0172-1062.

 [28]

F. Harary, editor. Graph Theory and Theoretical Physics. Academic Press, London, New York, 1967.

 [29]

W. Heise and P. Quattrocchi. Informations- und Codierungstheorie. Springer Verlag, Berlin, Heidelberg, New York, Paris, Tokio, 1989. second edition.

 [30]

A. Joyal. Une théorie combinatoire des séries formelles. Advances in Mathematics, 42:1 - 82, 1981.

 [31]

A. Kerber. Anwendungsorientierte Theorie endlicher Strukturen. To be published.

 [32]

A. Kerber. Algebraic Combinatorics via Finite Group Actions. B.I. Wissenschaftsverlag, Mannheim, Wien, Zürich, 1991. ISBN 3-411-14521-8.

 [33]

A. Kerber. Algebraic Combinatorics in Bayreuth. Séminaire Lotharingien de Combinatoire, B34j, 1995. http://cartan.u-strasbg.fr/ slc//divers/../wpapers/s34bayreuth.html.

 [34]

D. Lattermann. Computerunterstützte Abzählung von Codes. Master's thesis, Universität Bayreuth, 1994.

 [35]

H. Lehmann. Das Abzähltheorem der Exponentialgruppe in gewichteter Form. Mitteilungen aus dem Mathem. Seminar Giessen, 112:19 - 33, 1974.

 [36]

H. Lehmann. Ein vereinheitlichender Ansatz für die REDFIELD - PÓLYA - de BRUIJNSCHE Abzähltheorie. PhD thesis, Universität Giessen, 1976.

 [37]

G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Mathematica, 68:145 - 254, 1937.

 [38]

G. Pólya and R.C. Read. Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer Verlag, New York, Berlin, Heidelberg, London, Paris, Tokyo, 1987. ISBN 0-387-96413-4 or ISBN 3-540-96413-4.

 [39]

R.C. Read. Every one a winner. Ann. Discrete Mathematics, 2:107 - 120, 1978.

 [40]

R.C. Read and N.C. Wormald. Catalogues of graphs and digraphs. Discrete Mathematics, 31:224, 1980.

 [41]

J.H. Redfield. The Theory of Group - Reduced Distributions. American J. Math., 49:433 - 455, 1927.

 [42]

C.C. Sims. Computation with Permutation Groups. In S.R. Petrick, editor, Proceedings of the Second Symposium on Symbolic and Algebraic Manipulation, pages 23 - 28. Assoc. Comput. Mach., 1971.

 [43]

D. Slepian. Some Further Theory of Group Codes. The Bell System Technical Journal, 39:1219 - 1252, 1960.

 [44]

SYMMETRICA. A program system devoted to representation theory, invariant theory and combinatorics of finite symmetric groups and related classes of groups. Copyright by "Lehrstuhl II für Mathematik, Universität Bayreuth, 95440 Bayreuth". Distributed via anonymous ftp 132.180.16.20 in dist/SYM.tar.Z.

 [45]

M. Wild. Enumeration of binary and ternary matroids and other applications of the Brylawski-Lucas-Theorem. Preprint 1693, Technische Hochschule Darmstadt, November 1994.

 [46]

M. Wild. Consequences of the Brylawski-Lucas-Theorem for Binary Matroids. Europ. J. Combinatorics, 17:309-316, 1996.

Graz, January 23, 2001

References