{
  "abstract": "We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal approximations. Our achievability bound exactly evaluates the ensemble-average excess-distortion probability of a specified random coding scheme and improves corresponding specializations of known general one-shot bounds. Our converse conditions on the erasure pattern and source energy and combines spherical-cap and volume bounds, with the spherical-cap term providing the geometric prefactor needed for the matching third-order term. In our channel-uniform normal approximation, we show that for fixed distortion ratio, target excess-distortion probability, and block size, the sufficient and necessary information-balance conditions have the same dispersion and $\\frac{1}{2}\\log k$ terms, where $k$ is the source blocklength, and differ only by bounded remainders that are uniform over the channel blocklength and erasure-probability profile. Numerical evaluations compare the nonasymptotic JSCC bounds and their common third-order normal approximation with an optimized symmetrized SSCC achievability benchmark.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.38725",
  "author_total": 1,
  "authors": [
    {
      "name": "Adeel Mahmood"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/62ct4gysfyzzc.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.38725",
  "fulltext_url": null,
  "id": "62ct4gysfyzzc",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.38725",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1705|Error Correcting Code Techniques"
    ]
  ],
  "openalex": "W7216595920",
  "pdf_url": "https://arxiv.org/pdf/2609.38725",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-04",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/62ct4gysfyzzc.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:10Z",
      "native_id": "2609.38725",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.38725"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations",
  "title_text": "Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:10Z",
  "url": "https://research.draconitic.com/paper/62ct4gysfyzzc",
  "venue": "arXiv",
  "versions": []
}