{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:27Z","timestamp":1754161587650,"version":"3.41.2"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1023\/a:1008248618779","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"213-219","source":"Crossref","is-referenced-by-count":2,"title":["Enumeration, Construction and Random Generation of Block Codes"],"prefix":"10.1007","volume":"14","author":[{"given":"Harald","family":"Fripertinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"166115_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/jgt.3190030210","volume":"3","author":"C.J. Colbourn","year":"1979","unstructured":"C.J. Colbourn and R.C. Read, Orderly algorithms for generating restricted classes of graphs, Journal of Graph Theory, Vol. 3 (1979) pp. 187 - 195.","journal-title":"Journal of Graph Theory"},{"key":"166115_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0196-6774(83)90021-4","volume":"4","author":"J.D. Dixon","year":"1983","unstructured":"J.D. Dixon and H.S. Wilf, The random selection of unlabeled graphs, Journal of Algorithms, Vol. 4 (1983) pp. 205 - 213.","journal-title":"Journal of Algorithms"},{"key":"166115_CR3","first-page":"215","volume":"49","author":"H. Fripertinger","year":"1995","unstructured":"H. Fripertinger, Enumeration of isometry classes of linear (n, k)-codes over GF(q) in SYMMETRICA, Bayreuther Mathematische Schriften, Vol. 49 (1995) pp. 215 - 223.","journal-title":"Bayreuther Mathematische Schriften"},{"key":"166115_CR4","first-page":"1","volume":"33","author":"H. Fripertinger","year":"1995","unstructured":"H. Fripertinger, Zyklenzeiger linearer Gruppen und Abz\u00e4hlung linearer Codes, S\u00e9minaire Lotharingien de Combinatoire, Vol. 33 (1995) pp. 1 - 10.","journal-title":"S\u00e9minaire Lotharingien de Combinatoire"},{"key":"166115_CR5","first-page":"31","volume":"328","author":"H. Fripertinger","year":"1996","unstructured":"H. Fripertinger, Enumeration of Linear Codes by Applying Methods from Algebraic Combinatorics, Grazer Math. Berichte, Vol. 328 (1996) pp. 31 - 42.","journal-title":"Grazer Math. Berichte"},{"key":"166115_CR6","doi-asserted-by":"crossref","unstructured":"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, Springer (1995) pp. 194\u2013204.","DOI":"10.1007\/3-540-60114-7_15"},{"key":"166115_CR7","first-page":"19","volume":"31","author":"R. Grund","year":"1990","unstructured":"R. Grund, Symmetrieklassen von Abbildungen und die Konstruktion von diskreten Strukturen, Bayreuther Mathematische Schriften, Vol. 31 (1990) pp. 19 - 54.","journal-title":"Bayreuther Mathematische Schriften"},{"key":"166115_CR8","doi-asserted-by":"crossref","unstructured":"M.A. Harrison, Counting Theorems and their Applications to Switching Theory, In A. Mukhopadyay, editor, Recent Developments in Switching Functions, chapter 4, Academic Press (1971) pp. 85 - 120.","DOI":"10.1016\/B978-0-12-509850-2.50009-9"},{"key":"166115_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0021-9800(68)80008-0","volume":"4","author":"M.A. Harrison","year":"1968","unstructured":"M.A. Harrison and R.G. High, On the Cycle Index of a Product of Permutation Groups, Journal of Combinatorial Theory, Vol. 4 (1968) pp. 277 - 299.","journal-title":"Journal of Combinatorial Theory"},{"key":"166115_CR10","unstructured":"A. Kerber, Anwendungsorientierte Theorie endlicher Strukturen, To be published."},{"key":"166115_CR11","first-page":"5","volume":"98","author":"A. Kerber","year":"1973","unstructured":"A. Kerber, Der Zykelindex der Exponentialgruppe, Mitteilungen aus dem Mathematischen Seminar Giessen, Vol. 98 (1973) pp. 5 - 20.","journal-title":"Mitteilungen aus dem Mathematischen Seminar Giessen"},{"key":"166115_CR12","volume-title":"Algebraic Combinatorics via Finite Group Actions","author":"A. Kerber","year":"1991","unstructured":"A. Kerber, Algebraic Combinatorics via Finite Group Actions, B.I.Wissenschaftsverlag, Mannheim,Wien, Z\u00fcrich (1991)."},{"key":"166115_CR13","unstructured":"A. Kerber, Algebraic Combinatorics in Bayreuth, S\u00e9minaire Lotharingien de Combinatoire, B34j (1995). http:\/\/cartan.u-strasbg.fr\/ slc\/\/divers\/..\/wpapers\/s34bayreuth.html."},{"key":"166115_CR14","first-page":"19","volume":"112","author":"H. Lehmann","year":"1974","unstructured":"H. Lehmann, Das Abz\u00e4hltheorem der Exponentialgruppe in gewichteter Form, Mitteilungen aus dem Mathem. Seminar Giessen, Vol. 112 (1974) pp. 19 - 33.","journal-title":"Mitteilungen aus dem Mathem. Seminar Giessen"},{"key":"166115_CR15","unstructured":"H. Lehmann, Ein vereinheitlichender Ansatz f\u00fcr die REDFIELD-P\u00d3LYA- de BRUIJNSCHE Abz\u00e4hltheorie, PhD thesis, Universit\u00e4t Giessen (1976)."},{"key":"166115_CR16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02392038","volume":"131","author":"E.M. Palmer","year":"1973","unstructured":"E.M. Palmer and R.W. Robinson, Enumeration under two representations of the wreath product, Acta Mathematica, Vol. 131 (1973) pp. 123 - 143.","journal-title":"Acta Mathematica"},{"key":"166115_CR17","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1090\/S0002-9904-1967-11680-X","volume":"73","author":"E.M. Palmer","year":"1967","unstructured":"E.M. Palmer and Robinson R.W., The matrix group of two permutation groups, Bull. Amer. Math. Soc., Vol. 73 (1967) pp. 204 - 207.","journal-title":"Bull. Amer. Math. Soc."},{"key":"166115_CR18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","volume":"68","author":"G. P\u00f3lya","year":"1937","unstructured":"G. P\u00f3lya, Kombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, Vol. 68 (1937) pp. 145 - 254.","journal-title":"Acta Mathematica"},{"key":"166115_CR19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R.C. Read","year":"1978","unstructured":"R.C. Read, Every one a winner, Ann. Discrete Mathematics, Vol. 2 (1978) pp. 107 - 120.","journal-title":"Ann. Discrete Mathematics"},{"key":"166115_CR20","doi-asserted-by":"crossref","unstructured":"C.C. Sims, Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra, (1970) pp. 169 - 183.","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"key":"166115_CR21","doi-asserted-by":"crossref","first-page":"185","DOI":"10.4153\/CJM-1953-020-x","volume":"5","author":"D. Slepian","year":"1953","unstructured":"D. Slepian, On the Number of Symmetry Types of Boolean Functions of nVariables, Canad. J. Math., Vol. 5 (1953) pp. 185 - 193.","journal-title":"Canad. J. Math."},{"key":"166115_CR22","unstructured":"SYMMETRICA, A program system devoted to representation theory, invariant theory and combinatorics of finite symmetric groups and related classes of groups, Copyright by \u201dLehrstuhl II f\u00fcr Mathematik, Universit\u00e4t Bayreuth, 95440 Bayreuth,\u201d Distributed via anonymous ftp 132.180.16.20 in dist\/SYM.tar.Z."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008248618779.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008248618779\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008248618779.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:56:20Z","timestamp":1753761380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008248618779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["166115"],"URL":"https:\/\/doi.org\/10.1023\/a:1008248618779","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}