Sciweavers

199 search results - page 14 / 40
» Linear time encodable and list decodable codes
Sort
View
CORR
2007
Springer
146views Education» more  CORR 2007»
13 years 7 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
ICC
2009
IEEE
14 years 2 months ago
Random Linear Network Coding for Time Division Duplexing: Energy Analysis
—We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and rece...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
SPIRE
1999
Springer
13 years 11 months ago
Linear Time Sorting of Skewed Distributions
This work presents an e cient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows th...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
ICALP
2005
Springer
14 years 27 days ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf