:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Suda, So, Watanabe, Shun, Yamaguchi, Haruya
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2401.14965
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction
by: Suda, So, et al.
Published: (2025)

Network Oblivious Transfer via Noisy Channels: Limits and Capacities
by: Aghaee, Hadi, et al.
Published: (2025)

Network Oblivious Transfer via Noisy Broadcast Channels
by: Aghaee, Hadi, et al.
Published: (2025)

On the Capacity of Erasure-prone Quantum Storage with Erasure-prone Entanglement Assistance
by: Sun, Hua, et al.
Published: (2025)

A Tight Channel-Capacity Lower Bound for the Simultaneous Wireless Information and Power Transfer Integrated Receiver
by: Ntontin, Konstantinos, et al.
Published: (2026)

An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
by: Baniasadi, Mohammadamin, et al.
Published: (2026)

Alternating Maximization Algorithm for Mismatch Capacity with Oblivious Relaying
by: Li, Xinwei, et al.
Published: (2024)

A Converse For the Capacity of the Shotgun Sequencing Channel with Erasures
by: Ali, Mohammed Ihsan, et al.
Published: (2025)

Two-Server Oblivious Transfer for Quantum Messages
by: Hayashi, Masahito, et al.
Published: (2022)

Improved Lower Bounds on Mutual Information Accounting for Nonlinear Signal-Noise Interaction
by: Irukulapati, Naga V., et al.
Published: (2016)

Improved Probabilistic Lower Bounds for Separable Matrices
by: Goshkoder, Daniil, et al.
Published: (2024)

Confusions and Erasures of Error-Bounded Block Decoders with Finite Blocklength
by: Han, Bin, et al.
Published: (2025)

The Derivation Penalty in Premise-Erasure Caching: Capacity, Strong Converse, and Dispersion Dichotomy
by: Xu, Jianfeng
Published: (2026)

On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations
by: Aghaee, Hadi, et al.
Published: (2026)

Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes
by: Lin, Pin-Hsun, et al.
Published: (2026)

Improved Capacity Outer Bound for Private Quadratic Monomial Computation
by: Dæhli, Karen M., et al.
Published: (2024)

Capacity of Summation over a Symmetric Quantum Erasure MAC with Partially Replicated Inputs
by: Yao, Yuhang, et al.
Published: (2023)

Tight Exponential Strong Converses for Lossy Source Coding with Side-Information and Distributed Function Computation
by: Watanabe, Shun
Published: (2025)

Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints
by: Merhav, Neri, et al.
Published: (2025)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

An Improved Lower Bound on Cardinality of Support of the Amplitude-Constrained AWGN Channel
by: Wang, Haiyang, et al.
Published: (2025)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
by: Zieder, Ian, et al.
Published: (2024)

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

$L_q$ Lower Bounds on Distributed Estimation via Fisher Information
by: Chen, Wei-Ning, et al.
Published: (2024)

Learning to Transmit Over Unknown Erasure Channels with Empirical Erasure Rate Feedback
by: Balasundaram, Haricharan, et al.
Published: (2025)

UMVUE-Type Estimators under Bregman Losses
by: Kamatsuka, Akira, et al.
Published: (2026)

Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information
by: Takeuchi, Daisuke, et al.
Published: (2022)

Channel Resolvability Using Multiplicative Weight Update Algorithm
by: Takahashi, Koki, et al.
Published: (2025)

Characterization of Exponential Families of Lumpable Stochastic Matrices
by: Watanabe, Shun, et al.
Published: (2024)

Finite-length Analysis on Tail probability for Markov Chain and Application to Simple Hypothesis Testing
by: Watanabe, Shun, et al.
Published: (2014)

Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes
by: Yao, Hanwen, et al.
Published: (2024)

Capacity Bounds for the Poisson-Repeat Channel
by: Kazemi, Mohammad, et al.
Published: (2024)

Capacity Bounds on Doppler OFDM Channels
by: Orellana, Pablo, et al.
Published: (2026)

Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
by: Barletta, Luca, et al.
Published: (2024)

Improved Capacity Upper Bounds for the Deletion Channel using a Parallelized Blahut-Arimoto Algorithm
by: Pinto, Martim, et al.
Published: (2026)

Refinements and Generalizations of the Shannon Lower Bound via Extensions of the Kraft Inequality
by: Merhav, Neri
Published: (2025)

The Case for Cardinality Lower Bounds
by: Stoian, Mihail, et al.
Published: (2026)

Tail-Erasure-Correcting Codes
by: Moav, Boaz, et al.
Published: (2024)

Information Lower Bounds for Robust Mean Estimation
by: Degenne, Rémy, et al.
Published: (2024)