Cover Image

New Second-Order Achievability Bounds for Coding with Side Information via Type Deviation Convergence

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Xiang, Li, Cheuk Ting
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Second-Order Achievabilities of Indirect Quadratic Lossy Source Coding
by: Yang, Huiyuan, et al.
Published: (2024)

Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
by: Li, Cheuk Ting
Published: (2025)

Achievability Bounds on Unequal Error Protection Codes
by: Yao, Liuquan, et al.
Published: (2024)

A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding
by: Li, Cheuk Ting
Published: (2026)

An Achievability Bound for Type-Based Unsourced Multiple Access
by: Krishnan, Deekshith Pathayappilly, et al.
Published: (2025)

Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability
by: Nikbakht, Homa, et al.
Published: (2023)

Pointwise Redundancy in One-Shot Lossy Compression via Poisson Functional Representation
by: Li, Cheuk Ting
Published: (2024)

One-Shot Coding over General Noisy Networks
by: Liu, Yanxiao, et al.
Published: (2024)

Rejection-Sampled Linear Codes for Lossy Compression and Channel Simulation
by: Zhao, Jianguo, et al.
Published: (2025)

Achievability Bounds of Coding with Finite Blocklength for Gaussian Broadcast Channels
by: Ünsal, Ayşe, et al.
Published: (2026)

Achievable Second-Order Asymptotics for MAC and RAC with Additive Non-Gaussian Noise
by: Wang, Yiming, et al.
Published: (2024)

A Characterization of Entropy as a Universal Monoidal Natural Transformation
by: Li, Cheuk Ting
Published: (2023)

Discrete Layered Entropy, Conditional Compression and a Tighter Strong Functional Representation Lemma
by: Li, Cheuk Ting
Published: (2025)

An Achievability Bound for Variable-Length Stop-Feedback Coding over the Gaussian Channel
by: Papoutsidakis, Ioannis, et al.
Published: (2024)

Variable-Length Secret Key Agreement via Random Stopping Time
by: Zhou, Junda, et al.
Published: (2024)

Nonasymptotic Oblivious Relaying and Variable-Length Noisy Lossy Source Coding
by: Liu, Yanxiao, et al.
Published: (2025)

One-Cold Poisson Channel: A Simple Continuous-Time Channel with Zero Dispersion
by: Li, Cheuk Ting
Published: (2026)

Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels
by: Boche, Holger, et al.
Published: (2025)

A Pair of Bayesian Network Structures has Undecidable Conditional Independencies
by: Li, Cheuk Ting
Published: (2024)

Indirect Lossy Source Coding with Observed Source Reconstruction: Nonasymptotic Bounds and Second-Order Asymptotics
by: Yang, Huiyuan, et al.
Published: (2024)

Subjective Distortion: Achievability and Outer Bounds for Distortion Functions with Memory
by: Abin, Hamidreza, et al.
Published: (2026)

Subcodes of Second-Order Reed-Muller Codes via Recursive Subproducts
by: Vaideeswaran, A P, et al.
Published: (2025)

Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
by: Mishra, Prachi, et al.
Published: (2026)

Vector Quantization with Error Uniformly Distributed over an Arbitrary Set
by: Ling, Chih Wei, et al.
Published: (2023)

Achievable Rate Regions for Multi-terminal Quantum Channels via Coset Codes
by: Gouiaa, Fatma, et al.
Published: (2025)

On Decoding First- and Second-Order BiD Codes
by: Jain, Devansh, et al.
Published: (2026)

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
by: Ly, Hoang, et al.
Published: (2025)

An Achievable and Analytic Solution to Information Bottleneck for Gaussian Mixtures
by: Song, Yi, et al.
Published: (2023)

Joint Scheduling and Multiflow Maximization in Wireless Networks
by: Liu, Yanxiao, et al.
Published: (2025)

Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution
by: Tamir, Ran, et al.
Published: (2025)

Many-User Multiple Access with Random User Activity: Achievability Bounds and Efficient Schemes
by: Liu, Xiaoqi, et al.
Published: (2024)

New Partial Orders of Polar Codes for BMSC
by: Yao, Liuquan, et al.
Published: (2024)

Simultaneous Decoding of Classical Coset Codes over $3-$User Quantum Broadcast Channel: New Achievable Rate Regions
by: Gouiaa, Fatma, et al.
Published: (2025)

Improving Achievability of Cache-Aided Private Variable-Length Coding with Zero Leakage
by: Zamani, Amirreza, et al.
Published: (2024)

ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM
by: Li, Zhuang, et al.
Published: (2024)

Lossy Source Coding with Broadcast Side Information
by: Chen, Yiqi, et al.
Published: (2026)

Achievable DoF Bounds for Cache-Aided Asymmetric MIMO Communications
by: NaseriTehrani, Mohammad, et al.
Published: (2025)

Achievable DoF Bounds for Cache-Aided Asymmetric MIMO Communications
by: NaseriTehrani, Mohammad, et al.
Published: (2026)

Maximum Achievable Rate of Resistive Random-Access Memory Channels by Mutual Information Spectrum Analysis
by: Song, Guanghui, et al.
Published: (2024)

Achievable Rates for Information Extraction from a Strategic Sender
by: Vora, Anuj S., et al.
Published: (2023)