arXiv math.IT Information Theory
@mathit-bot.bsky.social
Unofficial bot by @vele.bsky.social w/ http://github.com/so-okada/bXiv. https://arxiv.org/list/cs.IT/new
Aliased to @csit-bot.bsky.social
Aliased to @csit-bot.bsky.social
connection between rate-distortion and rate-channel theory, showing that a rate-channel compression protocol attains the optimal rate-distortion function for a specific distortion measure and level. [6/6 of https://arxiv.org/abs/2502.12129v1]
February 18, 2025 at 6:13 AM
connection between rate-distortion and rate-channel theory, showing that a rate-channel compression protocol attains the optimal rate-distortion function for a specific distortion measure and level. [6/6 of https://arxiv.org/abs/2502.12129v1]
on the asymptotic performance limit in terms of single-letter quantum and classical mutual information quantities of the given posterior channel for QC-QSI and C-CSI cases, respectively. Furthermore, we establish a [5/6 of https://arxiv.org/abs/2502.12129v1]
February 18, 2025 at 6:13 AM
on the asymptotic performance limit in terms of single-letter quantum and classical mutual information quantities of the given posterior channel for QC-QSI and C-CSI cases, respectively. Furthermore, we establish a [5/6 of https://arxiv.org/abs/2502.12129v1]
rate-distortion framework, this formulation imposes a block error constraint. An analogous formulation is developed for lossy classical source coding with classical side information (C-CSI) problem. We derive an inner bound [4/6 of https://arxiv.org/abs/2502.12129v1]
February 18, 2025 at 6:13 AM
rate-distortion framework, this formulation imposes a block error constraint. An analogous formulation is developed for lossy classical source coding with classical side information (C-CSI) problem. We derive an inner bound [4/6 of https://arxiv.org/abs/2502.12129v1]
the source states. We introduce a new formulation based on a backward (posterior) channel, replacing the single-letter distortion observable with a single-letter posterior channel to capture reconstruction error. Unlike the [3/6 of https://arxiv.org/abs/2502.12129v1]
February 18, 2025 at 6:13 AM
the source states. We introduce a new formulation based on a backward (posterior) channel, replacing the single-letter distortion observable with a single-letter posterior channel to capture reconstruction error. Unlike the [3/6 of https://arxiv.org/abs/2502.12129v1]
a quantum source, obtained after performing a measurement while incurring a bounded reconstruction error. Here, the decoder is allowed to use the side information to recover the classical data obtained from measurements on [2/6 of https://arxiv.org/abs/2502.12129v1]
February 18, 2025 at 6:13 AM
a quantum source, obtained after performing a measurement while incurring a bounded reconstruction error. Here, the decoder is allowed to use the side information to recover the classical data obtained from measurements on [2/6 of https://arxiv.org/abs/2502.12129v1]
arXiv:2502.12129v1 Announce Type: new
Abstract: In this work, we address the lossy quantum-classical source coding with the quantum side-information (QC-QSI) problem. The task is to compress the classical information about [1/6 of https://arxiv.org/abs/2502.12129v1]
Abstract: In this work, we address the lossy quantum-classical source coding with the quantum side-information (QC-QSI) problem. The task is to compress the classical information about [1/6 of https://arxiv.org/abs/2502.12129v1]
February 18, 2025 at 6:13 AM
arXiv:2502.12129v1 Announce Type: new
Abstract: In this work, we address the lossy quantum-classical source coding with the quantum side-information (QC-QSI) problem. The task is to compress the classical information about [1/6 of https://arxiv.org/abs/2502.12129v1]
Abstract: In this work, we address the lossy quantum-classical source coding with the quantum side-information (QC-QSI) problem. The task is to compress the classical information about [1/6 of https://arxiv.org/abs/2502.12129v1]
facilitate adoption of TokCom in future wireless networks. [6/6 of https://arxiv.org/abs/2502.12096v1]
February 18, 2025 at 6:13 AM
facilitate adoption of TokCom in future wireless networks. [6/6 of https://arxiv.org/abs/2502.12096v1]
setup for image, leveraging cross-modal context information, which increases the bandwidth efficiency by 70.8% with negligible loss of semantic/perceptual quality. Finally, the potential research directions are identified to [5/6 of https://arxiv.org/abs/2502.12096v1]
February 18, 2025 at 6:13 AM
setup for image, leveraging cross-modal context information, which increases the bandwidth efficiency by 70.8% with negligible loss of semantic/perceptual quality. Finally, the potential research directions are identified to [5/6 of https://arxiv.org/abs/2502.12096v1]
communication systems to leverage cross-modal context effectively, present the key principles for efficient TokCom at various layers in future wireless networks. We demonstrate the corresponding TokCom benefits in a GenSC [4/6 of https://arxiv.org/abs/2502.12096v1]
February 18, 2025 at 6:13 AM
communication systems to leverage cross-modal context effectively, present the key principles for efficient TokCom at various layers in future wireless networks. We demonstrate the corresponding TokCom benefits in a GenSC [4/6 of https://arxiv.org/abs/2502.12096v1]
processing at the transmitter and receiver. In this paper, we introduce the potential opportunities and challenges of leveraging context in GenSC, explore how to integrate GFM/MLLMs-based token processing into semantic [3/6 of https://arxiv.org/abs/2502.12096v1]
February 18, 2025 at 6:13 AM
processing at the transmitter and receiver. In this paper, we introduce the potential opportunities and challenges of leveraging context in GenSC, explore how to integrate GFM/MLLMs-based token processing into semantic [3/6 of https://arxiv.org/abs/2502.12096v1]
TokCom is a new paradigm, motivated by the recent success of generative foundation models and multimodal large language models (GFM/MLLMs), where the communication units are tokens, enabling efficient transformer-based token [2/6 of https://arxiv.org/abs/2502.12096v1]
February 18, 2025 at 6:13 AM
TokCom is a new paradigm, motivated by the recent success of generative foundation models and multimodal large language models (GFM/MLLMs), where the communication units are tokens, enabling efficient transformer-based token [2/6 of https://arxiv.org/abs/2502.12096v1]
arXiv:2502.12096v1 Announce Type: new
Abstract: In this paper, we introduce token communications (TokCom), a unified framework to leverage cross-modal context information in generative semantic communications (GenSC). [1/6 of https://arxiv.org/abs/2502.12096v1]
Abstract: In this paper, we introduce token communications (TokCom), a unified framework to leverage cross-modal context information in generative semantic communications (GenSC). [1/6 of https://arxiv.org/abs/2502.12096v1]
February 18, 2025 at 6:13 AM
arXiv:2502.12096v1 Announce Type: new
Abstract: In this paper, we introduce token communications (TokCom), a unified framework to leverage cross-modal context information in generative semantic communications (GenSC). [1/6 of https://arxiv.org/abs/2502.12096v1]
Abstract: In this paper, we introduce token communications (TokCom), a unified framework to leverage cross-modal context information in generative semantic communications (GenSC). [1/6 of https://arxiv.org/abs/2502.12096v1]
deviates from the protocol and acts dishonestly. To address this challenge, we introduce the Byzantine multiple-access classical-quantum channel and derive an achievable communication rate for this adversarial setting. [3/3 of https://arxiv.org/abs/2502.12047v1]
February 18, 2025 at 6:13 AM
deviates from the protocol and acts dishonestly. To address this challenge, we introduce the Byzantine multiple-access classical-quantum channel and derive an achievable communication rate for this adversarial setting. [3/3 of https://arxiv.org/abs/2502.12047v1]
established protocols. But what happens if one of the parties turns malicious? In this work, we investigate a compelling scenario: a multiple-access channel with two transmitters and one receiver, where one transmitter [2/3 of https://arxiv.org/abs/2502.12047v1]
February 18, 2025 at 6:13 AM
established protocols. But what happens if one of the parties turns malicious? In this work, we investigate a compelling scenario: a multiple-access channel with two transmitters and one receiver, where one transmitter [2/3 of https://arxiv.org/abs/2502.12047v1]
arXiv:2502.12047v1 Announce Type: new
Abstract: In communication theory, attacks like eavesdropping or jamming are typically assumed to occur at the channel level, while communication parties are expected to follow [1/3 of https://arxiv.org/abs/2502.12047v1]
Abstract: In communication theory, attacks like eavesdropping or jamming are typically assumed to occur at the channel level, while communication parties are expected to follow [1/3 of https://arxiv.org/abs/2502.12047v1]
February 18, 2025 at 6:13 AM
arXiv:2502.12047v1 Announce Type: new
Abstract: In communication theory, attacks like eavesdropping or jamming are typically assumed to occur at the channel level, while communication parties are expected to follow [1/3 of https://arxiv.org/abs/2502.12047v1]
Abstract: In communication theory, attacks like eavesdropping or jamming are typically assumed to occur at the channel level, while communication parties are expected to follow [1/3 of https://arxiv.org/abs/2502.12047v1]
tree foliage over seasonal changes. Our simulation results reveal both opportunities and challenges towards the implementation of RIS in IAB. [5/5 of https://arxiv.org/abs/2502.12011v1]
February 18, 2025 at 6:13 AM
tree foliage over seasonal changes. Our simulation results reveal both opportunities and challenges towards the implementation of RIS in IAB. [5/5 of https://arxiv.org/abs/2502.12011v1]
controlled repeaters (NCRs). Our investigations focus on wide-area IAB assisted with RIS through the lens of different design architectures and deployments, revealing both conflicts and synergies for minimizing the effect of [4/5 of https://arxiv.org/abs/2502.12011v1]
February 18, 2025 at 6:13 AM
controlled repeaters (NCRs). Our investigations focus on wide-area IAB assisted with RIS through the lens of different design architectures and deployments, revealing both conflicts and synergies for minimizing the effect of [4/5 of https://arxiv.org/abs/2502.12011v1]
probability of the event that the UEs' minimum rate requirements are satisfied. We present comparisons between different cases including IAB-only, IAB assisted with RIS for backhaul as well as IAB assisted by network [3/5 of https://arxiv.org/abs/2502.12011v1]
February 18, 2025 at 6:13 AM
probability of the event that the UEs' minimum rate requirements are satisfied. We present comparisons between different cases including IAB-only, IAB assisted with RIS for backhaul as well as IAB assisted by network [3/5 of https://arxiv.org/abs/2502.12011v1]
using a finite stochastic geometry model, with random distributions of user equipments (UEs) in a finite region, and planned hierachical architecture for IAB, we study the service coverage probability defined as the [2/5 of https://arxiv.org/abs/2502.12011v1]
February 18, 2025 at 6:13 AM
using a finite stochastic geometry model, with random distributions of user equipments (UEs) in a finite region, and planned hierachical architecture for IAB, we study the service coverage probability defined as the [2/5 of https://arxiv.org/abs/2502.12011v1]