3 search results - page 1 / 1 » DFT-based Word Normalization in Finite Supersolvable Groups |
74
Voted
AAECC
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of th...
72
Voted
GC
2006
Springer
14 years 10 months ago
2006
Springer
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
90
Voted
SIAMDM
2008
14 years 10 months ago
2008
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...