Sciweavers

8 search results - page 1 / 2
» Idempotents in group algebras and minimal abelian codes
Sort
View
FFA
2007
59views more  FFA 2007»
13 years 5 months ago
Idempotents in group algebras and minimal abelian codes
Raul Antonio Ferraz, César Polcino Milies
CIE
2010
Springer
13 years 5 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
CRYPTO
2005
Springer
127views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
Ronald Cramer, Serge Fehr, Martijn Stam
AAECC
2009
Springer
136views Algorithms» more  AAECC 2009»
13 years 12 months ago
There Are Not Non-obvious Cyclic Affine-invariant Codes
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
José Joaquín Bernal, Ángel de...