Sciweavers

199 search results - page 10 / 40
» Linear time encodable and list decodable codes
Sort
View
DATESO
2010
286views Database» more  DATESO 2010»
13 years 5 months ago
Fast Fibonacci Encoding Algorithm
Abstract. Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups...
Jirí Walder, Michal Krátký, J...
GLOBECOM
2010
IEEE
13 years 5 months ago
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
Ahmed Badr, Ashish Khisti, Emin Martinian
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 7 months ago
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
K. Murali Krishnan, Priti Shankar
DCC
2005
IEEE
13 years 9 months ago
On the Performance of Linear Slepian-Wolf Codes for Correlated Stationary Memoryless Sources
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
Shengtian Yang, Peiliang Qiu
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 9 months ago
Corruption and Recovery-Efficient Locally Decodable Codes
A (q, , )-locally decodable code (LDC) C : {0, 1}n {0, 1}m is an encoding from n-bit strings to m-bit strings such that each bit xk can be recovered with probability at least 1 2 +...
David P. Woodruff