<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T06:26:53Z</responseDate>
  <request identifier="1884" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1884</identifier>
        <datestamp>2024-03-06T11:08:28Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>An open question on the existence of Gabor frames  in general linear position</dc:title>
          <dc:creator>Krahmer, Felix</dc:creator>
          <dc:creator>Pfander, Götz E.</dc:creator>
          <dc:creator>Rashkov, Peter</dc:creator>
          <dc:subject>Gabor systems</dc:subject>
          <dc:subject>erasure channels</dc:subject>
          <dc:subject>time--frequency dictionaries</dc:subject>
          <dc:subject>short--time Fourier transform</dc:subject>
          <dc:subject>uncertainty principle.</dc:subject>
          <dc:description>Uncertainty principles for functions defined on finite Abelian groups generally relate the cardinality of a function to the cardinality of its Fourier transform. We examine how  the cardinality of a function is related to the cardinality of its short--time Fourier transform.  We illustrate that for some cyclic groups of small order, both, the Fourier and the short--time Fourier case, show a remarkable resemblance. We pose the question whether this correspondence holds for all cyclic groups.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Felix Krahmer and Götz E. Pfander and Peter Rashkov</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.08492.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-18848</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
