Sciweavers

TIT
2002
99views more  TIT 2002»
13 years 11 months ago
Poisson intensity estimation for tomographic data using a wavelet shrinkage approach
We consider a two-dimensional problem of positron emission tomography where the random mechanism of the generation of the tomographic data is modeled by Poisson processes. The goa...
L. Cavalier, Ja-Yong Koo
TIT
2002
146views more  TIT 2002»
13 years 11 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
89views more  TIT 2002»
13 years 11 months ago
Upper bounds on the rate of LDPC Codes
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
David Burshtein, Michael Krivelevich, Simon Litsyn...
TIT
2002
67views more  TIT 2002»
13 years 11 months ago
Some new results for optimal ternary linear codes
Iliya Bouyukliev, Juriaan Simonis
TIT
2002
75views more  TIT 2002»
13 years 11 months ago
Iterative multiuser joint decoding: Unified framework and asymptotic analysis
We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algor...
Joseph Boutros, Giuseppe Caire
TIT
2002
102views more  TIT 2002»
13 years 11 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
TIT
2002
72views more  TIT 2002»
13 years 11 months ago
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
Charles H. Bennett, Peter W. Shor, John A. Smolin,...
TIT
2002
76views more  TIT 2002»
13 years 11 months ago
Error exponents of expander codes
Alexander Barg, Gilles Zémor
TIT
2002
108views more  TIT 2002»
13 years 11 months ago
Bounds on packings of spheres in the Grassmann manifold
We derive the Gilbert
Alexander Barg, Dmitry Yu. Nogin
TIT
2002
62views more  TIT 2002»
13 years 11 months ago
Random codes: Minimum distances and error exponents
Abstract--Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code ensemble an...
Alexander Barg, G. David Forney Jr.