94 search results - page 2 / 19 » Linear Systems over Finite Abelian Groups |
DCC
1998
IEEE
13 years 5 months ago
1998
IEEE
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
ICALP
2007
Springer
13 years 9 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
FSE
2006
Springer
13 years 9 months ago
2006
Springer
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...
DM
2010
13 years 5 months ago
2010
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let Dk(G) denote the smallest such that each sequence over G of l...