Equal-norm tight frames with erasures

Peter G. Casazza, Jelena Kovacevic

Research output: Contribution to journalArticle

Abstract

Equal-norm tight frames have been shown to be useful for robust data transmission. The losses in the network are modeled as erasures of transmitted frame coefficients. We give the first systematic study of the general class of equal-norm tight frames and their properties. We search for efficient constructions of such frames. We show that the only equal-norm tight frames with the group structure and one or two generators are the generalized harmonic frames. Finally, we give a complete classification of frames in terms of their robustness to erasures.

Original languageEnglish (US)
Pages (from-to)387-430
Number of pages44
JournalAdvances in Computational Mathematics
Volume18
Issue number2-4
DOIs
StatePublished - Feb 1 2003

Fingerprint

Tight Frame
Data communication systems
Norm
Data Transmission
Harmonic
Generator
Robustness
Coefficient

Keywords

  • Frames
  • Robust Internet transmission

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Cite this

Equal-norm tight frames with erasures. / Casazza, Peter G.; Kovacevic, Jelena.

In: Advances in Computational Mathematics, Vol. 18, No. 2-4, 01.02.2003, p. 387-430.

Research output: Contribution to journalArticle

Casazza, Peter G. ; Kovacevic, Jelena. / Equal-norm tight frames with erasures. In: Advances in Computational Mathematics. 2003 ; Vol. 18, No. 2-4. pp. 387-430.
@article{3096a8219c7c4156a3c5a012460b8c2f,
title = "Equal-norm tight frames with erasures",
abstract = "Equal-norm tight frames have been shown to be useful for robust data transmission. The losses in the network are modeled as erasures of transmitted frame coefficients. We give the first systematic study of the general class of equal-norm tight frames and their properties. We search for efficient constructions of such frames. We show that the only equal-norm tight frames with the group structure and one or two generators are the generalized harmonic frames. Finally, we give a complete classification of frames in terms of their robustness to erasures.",
keywords = "Frames, Robust Internet transmission",
author = "Casazza, {Peter G.} and Jelena Kovacevic",
year = "2003",
month = "2",
day = "1",
doi = "10.1023/A:1021349819855",
language = "English (US)",
volume = "18",
pages = "387--430",
journal = "Advances in Computational Mathematics",
issn = "1019-7168",
publisher = "Springer Netherlands",
number = "2-4",

}

TY - JOUR

T1 - Equal-norm tight frames with erasures

AU - Casazza, Peter G.

AU - Kovacevic, Jelena

PY - 2003/2/1

Y1 - 2003/2/1

N2 - Equal-norm tight frames have been shown to be useful for robust data transmission. The losses in the network are modeled as erasures of transmitted frame coefficients. We give the first systematic study of the general class of equal-norm tight frames and their properties. We search for efficient constructions of such frames. We show that the only equal-norm tight frames with the group structure and one or two generators are the generalized harmonic frames. Finally, we give a complete classification of frames in terms of their robustness to erasures.

AB - Equal-norm tight frames have been shown to be useful for robust data transmission. The losses in the network are modeled as erasures of transmitted frame coefficients. We give the first systematic study of the general class of equal-norm tight frames and their properties. We search for efficient constructions of such frames. We show that the only equal-norm tight frames with the group structure and one or two generators are the generalized harmonic frames. Finally, we give a complete classification of frames in terms of their robustness to erasures.

KW - Frames

KW - Robust Internet transmission

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

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

U2 - 10.1023/A:1021349819855

DO - 10.1023/A:1021349819855

M3 - Article

AN - SCOPUS:0346494937

VL - 18

SP - 387

EP - 430

JO - Advances in Computational Mathematics

JF - Advances in Computational Mathematics

SN - 1019-7168

IS - 2-4

ER -