Ilan Reuven - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2005

A fast convergence algorithm for echo cancellers in full duplex transmission using back projection from slicerDanny Stopler, Ilan Reuven. tsp, 53(4):1534-1549, 2005. [doi]

2004

Lower bounds on the state complexity of linear tail-biting trellisesYaron Shany, Ilan Reuven, Yair Be ery. TIT, 20(3):566-571, 2004.

1999

The weighted coordinates bound and trellis complexity of block codes and periodic packingsIlan Reuven, Yair Be ery. TIT, 45(5):1658-1667, 1999.

Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z::4::-Linear RepresentationIlan Reuven, Yair Be ery. TIT, 45(2):713-720, 1999.

On the effect of nuisance parameters on the threshold SNR value of the Barankin boundIlan Reuven, Hagit Messer. tsp, 47(2):523-527, 1999. [doi]

1998

Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear CodesIlan Reuven, Yair Be ery. TIT, 44(2):580-598, 1998.

On the Trellis Representation of the Delsarte-Goethals CodesYaron Shany, Ilan Reuven, Yair Be ery. TIT, 44(4):1547-1554, 1998.

1997

A Barankin-type lower bound on the estimation error of a hybrid parameter vectorIlan Reuven, Hagit Messer. TIT, 43(3):1084-1093, 1997.

1996

A multi-parameter hybrid Barankin-type boundIlan Reuven, Hagit Messer. icassp 1996: 2483-2486 [doi]

1995

The use of the Barankin bound for determining the threshold SNR in estimating the bearing of a source in the presence of anotherIlan Reuven, Hagit Messer. icassp 1995: 1645-1648 [doi]

Sign in or sign up to see more results.

runs on WebDSL