Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math-ph > arXiv:2507.02596

Help | Advanced Search

Mathematical Physics

arXiv:2507.02596 (math-ph)
[Submitted on 3 Jul 2025 (v1) , last revised 30 Jul 2025 (this version, v2)]

Title: Relativistic Limits of Decoding: Critical Divergence of Kullback-Leibler Information and Free Energy

Title: 相对论解码极限:Kullback-Leibler信息和自由能的临界发散

Authors:Tatsuaki Tsuruyama
Abstract: We present a statistical mechanical framework based on the Kullback-Leibler divergence (KLD) to analyze the relativistic limits of decoding time-encoded information from a moving source. By modeling the symbol durations as entropy-maximizing sequences and treating the decoding process as context-sensitive inference, we identify KLD between the sender and receiver distributions as a key indicator of contextual mismatch. We show that, under Lorentz transformations, this divergence grows with the sender's velocity and exhibits critical divergence as the velocity approaches the speed of light. Furthermore, we derive an analytic expression for the Fisher information and demonstrate that decoding sensitivity diverges similarly, indicating instability near the relativistic limit. By introducing an information-theoretic free energy based on the decoding cost, we determine a critical velocity beyond which decoding becomes thermodynamically impossible. These results reveal a phase-transition-like behavior in relativistic information transfer and provide a unified interpretation of KLD, Fisher information, and free energy as measures of decodability. The formalism developed here offers new insights into high-speed communication, relativistic signal processing, and information geometry in non-inertial frames.
Abstract: 我们提出了一种基于Kullback-Leibler散度(KLD)的统计力学框架,用于分析从运动源中解码时间编码信息的相对论极限。 通过将符号持续时间建模为熵最大化序列,并将解码过程视为上下文敏感的推理,我们确定了发送方和接收方分布之间的KLD是上下文不匹配的关键指标。 我们表明,在洛伦兹变换下,这种散度随着发送方的速度增加,并且当速度接近光速时表现出临界发散。 此外,我们推导了Fisher信息的解析表达式,并证明解码灵敏度也会类似地发散,表明在相对论极限附近存在不稳定性。 通过引入基于解码成本的信息理论自由能,我们确定了一个临界速度,超过该速度后解码在热力学上变得不可能。 这些结果揭示了相对论信息传输中的相变行为,并提供了一个统一的解释,将KLD、Fisher信息和自由能作为可解码性的度量。 这里开发的形式主义为高速通信、相对论信号处理以及非惯性框架中的信息几何提供了新的见解。
Subjects: Mathematical Physics (math-ph)
Cite as: arXiv:2507.02596 [math-ph]
  (or arXiv:2507.02596v2 [math-ph] for this version)
  https://doi.org/10.48550/arXiv.2507.02596
arXiv-issued DOI via DataCite

Submission history

From: Tatsuaki Tsuruyama [view email]
[v1] Thu, 3 Jul 2025 13:20:00 UTC (375 KB)
[v2] Wed, 30 Jul 2025 08:10:40 UTC (290 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math-ph
< prev   |   next >
new | recent | 2025-07
Change to browse by:
math
math.MP

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号