<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:mobile="http://www.google.com/schemas/sitemap-mobile/1.0" xmlns:pagemap="http://www.google.com/schemas/sitemap-pagemap/1.0" xmlns:xhtml="http://www.w3.org/1999/xhtml" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd">
  <url>
    <loc>https://zihanzhang.owlstown.net</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/projects</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/people</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/courses</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/posts</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/pages</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/cv</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/contact_form</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/53771-from-random-to-explicit-via-subspace-designs-with-applications-to-local-properties-and-matroids</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/53772-combinatorial-bounds-for-list-recovery-via-discrete-brascamp-lieb-inequalities</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/62217-explicit-rank-extractors-and-subspace-designs-via-function-fields-with-applications-to-strong-blocking-sets</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/34759-random-reed-solomon-codes-achieve-the-half-singleton-bound-for-insertions-and-deletions-over-linear-sized-alphabets</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/44945-unique-decoding-of-reed-solomon-and-related-codes-for-semi-adversarial-errors</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/37087-explicit-folded-reed-solomon-and-multiplicity-codes-achieve-relaxed-generalized-singleton-bounds</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/48108-gabidulin-codes-achieve-list-decoding-capacity-with-an-order-optimal-column-to-row-ratio</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/26037-ag-codes-achieve-list-decoding-capacity-over-constant-sized-fields</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/31647-random-gabidulin-codes-achieve-list-decoding-capacity-in-the-rank-metric</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/19599-randomly-punctured-reed-solomon-codes-achieve-the-list-decoding-capacity-over-polynomial-size-alphabets</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/publications/19582-a-new-metric-on-symmetric-groups-and-applications-to-block-permutation-codes</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/people/2573-untitled</loc>
  </url>
  <url>
    <loc>https://zihanzhang.owlstown.net/pages/3211-photography</loc>
  </url>
</urlset>
