Abstract
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
J.D. Dixon and H.S. Wilf, The random selection of unlabeled graphs, Journal of Algorithms, Vol. 4 (1983) pp. 205 - 213.
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.
H. Fripertinger, Zyklenzeiger linearer Gruppen und Abzählung linearer Codes, Séminaire Lotharingien de Combinatoire, Vol. 33 (1995) pp. 1 - 10.
H. Fripertinger, Enumeration of Linear Codes by Applying Methods from Algebraic Combinatorics, Grazer Math. Berichte, Vol. 328 (1996) pp. 31 - 42.
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–204.
R. Grund, Symmetrieklassen von Abbildungen und die Konstruktion von diskreten Strukturen, Bayreuther Mathematische Schriften, Vol. 31 (1990) pp. 19 - 54.
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.
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.
A. Kerber, Anwendungsorientierte Theorie endlicher Strukturen, To be published.
A. Kerber, Der Zykelindex der Exponentialgruppe, Mitteilungen aus dem Mathematischen Seminar Giessen, Vol. 98 (1973) pp. 5 - 20.
A. Kerber, Algebraic Combinatorics via Finite Group Actions, B.I.Wissenschaftsverlag, Mannheim,Wien, Zürich (1991).
A. Kerber, Algebraic Combinatorics in Bayreuth, Séminaire Lotharingien de Combinatoire, B34j (1995). http://cartan.u-strasbg.fr/ slc//divers/../wpapers/s34bayreuth.html.
H. Lehmann, Das Abzähltheorem der Exponentialgruppe in gewichteter Form, Mitteilungen aus dem Mathem. Seminar Giessen, Vol. 112 (1974) pp. 19 - 33.
H. Lehmann, Ein vereinheitlichender Ansatz für die REDFIELD-PÓLYA- de BRUIJNSCHE Abzähltheorie, PhD thesis, Universität Giessen (1976).
E.M. Palmer and R.W. Robinson, Enumeration under two representations of the wreath product, Acta Mathematica, Vol. 131 (1973) pp. 123 - 143.
E.M. Palmer and Robinson R.W., The matrix group of two permutation groups, Bull. Amer. Math. Soc., Vol. 73 (1967) pp. 204 - 207.
G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, Vol. 68 (1937) pp. 145 - 254.
R.C. Read, Every one a winner, Ann. Discrete Mathematics, Vol. 2 (1978) pp. 107 - 120.
C.C. Sims, Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra, (1970) pp. 169 - 183.
D. Slepian, On the Number of Symmetry Types of Boolean Functions of nVariables, Canad. J. Math., Vol. 5 (1953) pp. 185 - 193.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fripertinger, H. Enumeration, Construction and Random Generation of Block Codes. Designs, Codes and Cryptography 14, 213–219 (1998). https://doi.org/10.1023/A:1008248618779
Issue Date:
DOI: https://doi.org/10.1023/A:1008248618779