arXiv math.IT Information Theory's Avatar

arXiv math.IT Information Theory

@mathit-bot

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

18
Followers
1
Following
2,177
Posts
12.01.2025
Joined
Posts Following

Latest posts by arXiv math.IT Information Theory @mathit-bot

Jaehyung Choi: Information geometry of tempered stable processes https://arxiv.org/abs/2502.12037 https://arxiv.org/pdf/2502.12037 https://arxiv.org/html/2502.12037

18.02.2025 06:12 ๐Ÿ‘ 0 ๐Ÿ” 2 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 1

Keshab Chandra Bakshi, B V Rajarama Bhat: Unitary orthonormal bases of finite dimensional inclusions https://arxiv.org/abs/2502.11821 https://arxiv.org/pdf/2502.11821 https://arxiv.org/html/2502.11821

18.02.2025 06:14 ๐Ÿ‘ 0 ๐Ÿ” 2 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

No\'emie C. Combe, Philippe G. Combe, Hanna K. Nencka: Exploring information geometry: Recent Advances and Connections to Topological Field Theory https://arxiv.org/abs/2502.11188 https://arxiv.org/pdf/2502.11188 https://arxiv.org/html/2502.11188

18.02.2025 06:12 ๐Ÿ‘ 0 ๐Ÿ” 2 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 0 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan: When Wyner and Ziv Met Bayes in Quantum-Classical Realm https://arxiv.org/abs/2502.12129 https://arxiv.org/pdf/2502.12129 https://arxiv.org/html/2502.12129

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

facilitate adoption of TokCom in future wireless networks. [6/6 of https://arxiv.org/abs/2502.12096v1]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 0 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

Li Qiao, Mahdi Boloursaz Mashhadi, Zhen Gao, Rahim Tafazolli, Mehdi Bennis, Dusit Niyato: Token Communications: A Unified Framework for Cross-modal Context-aware Semantic Communications https://arxiv.org/abs/2502.12096 https://arxiv.org/pdf/2502.12096 https://arxiv.org/html/2502.12096

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 0 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

Minglai Cai, Christian Deppe: Quantum Byzantine Multiple Access Channels https://arxiv.org/abs/2502.12047 https://arxiv.org/pdf/2502.12047 https://arxiv.org/html/2502.12047

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 1 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 0 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

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]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

arXiv:2502.12011v1 Announce Type: new
Abstract: In this paper, we study the impact of reconfigurable intelligent surfaces (RISs) on the coverage extension of integrated access and backhaul (IAB) networks. Particularly, [1/5 of https://arxiv.org/abs/2502.12011v1]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

Charitha Madapatha, Behrooz Makki, Hao Guo, Tommy Svensson: Reconfigurable Intelligent Surfaces-Assisted Integrated Access and Backhaul https://arxiv.org/abs/2502.12011 https://arxiv.org/pdf/2502.12011 https://arxiv.org/html/2502.12011

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

utilization does not compromise network performance. [6/6 of https://arxiv.org/abs/2502.11984v1]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 0 ๐Ÿ“Œ 0

demonstrating a 20% reduction in channel usage compared to baseline RLNC solutions. Notably, these efficiency gains are achieved while maintaining competitive throughput and delay performance, ensuring improved resource [5/6 of https://arxiv.org/abs/2502.11984v1]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0

mechanisms: 1) Blank Space Period, accounting for the forward-channels bottleneck, and 2) No-New No-FEC approach, based on data availability. The experimental results achieve significant improvements in resource efficiency, [4/6 of https://arxiv.org/abs/2502.11984v1]

18.02.2025 06:13 ๐Ÿ‘ 0 ๐Ÿ” 0 ๐Ÿ’ฌ 1 ๐Ÿ“Œ 0