惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

大猫的无限游戏
大猫的无限游戏
月光博客
月光博客
博客园 - Franky
博客园 - 三生石上(FineUI控件)
爱范儿
爱范儿
博客园 - 司徒正美
博客园 - 叶小钗
Apple Machine Learning Research
Apple Machine Learning Research
美团技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
The Cloudflare Blog
B
Blog RSS Feed
阮一峰的网络日志
阮一峰的网络日志
宝玉的分享
宝玉的分享
V
Visual Studio Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
IT之家
IT之家
博客园_首页
S
SegmentFault 最新的问题
A
About on SuperTechFans
Blog — PlanetScale
Blog — PlanetScale
GbyAI
GbyAI
H
Help Net Security
MongoDB | Blog
MongoDB | Blog

cs updates on arXiv.org

Beyond Binary Edits Robust Multimodal Knowledge Editing with Adversarial Subspace Alignment Agentic Proving for Program Verification MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection OpenSkillEval: Automatically Auditing the Open Skill Ecosystem for LLM Agents One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents How Human-Like Are Large Language Models? A Register-Aware Linguistic Evaluation Framework Benchmarking Google Embeddings 2 against Open-Source Models for Multilingual Dense Retrieval and RAG Systems Structure-Guided Entity Resolution: Fine-Tuning LLMs for Robust Name Matching in Complex Linguistic Contexts Solving the Aircraft Disassembly Scheduling Problem Co-ReAct: Rubrics as Step-Level Collaborators for ReAct Agents CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering EDGE-OPD: Internalizing Privileged Context with Evidence Guided On-Policy Distillation ARES: Automated Rubric Synthesis for Scalable LLM Reinforcement Learning SSDAU: Structured Semantic Data Augmentation for Joint Entity and Relation Extraction Naturalistic measure of social norms alignment Articulatory strategy as a source of variation in acoustic vowel dynamics When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems EquiSumm : A Gender Bias-Aware Framework for Inclusive Tweet Summarization Metacognition as Reward: Reinforcing LLM Reasoning via Knowledge and Regulation Signals From Correctness to Preference: A Framework for Personalized Agentic Reinforcement Learning Cultural Adaptation in Large Language Models for Political Discourse Emotion Recognition in Sign Language Conversation ClimateChat-300K: A Multi-Modal Facebook Dataset for Understanding Diverse Perspectives in Climate Communication AraHopeCorpus: Annotation Guidelines and Dataset for Hope Speech in Arabic Social Media Crisis Discourse Human-in-the-Loop Multi-Agent Ventilator Decision Support with Contextual Bandit Preference Learning Convergence Without Understanding: When Language Models Agree on Representations but Disagree on Reasoning DART: Semantic Recoverability for Structured Tool Agents Ontological Knowledge Blocks: Executable Compliance and Profile-Based Validation for Trustworthy AI Systems Parallel Context Compaction for Long-Horizon LLM Agent Serving
The Condition for Structured Coding to Improve Random Cod...
[Submitted on 24 Jun 2026] · 2026-06-25 · via cs updates on arXiv.org

View PDF HTML (experimental)

Abstract:The modulo-sum problem, proposed by Körner and Marton (KM), is a representative problem in the field of distributed source coding. In the modulo-sum problem, two correlated sources are encoded separately, and the decoder decodes the modulo-sum of the sources. It is clear that the Slepian-Wolf (SW) coding rate region is achievable for the modulo-sum problem. Körner and Marton proved that the SW coding rate region can be improved by structured coding based on linear codes. Ahlswede and Han (AH) proposed AH coding, which combines structured coding and random coding, and expressed its rate using auxiliary random variables. However, it was conjectured that the minimum sum rate of AH coding cannot be smaller than the minimum of the sum rates achievable by KM coding or SW coding. Subsequently, Kakishima and Watanabe considered a multi-letter extension of AH coding, and designed the auxiliary random variables by taking the XOR of adjacent bits of the source sequences. Through numerical computation, they demonstrated the existence of source parameters for which multi-letter AH coding improves upon SW coding. However, this confirmation remained numerical, and the conditions under which multi-letter extended AH coding improves upon SW coding have not been analytically characterized.
In this study, we analytically characterize the conditions under which multi-letter extended AH coding improves upon SW coding. Our condition is tight in the sense that it coincides with the complement of the known SW optimal sufficient condition. To obtain the conditions, we apply the method of types to reduce the evaluation of the multi-letter expression to a comparison of single-letter divergences, which might be of independent interest.

Submission history

From: Yohsuke Tsujino [view email]
[v1] Wed, 24 Jun 2026 08:45:09 UTC (116 KB)