Sciweavers

314 search results - page 13 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 8 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
ICPR
2010
IEEE
13 years 5 months ago
Beyond "Near Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
ICC
2008
IEEE
106views Communications» more  ICC 2008»
14 years 3 months ago
Lightweight Security for Network Coding
Abstract—Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different dat...
João P. Vilela, Luísa Lima, Jo&atild...
CORR
2007
Springer
108views Education» more  CORR 2007»
13 years 8 months ago
Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks
— The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is...
G. Susinder Rajan, B. Sundar Rajan
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 8 months ago
Distance distribution of binary codes and the error probability of decoding
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
Alexander Barg, Andrew McGregor