:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Matsushima, Hiroyasu, Tajima, Yusuke, Lu, Xiao-Nan, Jimbo, Masakazu
Format:	Preprint
Published:	2024
Subjects:	Computation Information Theory
Online Access:	https://arxiv.org/abs/2405.09455
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient designs for threshold group testing without gap
by: Bui, Thach V., et al.
Published: (2024)

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Non-Colluding and Colluding Servers
by: Miki, Atsushi, et al.
Published: (2024)

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Adversarial Servers
by: Miki, Atsushi, et al.
Published: (2025)

Derivation of Mutual Information and Linear Minimum Mean-Square Error for Viterbi Decoding of Convolutional Codes Using the Innovations Method
by: Tajima, Masato
Published: (2024)

Bayesian experimental design: grouped geometric pooled posterior via ensemble Kalman methods
by: Yang, Huchen, et al.
Published: (2026)

Error and Disturbance as Irreversibility with Applications: Unified Definition, Wigner--Araki--Yanase Theorem and Out-of-Time-Order Correlator
by: Emori, Haruki, et al.
Published: (2023)

Detection of Unobserved Common Causes based on NML Code in Discrete, Mixed, and Continuous Variables
by: Kobayashi, Masatoshi, et al.
Published: (2024)

Individual testing is optimal for nonadaptive group testing in the linear regime
by: Aldridge, Matthew
Published: (2018)

Small error algorithms for tropical group testing
by: Paligadu, Vivekanand, et al.
Published: (2023)

PoolPy: Automated combinatorial pooling for high-throughput molecular profiling
by: Talamanca, Lorenzo, et al.
Published: (2025)

Universal trade-off structure between symmetry, irreversibility, and quantum coherence in quantum processes
by: Tajima, Hiroyasu, et al.
Published: (2022)

Resource-Theoretic Quantifiers of Weak and Strong Symmetry Breaking: Strong Entanglement Asymmetry and Beyond
by: Kusuki, Yuya, et al.
Published: (2026)

Adversarially robust quantum state learning and testing
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Common TF-IDF variants arise as key components in the test statistic of a penalized likelihood-ratio test for word burstiness
by: Ahmed, Zeyad, et al.
Published: (2026)

The minimum distance of the antiprimitive BCH code with designed distance 3
by: Xu, Haojie, et al.
Published: (2025)

Demand Private Coded Caching: the Two-File Case
by: Lu, Qinyi, et al.
Published: (2024)

On Demand-Private Coded Caching With Multiple Demands
by: Lu, Qinyi, et al.
Published: (2026)

A Game-Theoretic Perspective for Efficient Modern Random Access
by: Hansen, Andreas Peter Juhl, et al.
Published: (2024)

When Efficient Communication Explains Convexity
by: Ranjan, Ashvin, et al.
Published: (2026)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
by: Liu, Yupan
Published: (2023)

Unitary designs in nearly optimal depth
by: Cui, Laura, et al.
Published: (2025)

Several new infinite families of NMDS codes with arbitrary dimensions supporting $t$-designs
by: Zhang, Yaozong, et al.
Published: (2025)

A Fisher's exact test justification of the TF-IDF term-weighting scheme
by: Sheridan, Paul, et al.
Published: (2025)

Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links
by: Lu, Qinyi, et al.
Published: (2024)

Demand Private Coded Caching: Small Cache Size
by: Lu, Qinyi, et al.
Published: (2025)

Weighted cycle-based identification of influential node groups in complex networks
by: Zheng, Wenxin, et al.
Published: (2025)

The dual codes of two families of BCH codes
by: Xu, Haojie, et al.
Published: (2024)

Consensus analysis of a two-step communication opinion dynamics model with group pressure and self-confidence
by: Wang, Wenjuan, et al.
Published: (2024)

Network two-sample test for block models
by: Nguen, Chung Kyong, et al.
Published: (2024)

Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
by: Jimbo, Takumi, et al.
Published: (2026)

Likelihood-free hypothesis testing
by: Gerber, Patrik Róbert, et al.
Published: (2022)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Expectations in Expectation Propagation
by: Zhao, Zilu, et al.
Published: (2025)

Generative Semantic Communication via Textual Prompts: Latency Performance Tradeoffs
by: Ren, Mengmeng, et al.
Published: (2024)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
by: Lou, Mengqi, et al.
Published: (2025)

Communication-Efficient Approximate Gradient Coding
by: Munim, Sifat, et al.
Published: (2026)

Fast Matrix Multiplication meets the Submodular Width
by: Abo-Khamis, Mahmoud, et al.
Published: (2024)

Universal tradeoff relations between resource cost and irreversibility of channels: General-resource Wigner-Araki-Yanase theorems and beyond
by: Tajima, Hiroyasu, et al.
Published: (2025)

Mobility operator service capacity sharing contract design to risk-pool against network disruptions
by: Pantelidis, Theodoros P., et al.
Published: (2020)

Bayesian Rao test for distributed target detection in interference and noise with limited training data
by: Xiao, Daipeng, et al.
Published: (2025)