:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Jakhar, Gunank, Kurri, Gowtham R., Chillara, Suryajith, Prabhakaran, Vinod M.
Format:	Preprint
Published:	2026
Subjects:	Information Theory Combinatorics
Online Access:	https://arxiv.org/abs/2601.15723
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

From Submodularity to Matrix Determinants: Strengthening Han's, Szász's, and Fischer's Inequalities
by: Jakhar, Gunank, et al.
Published: (2026)

Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications
by: Jakhar, Gunank, et al.
Published: (2025)

Maximal Guesswork Leakage
by: Kurri, Gowtham R., et al.
Published: (2024)

Secure Distributed Hypothesis Testing
by: Kurri, Gowtham R., et al.
Published: (2026)

Sun-Jafar-Type Schemes for Weak Private Information Retrieval
by: Anand, Chandan, et al.
Published: (2025)

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
by: Brakensiek, Joshua, et al.
Published: (2025)

Unifying Privacy Measures via Maximal $(α,β)$-Leakage (M$α$beL)
by: Gilani, Atefeh, et al.
Published: (2023)

Converse Bounds for Sun-Jafar-type Weak Private Information Retrieval
by: Anand, Chandan, et al.
Published: (2026)

Information Inequalities via Ideas from Additive Combinatorics
by: Lau, Chin Wa, et al.
Published: (2023)

Generalized Dual Discriminator GANs
by: Chandana, Penukonda Naga, et al.
Published: (2025)

On the Optimal Message Size in PIR Under Arbitrary Collusion Patterns
by: Dornadula, Guru S., et al.
Published: (2026)

Information Inequalities for Joint Distributions, with Interpretations and Applications
by: Madiman, Mokshay, et al.
Published: (2008)

A Combinatorial Perspective on Random Access Efficiency for DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

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

Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four: Part I: Problem Formulation and More
by: Liu, Shaocheng, et al.
Published: (2023)

Inequalities in Fourier analysis on binary cubes
by: Crmarić, Tonći, et al.
Published: (2025)

Two-weight rank-metric codes
by: Zullo, Ferdinando, et al.
Published: (2024)

The Closure of LCD-to-GI Reductions via Generalized Inner Products
by: Ishizuka, Keita
Published: (2026)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
by: Bertuzzo, Matteo, et al.
Published: (2026)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)

Memory Constrained Adversarial Hypothesis Testing
by: Managoli, Malhar A., et al.
Published: (2026)

Broadcast Channel Synthesis from Shared Randomness
by: Managoli, Malhar A., et al.
Published: (2024)

Rényi--Sobolev Inequalities and Connections to Spectral Graph Theory
by: Yu, Lei, et al.
Published: (2023)

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

Byzantine-Resilient Distributed Computation via Task Replication and Local Computations
by: Rajesh, Aayush, et al.
Published: (2025)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
by: Bar-Lev, Daniella
Published: (2026)

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

Generalized Orthogonal de Bruijn and Kautz Sequences
by: Chen, Yuan-Pon, et al.
Published: (2025)

Robust Hypothesis Testing with Abstention
by: Managoli, Malhar A., et al.
Published: (2025)

Edge inducibility via local directed graphs
by: Chao, Ting-Wei, et al.
Published: (2025)

On the Supremum of Singleton Ratios in Submodular Functions
by: Csirmaz, Laszlo
Published: (2026)

Universal Costas Matrices: Towards a General Framework for Costas Array Construction
by: Gulec, Fatih, et al.
Published: (2026)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
by: Yu, Wenjun, et al.
Published: (2025)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
by: Shen, Yuanting, et al.
Published: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)

Randomstrasse101: Open Problems of 2025
by: Bandeira, Afonso S., et al.
Published: (2026)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)

Randomstrasse101: Open Problems of 2024
by: Bandeira, Afonso S., et al.
Published: (2025)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)