Real, tight frames with maximal robustness to erasures

Markus Püschel, Jelena Kovacevic

Research output: Contribution to journalConference article

Abstract

Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We approach the problem in steps: we first construct maximally robust frames by using polynomial transforms. We then add tightness as an additional property with the help of orthogonal polynomials. Finally, we impose the last requirement of equal norm and construct, to our best knowledge, the first real, tight, equal-norm frames maximally robust to erasures.

Original languageEnglish (US)
Pages (from-to)63-72
Number of pages10
JournalData Compression Conference Proceedings
StatePublished - Oct 26 2005
EventDCC 2005: Data Compression Conference - Snowbird, UT, United States
Duration: Mar 29 2005Mar 31 2005

Fingerprint

Polynomials
Internet

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Real, tight frames with maximal robustness to erasures. / Püschel, Markus; Kovacevic, Jelena.

In: Data Compression Conference Proceedings, 26.10.2005, p. 63-72.

Research output: Contribution to journalConference article

@article{a8f38e588c934248a7d642ecea3b5ab5,
title = "Real, tight frames with maximal robustness to erasures",
abstract = "Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We approach the problem in steps: we first construct maximally robust frames by using polynomial transforms. We then add tightness as an additional property with the help of orthogonal polynomials. Finally, we impose the last requirement of equal norm and construct, to our best knowledge, the first real, tight, equal-norm frames maximally robust to erasures.",
author = "Markus P{\"u}schel and Jelena Kovacevic",
year = "2005",
month = "10",
day = "26",
language = "English (US)",
pages = "63--72",
journal = "Proceedings of the Data Compression Conference",
issn = "1068-0314",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Real, tight frames with maximal robustness to erasures

AU - Püschel, Markus

AU - Kovacevic, Jelena

PY - 2005/10/26

Y1 - 2005/10/26

N2 - Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We approach the problem in steps: we first construct maximally robust frames by using polynomial transforms. We then add tightness as an additional property with the help of orthogonal polynomials. Finally, we impose the last requirement of equal norm and construct, to our best knowledge, the first real, tight, equal-norm frames maximally robust to erasures.

AB - Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We approach the problem in steps: we first construct maximally robust frames by using polynomial transforms. We then add tightness as an additional property with the help of orthogonal polynomials. Finally, we impose the last requirement of equal norm and construct, to our best knowledge, the first real, tight, equal-norm frames maximally robust to erasures.

UR - http://www.scopus.com/inward/record.url?scp=26944488694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26944488694&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:26944488694

SP - 63

EP - 72

JO - Proceedings of the Data Compression Conference

JF - Proceedings of the Data Compression Conference

SN - 1068-0314

ER -