Sciweavers

IACR
2011
91views more  IACR 2011»
12 years 4 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
CODCRY
2011
Springer
242views Cryptology» more  CODCRY 2011»
12 years 8 months ago
Faster 2-Regular Information-Set Decoding
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 4 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 6 months ago
A Note About the Traceability Properties of Linear Codes
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
Marcel Fernandez, Josep Cotrina Navau, Miguel Sori...
GLOBECOM
2006
IEEE
13 years 10 months ago
Properties of Codes with the Rank Metric
In this paper, we study the rank distributions of linear codes. We give the analogous to the MacWilliams identity for the rank distributions of codes. The considerations of our pr...
Maximilien Gadouleau, Zhiyuan Yan