IEEE International Symposium on Information Theory - Proceedings

Jorge F. Silva, Milan S. Derpich

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

The characterization of ℓp-compressible random sequences is revisited and extended to the case of stationary and ergodic processes. The main result of this work offers a simple-to-check necessary and sufficient condition for a stationary and ergodic sequence to be ℓp-compressible in the sense proposed by Amini, Unser and Marvasti [1, Def. 6]. Furthermore, for non ℓp-compressible random sequences, we provide a closed-form expression for the best k-term relative approximation error given a rate of coefficients as the block-length tends to infinity. © 2014 IEEE.
Original languageEnglish
Pages2654-2658
Number of pages5
DOIs
Publication statusPublished - 1 Jan 2014
Eventconference -
Duration: 1 Jan 2014 → …

Conference

Conferenceconference
Period1/01/14 → …

Fingerprint Dive into the research topics of 'IEEE International Symposium on Information Theory - Proceedings'. Together they form a unique fingerprint.

  • Cite this