<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/</loc>
    <lastmod>2026-10-18</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/abelian-automorphism-constant-two/</loc>
    <lastmod>2026-10-18</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/binary-cyclic-minimum-dual-distance/</loc>
    <lastmod>2026-10-16</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/perfect-radius-two-lee-codes/</loc>
    <lastmod>2026-10-17</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/binary-masked-mixed-qubit-bound/</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/binary-rank-metric-length-eight/</loc>
    <lastmod>2026-10-14</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/rank-metric-length-eight-general-q/</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/aperiodic-frequency-hopping-capacity/</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/self-dual-euclidean-weight-gcd/</loc>
    <lastmod>2026-10-14</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/projective-reed-solomon-covering-radius/</loc>
    <lastmod>2026-10-14</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/qary-delsarte-half-rate/</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/qary-strict-rate-bounds/</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/abelian-automorphism-constant-two/proof.pdf</loc>
    <lastmod>2026-10-18</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/binary-cyclic-minimum-dual-distance/proof.pdf</loc>
    <lastmod>2026-10-16</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/perfect-radius-two-lee-codes/proof.pdf</loc>
    <lastmod>2026-10-17</lastmod>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/binary-masked-mixed-qubit-bound/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/binary-rank-metric-length-eight/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/rank-metric-length-eight-general-q/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/aperiodic-frequency-hopping-capacity/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/self-dual-euclidean-weight-gcd/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/projective-reed-solomon-covering-radius/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/qary-delsarte-half-rate/proof.pdf</loc>
  </url>
  <url>
    <loc>https://stalin1943.github.io/Coding-Theory-Proof-Notes/qary-strict-rate-bounds/proof.pdf</loc>
  </url>
</urlset>
