Sciweavers

124
Voted
AAECC
2009
Springer
150views Algorithms» more  AAECC 2009»
15 years 7 months ago
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new searc...
Víctor Álvarez, José Á...
82
Voted
AAECC
2009
Springer
142views Algorithms» more  AAECC 2009»
15 years 4 months ago
New Commutative Semifields and Their Nuclei
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
Jürgen Bierbrauer
85
Voted
AAECC
2009
Springer
140views Algorithms» more  AAECC 2009»
15 years 1 months ago
Interesting Examples on Maximal Irreducible Goppa Codes
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...
Marta Giorgetti
85
Voted
AAECC
2009
Springer
138views Algorithms» more  AAECC 2009»
15 years 4 months ago
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki ...
103
Voted
AAECC
2009
Springer
136views Algorithms» more  AAECC 2009»
15 years 7 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...
Algorithms
Top of PageReset Settings