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 language | English (US) |
---|---|
Pages (from-to) | 63-72 |
Number of pages | 10 |
Journal | Data Compression Conference Proceedings |
State | Published - 2005 |
Event | DCC 2005: Data Compression Conference - Snowbird, UT, United States Duration: Mar 29 2005 → Mar 31 2005 |
ASJC Scopus subject areas
- Computer Networks and Communications