Sciweavers

TIT
2010
90views Education» more  TIT 2010»
13 years 2 months ago
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
Giacomo Como
MOC
1998
78views more  MOC 1998»
13 years 7 months ago
Factoring elementary groups of prime cube order into subsets
Let p be a prime and let G be the 3-fold direct product of the cyclic group of order p. R´edei conjectured if G is the direct product of subsets A and B, each of which contains th...
Sándor Szabó, Coburn Ward
COMBINATORICS
2006
113views more  COMBINATORICS 2006»
13 years 7 months ago
Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter
Let m be a positive integer whose smallest prime divisor is denoted by p, and let Zm denote the cyclic group of residues modulo m. For a set B = {x1, x2, . . . , xm} of m integers...
David J. Grynkiewicz, Rasheed Sabar
ISAAC
2009
Springer
108views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of ...
Li Chen, Bin Fu