arXiv - MATH - Information Theory最新文献_第2页

Generalized Measures of Anticipation and Responsivity in Online Language Processing 在线语言处理中预期和反应能力的通用测量方法

arXiv - MATH - Information Theory Pub Date : 2024-09-16 DOI: arxiv-2409.10728

Mario Giulianelli, Andreas Opedal, Ryan Cotterell

引用次数: 0

The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes 二进制原始双误校正 BCH 码的第二广义覆盖半径

arXiv - MATH - Information Theory Pub Date : 2024-09-16 DOI: arxiv-2409.10420

Lev Yohananov, Moshe Schwartz

引用次数: 0

Power Allocation for Finite-Blocklength IR-HARQ 有限块长 IR-HARQ 的功率分配

arXiv - MATH - Information Theory Pub Date : 2024-09-15 DOI: arxiv-2409.09780

Wenyu Wang, Minhao Zhu, Kaiming Shen, Zhaorui Wang, Shuguang Cui

引用次数: 0

A Simple Study on the Optimality of Hybrid NOMA 关于混合 NOMA 优化性的简单研究

arXiv - MATH - Information Theory Pub Date : 2024-09-15 DOI: arxiv-2409.09654

Zhiguo Ding

引用次数: 0

Generative Semantic Communication via Textual Prompts: Latency Performance Tradeoffs 通过文本提示进行生成式语义交流：延迟性能权衡

arXiv - MATH - Information Theory Pub Date : 2024-09-15 DOI: arxiv-2409.09715

Mengmeng Ren, Li Qiao, Long Yang, Zhen Gao, Jian Chen, Mahdi Boloursaz Mashhadi, Pei Xiao, Rahim Tafazolli, Mehdi Bennis

{"title":"Generative Semantic Communication via Textual Prompts: Latency Performance Tradeoffs","authors":"Mengmeng Ren, Li Qiao, Long Yang, Zhen Gao, Jian Chen, Mahdi Boloursaz Mashhadi, Pei Xiao, Rahim Tafazolli, Mehdi Bennis","doi":"arxiv-2409.09715","DOIUrl":"https://doi.org/arxiv-2409.09715","url":null,"abstract":"This paper develops an edge-device collaborative Generative Semantic\u0000Communications (Gen SemCom) framework leveraging pre-trained Multi-modal/Vision\u0000Language Models (M/VLMs) for ultra-low-rate semantic communication via textual\u0000prompts. The proposed framework optimizes the use of M/VLMs on the wireless\u0000edge/device to generate high-fidelity textual prompts through visual\u0000captioning/question answering, which are then transmitted over a wireless\u0000channel for SemCom. Specifically, we develop a multi-user Gen SemCom framework\u0000using pre-trained M/VLMs, and formulate a joint optimization problem of prompt\u0000generation offloading, communication and computation resource allocation to\u0000minimize the latency and maximize the resulting semantic quality. Due to the\u0000nonconvex nature of the problem with highly coupled discrete and continuous\u0000variables, we decompose it as a two-level problem and propose a low-complexity\u0000swap/leaving/joining (SLJ)-based matching algorithm. Simulation results\u0000demonstrate significant performance improvements over the conventional\u0000semanticunaware/non-collaborative offloading benchmarks.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142268482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Inter Observer Variability Assessment through Ordered Weighted Belief Divergence Measure in MAGDM Application to the Ensemble Classifier Feature Fusion 通过 MAGDM 中的有序加权信念发散度量评估观察者之间的变异性将其应用于集合分类器特征融合

arXiv - MATH - Information Theory Pub Date : 2024-09-13 DOI: arxiv-2409.08450

Pragya GuptaDepartment of Mathematics Indian Institute of Technology Kharagpur, Debjani ChakrabortyDepartment of Mathematics Indian Institute of Technology Kharagpur, Debashree GuhaSchool of Medical Science and Technology Indian Institute of Technology Kharagpur

{"title":"Inter Observer Variability Assessment through Ordered Weighted Belief Divergence Measure in MAGDM Application to the Ensemble Classifier Feature Fusion","authors":"Pragya GuptaDepartment of Mathematics Indian Institute of Technology Kharagpur, Debjani ChakrabortyDepartment of Mathematics Indian Institute of Technology Kharagpur, Debashree GuhaSchool of Medical Science and Technology Indian Institute of Technology Kharagpur","doi":"arxiv-2409.08450","DOIUrl":"https://doi.org/arxiv-2409.08450","url":null,"abstract":"A large number of multi-attribute group decisionmaking (MAGDM) have been\u0000widely introduced to obtain consensus results. However, most of the\u0000methodologies ignore the conflict among the experts opinions and only consider\u0000equal or variable priorities of them. Therefore, this study aims to propose an\u0000Evidential MAGDM method by assessing the inter-observational variability and\u0000handling uncertainty that emerges between the experts. The proposed framework\u0000has fourfold contributions. First, the basic probability assignment (BPA)\u0000generation method is introduced to consider the inherent characteristics of\u0000each alternative by computing the degree of belief. Second, the ordered\u0000weighted belief and plausibility measure is constructed to capture the overall\u0000intrinsic information of the alternative by assessing the inter-observational\u0000variability and addressing the conflicts emerging between the group of experts.\u0000An ordered weighted belief divergence measure is constructed to acquire the\u0000weighted support for each group of experts to obtain the final preference\u0000relationship. Finally, we have shown an illustrative example of the proposed\u0000Evidential MAGDM framework. Further, we have analyzed the interpretation of\u0000Evidential MAGDM in the real-world application for ensemble classifier feature\u0000fusion to diagnose retinal disorders using optical coherence tomography images.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142268488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Learning Short Codes for Fading Channels with No or Receiver-Only Channel State Information 学习无信道状态信息或仅有接收器信道状态信息的衰减信道短码

arXiv - MATH - Information Theory Pub Date : 2024-09-13 DOI: arxiv-2409.08581

Rishabh Sharad Pomaje, Rajshekhar V Bhat

{"title":"Learning Short Codes for Fading Channels with No or Receiver-Only Channel State Information","authors":"Rishabh Sharad Pomaje, Rajshekhar V Bhat","doi":"arxiv-2409.08581","DOIUrl":"https://doi.org/arxiv-2409.08581","url":null,"abstract":"In next-generation wireless networks, low latency often necessitates\u0000short-length codewords that either do not use channel state information (CSI)\u0000or rely solely on CSI at the receiver (CSIR). Gaussian codes that achieve\u0000capacity for AWGN channels may be unsuitable for these no-CSI and CSIR-only\u0000cases. In this work, we design short-length codewords for these cases using an\u0000autoencoder architecture. From the designed codes, we observe the following: In\u0000the no-CSI case, the learned codes are mutually orthogonal when the\u0000distribution of the real and imaginary parts of the fading random variable has\u0000support over the entire real line. However, when the support is limited to the\u0000non-negative real line, the codes are not mutually orthogonal. For the\u0000CSIR-only case, deep learning-based codes designed for AWGN channels perform\u0000worse in fading channels with optimal coherent detection compared to codes\u0000specifically designed for fading channels with CSIR, where the autoencoder\u0000jointly learns encoding, coherent combining, and decoding. In both no-CSI and\u0000CSIR-only cases, the codes perform at least as well as or better than classical\u0000codes of the same block length.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142268485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Secure Offloading in NOMA-Aided Aerial MEC Systems Based on Deep Reinforcement Learning 基于深度强化学习的 NOMA 辅助空中 MEC 系统中的安全卸载

arXiv - MATH - Information Theory Pub Date : 2024-09-13 DOI: arxiv-2409.08579

Hongjiang Lei, Mingxu Yang, Ki-Hong Park, Gaofeng Pan

{"title":"Secure Offloading in NOMA-Aided Aerial MEC Systems Based on Deep Reinforcement Learning","authors":"Hongjiang Lei, Mingxu Yang, Ki-Hong Park, Gaofeng Pan","doi":"arxiv-2409.08579","DOIUrl":"https://doi.org/arxiv-2409.08579","url":null,"abstract":"Mobile edge computing (MEC) technology can reduce user latency and energy\u0000consumption by offloading computationally intensive tasks to the edge servers.\u0000Unmanned aerial vehicles (UAVs) and non-orthogonal multiple access (NOMA)\u0000technology enable the MEC networks to provide offloaded computing services for\u0000massively accessed terrestrial users conveniently. However, the broadcast\u0000nature of signal propagation in NOMA-based UAV-MEC networks makes it vulnerable\u0000to eavesdropping by malicious eavesdroppers. In this work, a secure offload\u0000scheme is proposed for NOMA-based UAV-MEC systems with the existence of an\u0000aerial eavesdropper. The long-term average network computational cost is\u0000minimized by jointly designing the UAV's trajectory, the terrestrial users'\u0000transmit power, and computational frequency while ensuring the security of\u0000users' offloaded data. Due to the eavesdropper's location uncertainty, the\u0000worst-case security scenario is considered through the estimated eavesdropping\u0000range. Due to the high-dimensional continuous action space, the deep\u0000deterministic policy gradient algorithm is utilized to solve the non-convex\u0000optimization problem. Simulation results validate the effectiveness of the\u0000proposed scheme.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142268487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Deep Learning-based Codes for Wiretap Fading Channels 基于深度学习的窃听消隐信道编码

arXiv - MATH - Information Theory Pub Date : 2024-09-13 DOI: arxiv-2409.08786

Daniel Seifert, Onur Günlü, Rafael F. Schaefer

引用次数: 0

Generalized Nearest Neighbor Decoding: General Input Constellation and a Case Study of Interference Suppression 广义近邻解码：通用输入星座和干扰抑制案例研究

arXiv - MATH - Information Theory Pub Date : 2024-09-13 DOI: arxiv-2409.08826

Shuqin Pang, Wenyi Zhang

{"title":"Generalized Nearest Neighbor Decoding: General Input Constellation and a Case Study of Interference Suppression","authors":"Shuqin Pang, Wenyi Zhang","doi":"arxiv-2409.08826","DOIUrl":"https://doi.org/arxiv-2409.08826","url":null,"abstract":"In this work, generalized nearest neighbor decoding (GNND), a recently\u0000proposed receiver architecture, is studied for channels under general input\u0000constellations, and multiuser uplink interference suppression is employed as a\u0000case study for demonstrating its potential. In essence, GNND generalizes the\u0000wellknown nearest neighbor decoding, by introducing a symbol-level memoryless\u0000processing step, which can be rendered seamlessly compatible with Gaussian\u0000channel-based decoders. First, criteria of the optimal GNND are derived for\u0000general input constellations, expressed in the form of conditional moments\u0000matching, thereby generalizing the prior work which has been confined to\u0000Gaussian input. Then, the optimal GNND is applied to the use case of multiuser\u0000uplink, for which the optimal GNND is shown to be capable of achieving\u0000information rates nearly identical to the channel mutual information. By\u0000contrast, the commonly used channel linearization (CL) approach incurs a\u0000noticeable rate loss. A coded modulation scheme is subsequently developed,\u0000aiming at implementing GNND using off-the-shelf channel codes, without\u0000requiring iterative message passing between demodulator and decoder. Through\u0000numerical experiments it is validated that the developed scheme significantly\u0000outperforms the CL-based scheme.","PeriodicalId":501082,"journal":{"name":"arXiv - MATH - Information Theory","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142268484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0