Sciweavers

60 search results - page 8 / 12
» On the Hardness of Decoding the Gale-Berlekamp Code
Sort
View
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
15 years 10 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
SPAA
2009
ACM
15 years 10 months ago
Classifying peer-to-peer network coding schemes
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
Christian Ortolf, Christian Schindelhauer, Arne Va...
IACR
2011
82views more  IACR 2011»
13 years 9 months ago
Wild McEliece Incognito
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
67
Voted
ICIP
2006
IEEE
15 years 11 months ago
Dependency Channel Modeling for a LDPC-Based Wyner-Ziv Video Compression Scheme
Research in distributed video coding for low complexity encoding has shown that without knowledge of the correlation between source and side information (i.e. the behavior of the ...
Ronald P. Westerlaken, Stefan Borchert, Rene Klein...
TSP
2008
95views more  TSP 2008»
14 years 9 months ago
Pilotless Frame Synchronization for LDPC-Coded Transmission Systems
Abstract--We present a pilotless frame synchronization approach that exploits feedback from a low-density parity-check (LDPC) code decoder. The synchronizer is based on syndrome ch...
Dong-U Lee, Hyungjin Kim, Christopher R. Jones, Jo...