Optimal frames for erasures.
type: Item
instance of: scholarly article
title: Optimal frames for erasures.
zbMATH Open document ID: 1042.46009
author: R. B. Holmes
author: Vern I. Paulsen
published in: Linear Algebra and its Applications
publication date: 2004-01-14T00:00:00Z
review text: A numerical measure of how well a frame reconstructs vectors when some of the frame coefficients of a vector are lost is introduced. Then the frames that are optimal in this setting are classified. Applications are in coding theory.
Mathematics Subject Classification ID: 42C15
Mathematics Subject Classification ID: 47A20
Mathematics Subject Classification ID: 94A29
zbMATH DE Number: 2026886
zbMATH Keywords: frame
zbMATH Keywords: erasures
reviewed by: Joe Howard
MaRDI profile type: Publication
full work available at URL: j.laa.2003.07.012
OpenAlex ID: W2072565885
cites work: SYMMETRIC HADAMARD MATRICES OF ORDER 36
cites work: Equal-norm tight frames with erasures
cites work: Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
cites work: Q4219187
cites work: Finite normalized tight frames
cites work: Quantized frame expansions with erasures
cites work: Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
cites work: The Pythagorean Theorem: I. The finite case
cites work: Q4121914
cites work: Grassmannian frames with applications to coding and communication
DOI: 10.1016/J.LAA.2003.07.012
description: scientific article; zbMATH DE number 2026886