Sciweavers

362 search results - page 57 / 73
» On Bounded-Weight Error-Correcting Codes
Sort
View
IJNSEC
2007
118views more  IJNSEC 2007»
14 years 9 months ago
Code-based Ring Signature Scheme
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
Dong Zheng, Xiangxue Li, Kefei Chen
SP
2008
IEEE
14 years 9 months ago
Predictable Design of Network-Based Covert Communication Systems
This paper presents a predictable and quantifiable approach to designing a covert communication system capable of effectively exploiting covert channels found in the various layer...
Ronald William Smith, George Scott Knight
IOLTS
2005
IEEE
125views Hardware» more  IOLTS 2005»
15 years 3 months ago
Design of a Self Checking Reed Solomon Encoder
— In this paper, an innovative self-checking Reed Solomon encoder architecture is described. The presented architecture exploits some properties of the arithmetic operations in G...
Gian-Carlo Cardarilli, Salvatore Pontarelli, Marco...
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...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 4 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...