2009 |
24 | EE | Idan Goldenberg,
David Burshtein:
Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming
CoRR abs/0904.1692: (2009) |
2008 |
23 | EE | Idan Goldenberg,
David Burshtein:
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC
CoRR abs/0803.2460: (2008) |
22 | EE | Amir Bennatan,
David Burshtein:
On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel.
IEEE Transactions on Information Theory 54(1): 100-115 (2008) |
21 | EE | David Burshtein:
On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm.
IEEE Transactions on Information Theory 54(2): 517-530 (2008) |
20 | EE | Alba Sloin,
David Burshtein:
Support Vector Machine Training for Improved Hidden Markov Modeling.
IEEE Transactions on Signal Processing 56(1): 172-188 (2008) |
2007 |
19 | EE | Hagai Aronowitz,
David Burshtein:
Efficient Speaker Recognition Using Approximated Cross Entropy (ACE).
IEEE Transactions on Audio, Speech & Language Processing 15(7): 2033-2043 (2007) |
18 | EE | Ohad Barak,
David Burshtein:
Lower Bounds on the Error Rate of LDPC Code Ensembles.
IEEE Transactions on Information Theory 53(11): 4225-4236 (2007) |
17 | EE | S. Freundlich,
David Burshtein,
Simon Litsyn:
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity.
IEEE Transactions on Information Theory 53(4): 1484-1494 (2007) |
2006 |
16 | EE | Amir Bennatan,
David Burshtein:
On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel
CoRR abs/cs/0610021: (2006) |
15 | EE | Amir Bennatan,
David Burshtein:
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels.
IEEE Transactions on Information Theory 52(2): 549-583 (2006) |
14 | EE | Amir Bennatan,
David Burshtein,
Giuseppe Caire,
Shlomo Shamai:
Superposition coding for side-information channels.
IEEE Transactions on Information Theory 52(5): 1872-1889 (2006) |
2005 |
13 | EE | Amir Bennatan,
David Burshtein:
Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels
CoRR abs/cs/0511040: (2005) |
2004 |
12 | EE | Hagai Aronowitz,
David Burshtein,
Amihood Amir:
Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation.
MLMI 2004: 243-252 |
11 | | Amir Bennatan,
David Burshtein:
On the application of LDPC codes to arbitrary discrete-memoryless channels.
IEEE Transactions on Information Theory 20(3): 417-438 (2004) |
10 | | Ohad Barak,
David Burshtein,
Meir Feder:
Bounds on achievable rates of LDPC codes used over the binary erasure channel.
IEEE Transactions on Information Theory 50(10): 2483-2492 (2004) |
9 | | David Burshtein,
Gadi Miller:
An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel.
IEEE Transactions on Information Theory 50(11): 2837-2844 (2004) |
8 | | David Burshtein,
Gadi Miller:
Asymptotic Enumeration Methods for Analyzing LDPC Codes.
IEEE Transactions on Information Theory 50(6): 1115-1131 (2004) |
2002 |
7 | | David Burshtein,
Gadi Miller:
Bounds on the performance of belief propagation decoding.
IEEE Transactions on Information Theory 48(1): 112-122 (2002) |
6 | | David Burshtein,
Michael Krivelevich,
Simon Litsyn,
Gadi Miller:
Upper bounds on the rate of LDPC Codes.
IEEE Transactions on Information Theory 48(9): 2437-2449 (2002) |
2001 |
5 | | David Burshtein,
Gadi Miller:
Expander graph arguments for message-passing algorithms.
IEEE Transactions on Information Theory 47(2): 782-790 (2001) |
4 | | Gadi Miller,
David Burshtein:
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes.
IEEE Transactions on Information Theory 47(7): 2696-2710 (2001) |
1998 |
3 | | David Burshtein:
Typical Error Pattern Recovery of the Hopfield Memory under Error-Tolerant Conditions.
IEEE Transactions on Information Theory 44(2): 861-865 (1998) |
2 | EE | David Burshtein:
Long-term attraction in higher order neural networks.
IEEE Transactions on Neural Networks 9(1): 42-50 (1998) |
1994 |
1 | | David Burshtein:
Nondirect convergence radius and number of iterations of the Hopfield associative memory.
IEEE Transactions on Information Theory 40(3): 838-847 (1994) |