On some deterministic dictionaries supporting sparsity

Simple item page
dc.creatorGurevich, Shamgar
dc.creatorHadani, Ronny
dc.creatorSochen, Nir
dc.date2008-08-09
dc.date2008-12-27
dc.date.accessioned2026-07-07T12:22:28Z
dc.date.available2026-07-07T12:22:28Z
dc.descriptionWe describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups. The oscillator dictionary consists of order of p^5 unit vectors in a Hilbert space of dimension p, where p is an odd prime, whose pairwise inner products have magnitude of at most 4/sqrt(p). An explicit algorithm to construct a large portion of the oscillator dictionary is presented.
dc.descriptionAccepted for publication in the special issue on sparsity (Editors: Albert Cohen, Ronald DeVore, Michael Elad, Anna Gilbert) of the Journal of Fourier Analysis and Applications (2008). Key words: Sparsity, deterministic dictionaries, low coherence, Weil representation, commutative subgroups, eigenfunctions, explicit algorithm
dc.identifierhttps://arxiv.org/abs/0808.1368
dc.identifierhttp://arxiv.org/abs/0808.1368
dc.identifierSpecial issue on sparsity, the Journal of Fourier Analysis and Applications, Vol. 14, 859-876, Dec. 2008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/213661
dc.subjectInformation Theory
dc.titleOn some deterministic dictionaries supporting sparsity
dc.typetext

Files

Collections

arXiv