Sciweavers

199 search results - page 20 / 40
» Linear time encodable and list decodable codes
Sort
View
TIT
1998
81views more  TIT 1998»
14 years 11 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
CORR
2006
Springer
112views Education» more  CORR 2006»
14 years 11 months ago
Lossless coding for distributed streaming sources
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
Cheng Chang, Stark C. Draper, Anant Sahai
IMA
1995
Springer
97views Cryptology» more  IMA 1995»
15 years 3 months ago
A New Algorithm for Finding Minimum-Weight Words in Large Linear Codes
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
Anne Canteaut
DCC
2009
IEEE
16 years 8 days ago
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
Shirin Jalali, Andrea Montanari, Tsachy Weissman
TIT
2002
98views more  TIT 2002»
14 years 11 months ago
DC-free binary convolutional coding
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
Tadashi Wadayama, A. J. Han Vinck