On the refinement of the binary symmetric markov source

Luis Lastras; Toby Berger

doi:10.1109/ISIT.2001.936058

IEEE International Symposium on Information Theory - Proceedings

Paper

01 Jan 2001

On the refinement of the binary symmetric markov source

View publication

Abstract

The BSMSn source is addressed in this study. It is shown that BSMSn is not successively refinable under the Hamming distortion measure, provided that n > 2.

Paper

Joint spectral radius and path-complete graph Lyapunov functions

Amir Ali Ahmadi, Raphaël M. Jungers, et al.

SICON

Paper

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription

Shashanka Ubaru, Lior Horesh, et al.

Journal of Biomedical Informatics

Conference paper

QoS support for media broadcast in a services oriented architecture

D.S. Turaga, K. Ratakonda, et al.

SCC 2006

Paper

Bonsai trees, or how to delegate a lattice basis

David Cash, Dennis Hofheinz, et al.

Journal of Cryptology

View all publications

Abstract

Related

Joint spectral radius and path-complete graph Lyapunov functions

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription

QoS support for media broadcast in a services oriented architecture

Bonsai trees, or how to delegate a lattice basis