| 2005 |
|---|
| 7 | EE | Danny Stopler,
Ilan Reuven:
A fast convergence algorithm for echo cancellers in full duplex transmission using back projection from slicer.
IEEE Transactions on Signal Processing 53(4): 1534-1549 (2005) |
| 2004 |
|---|
| 6 | | Yaron Shany,
Ilan Reuven,
Yair Be'ery:
Lower bounds on the state complexity of linear tail-biting trellises.
IEEE Transactions on Information Theory 20(3): 566-571 (2004) |
| 1999 |
|---|
| 5 | | Ilan Reuven,
Yair Be'ery:
Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation.
IEEE Transactions on Information Theory 45(2): 713-720 (1999) |
| 4 | | Ilan Reuven,
Yair Be'ery:
The weighted coordinates bound and trellis complexity of block codes and periodic packings.
IEEE Transactions on Information Theory 45(5): 1658-1667 (1999) |
| 1998 |
|---|
| 3 | | Ilan Reuven,
Yair Be'ery:
Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes.
IEEE Transactions on Information Theory 44(2): 580-598 (1998) |
| 2 | | Yaron Shany,
Ilan Reuven,
Yair Be'ery:
On the Trellis Representation of the Delsarte-Goethals Codes.
IEEE Transactions on Information Theory 44(4): 1547-1554 (1998) |
| 1997 |
|---|
| 1 | | Ilan Reuven,
Hagit Messer:
A Barankin-type lower bound on the estimation error of a hybrid parameter vector.
IEEE Transactions on Information Theory 43(3): 1084-1093 (1997) |
