Poli, A.; Ventou, M. Codes autoduaux principaux et groupe d’automorphismes de l’algèbre \(A=F_{2^r}[X_1,-,X_n]/(X_1^2-1,-,X_n^2-1)\). (French) Zbl 0491.94017 Eur. J. Comb. 2, 179-183 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 Show Scanned Page Cited in 3 Documents MSC: 94B05 Linear codes (general theory) 20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures 20C05 Group rings of finite groups and their modules (group-theoretic aspects) Keywords:selfdual codes; ideals; group algebra; Reed-Muller-Codes; automorphism group; principal ideals PDFBibTeX XMLCite \textit{A. Poli} and \textit{M. Ventou}, Eur. J. Comb. 2, 179--183 (1981; Zbl 0491.94017) Full Text: DOI References: [1] Berman, L. S.D., Kibernetika, 3, 31-39 (1967) [2] Bourbaki, N., (Polynomes et Fractions Rationelles (1967), Corps Commutatifs: Corps Commutatifs Hermann, Paris) [3] Camion, P., (Difference Sets in Elementary Abelian Groups (1979), Presses de l’Université de Montreal: Presses de l’Université de Montreal Montreal) · Zbl 0455.94018 [4] Camion, P., (Etude de codes abéliens modulaires gutoduaux de petits longueurs (1979)), Rev. CETHEDEC no. spécial 2 · Zbl 0424.94009 [5] Poli, A., (Codes dans certaines algèbres modulaires (1978), Thèse de Doctorat en Sciences: Thèse de Doctorat en Sciences Université de Toulouse) [6] Van der Warden, B. L., (Modern Algebra (1966), Frederick Ungar: Frederick Ungar New York) [7] Warusfel, A., (Structures Algébriques Finies (1966), Hachette Université: Hachette Université Paris) [8] MacWilliams, F. J.; Sloane, N. J., (The Theory of Error Correcting Codes (1977), North-Holland: North-Holland Amsterdam) · Zbl 0369.94008 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.