The use of the Barankin bound for determining the threshold SNR in estimating the bearing of a source in the presence of another. - Ilan Reuven; Hagit Messer (ICASSP, 1995)

A multi-parameter hybrid Barankin-type bound. - Ilan Reuven; Hagit Messer (ICASSP, 1996)

A Barankin-type lower bound on the estimation error of a hybrid parameter vector. - Ilan Reuven; Hagit Messer (IEEE Trans. Inf. Theory, 1997)

Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes. - Ilan Reuven; Yair Be'ery (IEEE Trans. Inf. Theory, 1998)

On the Trellis Representation of the Delsarte-Goethals Codes. - Yaron Shany; Ilan Reuven; Yair Be'ery (IEEE Trans. Inf. Theory, 1998)

Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation. - Ilan Reuven; Yair Be'ery (IEEE Trans. Inf. Theory, 1999)

The weighted coordinates bound and trellis complexity of block codes and periodic packings. - Ilan Reuven; Yair Be'ery (IEEE Trans. Inf. Theory, 1999)

On the effect of nuisance parameters on the threshold SNR value of the Barankin bound. - Ilan Reuven; Hagit Messer (IEEE Trans. Signal Process., 1999)

Lower bounds on the state complexity of linear tail-biting trellises. - Yaron Shany; Ilan Reuven; Yair Be'ery (IEEE Trans. Inf. Theory, 2004)

A fast convergence algorithm for echo cancellers in full duplex transmission using back projection from slicer. - Danny Stopler; Ilan Reuven (IEEE Trans. Signal Process., 2005)