<?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-26T03:03:06Z</responseDate>
  <request identifier="18875" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:18875</identifier>
        <datestamp>2024-03-06T11:02:48Z</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>A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble</dc:title>
          <dc:creator>Guruswami, Venkatesan</dc:creator>
          <dc:creator>Li, Shilun</dc:creator>
          <dc:subject>Algebraic codes</dc:subject>
          <dc:subject>Pseudorandomness</dc:subject>
          <dc:subject>Explicit Construction</dc:subject>
          <dc:subject>Wozencraft Ensemble</dc:subject>
          <dc:subject>Sidon Sets</dc:subject>
          <dc:description>We present an explicit construction of a sequence of rate 1/2 Wozencraft ensemble codes (over any fixed finite field 𝔽_q) that achieve minimum distance Ω(√k) where k is the message length. The coefficients of the Wozencraft ensemble codes are constructed using Sidon Sets and the cyclic structure of 𝔽_{q^k} where k+1 is prime with q a primitive root modulo k+1. Assuming Artin’s conjecture, there are infinitely many such k for any prime power q.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Venkatesan Guruswami and Shilun Li</dc:contributor>
          <dc:date>2023</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)</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/LIPIcs.APPROX/RANDOM.2023.50</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-188751</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.50</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>
