论文信息 - Wedderburn decomposition of finite group algebras

Wedderburn decomposition of finite group algebras

We show a method to effectively compute the Wedderburn decomposition and the primitive central idempotents of a semisimple finite group algebra of an abelian-by-supersolvable group G from certain pairs of subgroups of G.

Ángel del Río | Osnel Broche

[1] R. James Milgram,et al. The Schur Subgroup of the Brauer Group , 1994 .

[2] Ángel del Río,et al. An algorithm to compute the primitive central idempotents and the Wedderburn decomposition of a rational group algebra , 2003, J. Symb. Comput..

[3] Eric Jespers,et al. CENTRAL IDEMPOTENTS IN THE RATIONAL GROUP ALGEBRA OF A FINITE NILPOTENT GROUP , 2003 .

[4] Monomial IdealsSerkan Ho. Monomial Ideals , 2001 .

[5] S. Berman. On the theory of group codes , 1967 .

[6] Vesselin Drensky,et al. Monomial Ideals, Group Algebras and Error Correcting Codes , 1988, AAECC.

[7] C. Rentería,et al. Reed‐muller codes: an ideal theory approach , 1997 .

[8] Andrei V. Kelarev. Error-correcting codes in group rings , 2000 .

[9] Juan Jacobo Simón,et al. On Monomial Characters and Central Idempotents of Rational Group Algebras , 2004 .

[10] Donald Passman,et al. Infinite Crossed Products , 1989 .

[11] Roberta Evans Sabin,et al. On Determining All Codes in Semi-Single Group Rings , 1993, AAECC.

[12] Roberta Evans Sabin,et al. Metacyclic error-correcting codes , 2005, Applicable Algebra in Engineering, Communication and Computing.