Sciweavers

124 search results - page 10 / 25
» tit 2002
Sort
View
TIT
2002
146views more  TIT 2002»
13 years 9 months ago
Bounds on the performance of belief propagation decoding
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
David Burshtein, Gadi Miller
TIT
2002
85views more  TIT 2002»
13 years 9 months ago
Parallel constrained coding with application to two-dimensional constraints
A parallel constrained coding scheme is considered where p-blocks of raw data are encoded simultaneously into q tracks such that the contents of each track belong to a given const...
Shirley Halevy, Ron M. Roth
TIT
2002
148views more  TIT 2002»
13 years 9 months ago
The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks
In this paper, we address the issue of performance of linear multiuser detectors for a multicasting application in an ad hoc wireless network. Using a code-division multiple-access...
Chandrasekar Sankaran, Anthony Ephremides
TIT
2002
63views more  TIT 2002»
13 years 9 months ago
Fibonacci and Galois representations of feedback-with-carry shift registers
Feedback with carry shift registers (FCSRs) are a class of finite state devices that are similar to linear feedback shift registers (LFSRs) in their simplicity and statistical ran...
Mark Goresky, Andrew Klapper
TIT
2002
129views more  TIT 2002»
13 years 9 months ago
Combinatorial bounds for list decoding
Abstract--Informally, an error-correcting code has "nice" listdecodability properties if every Hamming ball of "large" radius has a "small" number of ...
Venkatesan Guruswami, Johan Håstad, Madhu Su...