×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Information-Theoretic Limits on Compression of Semantic Information. (arXiv:2306.02305v1 [cs.IT])

Click here to flash read.

As conventional communication systems based on classic information theory
have closely approached the limits of Shannon channel capacity, semantic
communication has been recognized as a key enabling technology for the further
improvement of communication performance. However, it is still unsettled on how
to represent semantic information and characterise the theoretical limits. In
this paper, we consider a semantic source which consists of a set of correlated
random variables whose joint probabilistic distribution can be described by a
Bayesian network. Then we give the information-theoretic limit on the lossless
compression of the semantic source and introduce a low complexity encoding
method by exploiting the conditional independence. We further characterise the
limits on lossy compression of the semantic source and the corresponding upper
and lower bounds of the rate-distortion function. We also investigate the lossy
compression of the semantic source with side information at both the encoder
and decoder, and obtain the rate distortion function. We prove that the optimal
code of the semantic source is the combination of the optimal codes of each
conditional independent set given the side information.

Click here to read this post out
ID: 179605; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: June 6, 2023, 7:33 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 9
CC:
No creative common's license
Comments: