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 > cs > arXiv:2212.01485v4

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.01485v4 (cs)
[Submitted on 2 Dec 2022 (v1) , last revised 31 Aug 2025 (this version, v4)]

Title: A Theory of Semantic Communication

Title: 语义通信理论

Authors:Yulin Shao, Qi Cao, Deniz Gunduz
Abstract: Semantic communication is an emerging research area that has gained a wide range of attention recently. Despite this growing interest, there remains a notable absence of a comprehensive and widely-accepted framework for characterizing semantic communication. This paper introduces a new conceptualization of semantic communication and formulates two fundamental problems, which we term language exploitation and language design. Our contention is that the challenge of language design can be effectively situated within the broader framework of joint source-channel coding theory, underpinned by a comprehensive end-to-end distortion metric. To tackle the language exploitation problem, we put forth three approaches: semantic encoding, semantic decoding, and a synergistic combination of both in the form of combined semantic encoding and decoding. Furthermore, we establish the semantic distortion-cost region as a critical framework for assessing the language exploitation problem. For each of the three proposed approaches, the achievable distortion-cost region is characterized. Overall, this paper aims to shed light on the intricate dynamics of semantic communication, paving the way for a deeper understanding of this evolving field.
Abstract: 语义通信是一个新兴的研究领域,近年来引起了广泛关注。 尽管对此领域的兴趣日益增长,但仍然缺乏一个全面且广泛接受的框架来描述语义通信。 本文引入了语义通信的新概念,并提出了两个基本问题,我们称之为语言利用和语言设计。 我们认为,语言设计的挑战可以在联合信源信道编码理论的更广泛框架内得到有效定位,这一框架由一个全面的端到端失真度量所支持。 为了解决语言利用问题,我们提出了三种方法:语义编码、语义解码,以及两者结合的协同组合形式,即联合语义编码和解码。 此外,我们建立了语义失真-成本区域作为评估语言利用问题的关键框架。 对于每种提出的方法,都对其可实现的失真-成本区域进行了描述。 总体而言,本文旨在揭示语义通信的复杂动态,为深入理解这一不断发展的领域铺平道路。
Comments: Keywords: Semantic communication, joint source-channel coding, semantic decoding, semantic encoding, large language model
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2212.01485 [cs.IT]
  (or arXiv:2212.01485v4 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.01485
arXiv-issued DOI via DataCite

Submission history

From: Yulin Shao [view email]
[v1] Fri, 2 Dec 2022 23:18:21 UTC (1,091 KB)
[v2] Wed, 1 Nov 2023 03:50:21 UTC (1,151 KB)
[v3] Fri, 26 Apr 2024 11:16:12 UTC (1,513 KB)
[v4] Sun, 31 Aug 2025 04:07:35 UTC (1,079 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.IT

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号