Loading [MathJax]/extensions/MathMenu.js
Benjamin Weiss - IEEE Xplore Author Profile
Subscribe
ADVANCED SEARCH

Author details

< Back

Benjamin Weiss

Also published under: B. Weiss

Publications
12
Citations
252
Publications by Year
19932013
Co-Authors:
Show All Co-Authors (6)
Headshot silhouette indicating that no photo is available for this author

Benjamin Weiss

Also published under: B. Weiss

Affiliation

Hebrew University of Jerusalem, Jerusalem, Israel

Publication Topics

Biography

Benjamin Weiss was born in 1941 and studied at Yeshiva University (BA, MA 1962) and at Princeton University (Ph.D.—1965 in mathematics) where his advisor was William Feller. He was a researcher at IBM Research in Yorktown Heights NY from 1965 until 1967. Since 1967 he has been at the Institute of Mathematics at the Hebrew University of Jerusalem in Jerusalem, Israel. His research interests include ergodic theory, probability theory, topological dynamics and information theory.(Based on document published on 14 June 2013).
Publications
12
Citations
252
Publications by Year
19932013
Co-Authors:
Show All Co-Authors (6)
Author's Published Works

Showing 1-12 of 12 results

  • Sort

Filter Results

Show

Sort By

Results

Universal Tests for Memory Words

Gusztáv Morvai;Benjamin Weiss

IEEE Transactions on Information Theory
Year: 2013 | Volume: 59, Issue: 10 | Journal Article |
Cited by: Papers (2)
The main result is a universal pointwise test that, when presented with a set of words S on a finite or countable alphabet X that purports to be a set of memory words for a stationary process, will eventually almost surely return the value YES precisely when all positive probability words in S are memory words. For example, if S consists of all of the single letters in X, then the test will eventu...Show More

Universal Tests for Memory Words

Gusztáv Morvai;Benjamin Weiss

Year: 2013 | Volume: 59, Issue: 10 | Journal Article |

Estimating the residual waiting time for binary stationary time series

Gusztav Morvai;Benjamin Weiss

2009 IEEE Information Theory Workshop on Networking and Information Theory
Year: 2009 | Conference Paper |
Cited by: Papers (2)
We present here a universal estimation scheme for the problem of estimating the residual waiting time until the next occurrence of a zero after observing the first n outputs of a stationary and ergodic binary process. The scheme will involve estimating only at carefully selected stopping times but will be almost surely consistent. In case the process happens to be a genuine renewal process then ou...Show More

Estimating the residual waiting time for binary stationary time series

Gusztav Morvai;Benjamin Weiss

Year: 2009 | Conference Paper |

Estimating the Lengths of Memory Words

GusztÁv Morvai;Benjamin Weiss

IEEE Transactions on Information Theory
Year: 2008 | Volume: 54, Issue: 8 | Journal Article |
Cited by: Papers (7)
For a stationary stochastic process {Xn} with values in some set A, a finite word w isin AK is called a memory word if the conditional probability of X 0 given the past is constant on the cylinder set defined by X - K -1=w . It is a called a minimal memory word if no proper suffix of w is also a memory word. For example in a K-step Markov processes all words of length K are memory words but not ne...Show More

Estimating the Lengths of Memory Words

GusztÁv Morvai;Benjamin Weiss

Year: 2008 | Volume: 54, Issue: 8 | Journal Article |

Order estimation of Markov chains

G. Morvai;B. Weiss

IEEE Transactions on Information Theory
Year: 2005 | Volume: 51, Issue: 4 | Journal Article |
Cited by: Papers (18)
Estimators /spl chi//sub n/(X/sub 0/, X/sub 1/, ..., X/sub n/), are described which, when applied to an unknown stationary process taking values from a countable alphabet /spl chi/, converge almost surely to k in case the process is a kth-order Markov chain and to infinity otherwise.Show More

Order estimation of Markov chains

G. Morvai;B. Weiss

Year: 2005 | Volume: 51, Issue: 4 | Journal Article |

Multiuser asynchronous SS/CDMA communication using dovetail constructed families of complex-valued spreading sequences

M. Haspel;I. Kalet;B. Weiss

IEEE Seventh International Symposium on Spread Spectrum Techniques and Applications,
Year: 2002 | Conference Paper |
This paper takes as point of departure a novel dovetail technique, previously developed, for constructing families of spreading sequences mutually orthogonal in the asynchronous sense. Any two members of the family have periodic cross-correlation values which are identically zero for all values of the shift index, obviating the need for mutual synchronization. Other methods achieve orthogonality b...Show More

Multiuser asynchronous SS/CDMA communication using dovetail constructed families of complex-valued spreading sequences

M. Haspel;I. Kalet;B. Weiss

Year: 2002 | Volume: 2 | Conference Paper |

Entropy and recurrence rates for stationary random fields

D. Ornstein;B. Weiss

IEEE Transactions on Information Theory
Year: 2002 | Volume: 48, Issue: 6 | Journal Article |
Cited by: Papers (17)
For a stationary random field {x(u): u /spl isin/ Z/sup d/}, the recurrence time R/sub n/(x) may be defined as the smallest positive k, such that the pattern {x(u): 0 /spl les/ u/sub i/ < n} is seen again, in a new position in the cube {0 /spl les/ |u/sub i/| < k}. In analogy with the case of d = 1, where the pioneering work was done by Wyner and Ziv (1989), we prove here that the asymptotic growt...Show More

Entropy and recurrence rates for stationary random fields

D. Ornstein;B. Weiss

Year: 2002 | Volume: 48, Issue: 6 | Journal Article |

Dovetail construction of families of complex-valued spreading sequences with asynchronous orthogonality for SS/CDMA

M. Haspel;B. Weiss

2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No.00TH8536)
Year: 2000 | Conference Paper |
Cited by: Papers (2)
This paper describes a novel dovetail technique for constructing families of spreading sequences for SS/CDMA which are mutually orthogonal in the asynchronous sense. That is, any two members of the family have periodic crosscorrelation values which are identically zero for all values of the shift index, obviating the need for mutual synchronization. Our goal is to improve the crosscorrelation prop...Show More

Dovetail construction of families of complex-valued spreading sequences with asynchronous orthogonality for SS/CDMA

M. Haspel;B. Weiss

Year: 2000 | Volume: 2 | Conference Paper |

Correlation and unbalance properties of spectrally sifted collimated sequences

M. Haspel;B. Weiss

1998 IEEE 5th International Symposium on Spread Spectrum Techniques and Applications - Proceedings. Spread Technology to Africa (Cat. No.98TH8333)
Year: 1998 | Conference Paper |
Cited by: Papers (1)
The construction of collections of pseudorandom binary sequences whose elements are chosen from the set (1, -1) and which have "noiselike" properties remains an important issue in spread spectrum communications systems and the search for such sequences may be methodically attacked armed with a spectral approach. Along these lines a reasonable conjecture is that the flatness of the sequence spectru...Show More

Correlation and unbalance properties of spectrally sifted collimated sequences

M. Haspel;B. Weiss

Year: 1998 | Volume: 1 | Conference Paper |

Universal redundancy rates for the class of B-processes do not exist

P. Shields;B. Weiss

IEEE Transactions on Information Theory
Year: 1995 | Volume: 41, Issue: 2 | Journal Article |
Cited by: Papers (6)
Shows that for any sequence /spl rho/(n)=o(n) and any sequence of prefix codes, there is a B-process of entropy arbitrarily close to the maximum possible entropy for which the expected redundancy is at least as large as /spl rho/(n) for infinitely many n. This extends work of Shields (1993), whose examples had O entropy. The class of B-processes, that is, stationary codings of independent and iden...Show More

Universal redundancy rates for the class of B-processes do not exist

P. Shields;B. Weiss

Year: 1995 | Volume: 41, Issue: 2 | Journal Article |

Universal redundancy rates for B-processes do not exist

A. Shields;B. Weiss

Proceedings of 1994 IEEE International Symposium on Information Theory
Year: 1994 | Conference Paper |
Cited by: Papers (2)
Shows that for any sequence /spl rho/(n)=o(n) and any sequence of prefix codes, there is a B-process of entropy arbitrarily close to the maximum possible entropy for which the expected redundancy is at least as large as /spl rho/(n) for infinitely many n. This extends earlier work of the first author, whose examples had 0 entropy, [Shields, 1993]. The class of B-processes, that is, stationary codi...Show More

Universal redundancy rates for B-processes do not exist

A. Shields;B. Weiss

Year: 1994 | Conference Paper |

Entropy and recurrence rates for stationary random fields

D. Ornstein;B. Weiss

Proceedings of 1994 IEEE International Symposium on Information Theory
Year: 1994 | Conference Paper |
Cited by: Papers (1)
The entropy of a stationary multidimensional array of random variables is related to the rate of recurrence of the patterns that are seen in the center of the array. The results give the possibility of calculating the entropy of a (stochastic) process from a single set of observations without computation of probabilities.<>Show More

Entropy and recurrence rates for stationary random fields

D. Ornstein;B. Weiss

Year: 1994 | Conference Paper |

Entropy and data compression schemes

D.S. Ornstein;B. Weiss

IEEE Transactions on Information Theory
Year: 1993 | Volume: 39, Issue: 1 | Journal Article |
Cited by: Papers (194)
Some new ways of defining the entropy of a process by observing a single typical output sequence as well as a new kind of Shannon-McMillan-Breiman theorem are presented. This provides a new and conceptually very simple ways of estimating the entropy of an ergodic stationary source as well as new insight into the workings of such well-known data compression schemes as the Lempel-Ziv algorithm.<>Show More

Entropy and data compression schemes

D.S. Ornstein;B. Weiss

Year: 1993 | Volume: 39, Issue: 1 | Journal Article |

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.