Sciweavers

400 search results - page 17 / 80
» codes 2001
Sort
View
DCC
2001
IEEE
15 years 9 months ago
Bounds for the Multicovering Radii of Reed-Muller Codes with Applications to Stream Ciphers
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
Iiro S. Honkala, Andrew Klapper
NIPS
2001
14 years 11 months ago
Information-Geometrical Significance of Sparsity in Gallager Codes
We report a result of perturbation analysis on decoding error of the belief propagation decoder for Gallager codes. The analysis is based on information geometry, and it shows tha...
Toshiyuki Tanaka, Shiro Ikeda, Shun-ichi Amari
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
15 years 2 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
ICSE
2001
IEEE-ACM
15 years 2 months ago
Architecture-Oriented Programming Using FRED
Implementing application-specific code conforming to architectural rules and conventions can be tedious. FRED is a tool prototype for architecture-oriented programming that takes ...
Markku Hakala, Juha Hautamäki, Kai Koskimies,...
70
Voted
WEWORC
2007
132views Cryptology» more  WEWORC 2007»
14 years 10 months ago
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
Léonard Dallot