:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Lopez, Juan Pablo
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2408.11154
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tight relations and equivalences between smooth relative entropies
by: Regula, Bartosz, et al.
Published: (2025)

Tightening continuity bounds for entropies and bounds on quantum capacities
by: Jabbour, Michael G., et al.
Published: (2023)

Tight bounds for stream decodable error-correcting codes
by: Gupta, Meghal, et al.
Published: (2024)

Tight lower bound on the error exponent of classical-quantum channels
by: Renes, Joseph M.
Published: (2024)

Finite de Finetti bounds in relative entropy
by: Gavalakis, Lampros, et al.
Published: (2024)

Tight bounds on Pauli channel learning without entanglement
by: Chen, Senrui, et al.
Published: (2023)

Overfitting has a limitation: a model-independent generalization gap bound based on Rényi entropy
by: Suzuki, Atsushi, et al.
Published: (2025)

Computational hardness of estimating quantum entropies via binary entropy bounds
by: Liu, Yupan
Published: (2026)

Smooth min-entropy lower bounds for approximation chains
by: Marwah, Ashutosh, et al.
Published: (2023)

Rethinking quantum smooth entropies: Tight one-shot analysis of quantum privacy amplification
by: Regula, Bartosz, et al.
Published: (2026)

A series of maximum entropy upper bounds of the differential entropy
by: Nielsen, Frank, et al.
Published: (2016)

Semicontinuity bounds for the von Neumann entropy and partial majorization
by: Shirokov, M. E.
Published: (2025)

The augmented NLP bound for maximum-entropy remote sampling
by: Ponte, Gabriel, et al.
Published: (2026)

Optimal continuity bound for the von Neumann entropy under energy constraints
by: Becker, S., et al.
Published: (2024)

Expressing entropy and cross-entropy in expansions of common meadows
by: Bergstra, Jan A, et al.
Published: (2025)

Tight frames over the quaternions and equiangular lines
by: Waldron, Shayne
Published: (2020)

Shannon Weights for binary dynamical recurrent sources of zero entropy
by: Akhavi, Ali, et al.
Published: (2025)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
by: Matt, Hannes, et al.
Published: (2025)

Quantum-Kaniadakis entropy as a measure of quantum correlations through implicit bounds
by: Iyer, Narayan S, et al.
Published: (2025)

Relative entropy bounds for sampling with and without replacement
by: Johnson, Oliver, et al.
Published: (2024)

Is segregation encoded in urban form? An entropy-based analysis
by: Netto, Vinicius M., et al.
Published: (2026)

A remark on conditional entropy
by: Wang, Adam
Published: (2024)

Average entropy of Gaussian mixtures
by: Joudeh, Basheer, et al.
Published: (2024)

Information entropy of complex probability
by: Li, Chan, et al.
Published: (2025)

Composite Fading Models based on Inverse Gamma Shadowing: Theory and Validation
by: Ramírez-Espinosa, Pablo, et al.
Published: (2019)

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

Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment
by: Tan, Vincent Y. F., et al.
Published: (2025)

Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)

A Tight Quantum Algorithm for Multiple Collision Search
by: Bonnetain, Xavier, et al.
Published: (2025)

Tight Quantum Time-Space Tradeoffs for Permutation Inversion
by: Akshima, et al.
Published: (2025)

Numerical evaluation of Gaussian mixture entropy
by: Joudeh, Basheer, et al.
Published: (2025)

A complete characterisation of conditional entropies
by: Rubboli, Roberto, et al.
Published: (2026)

Achieving $α$-Fairness in Clustered Cell-Free Networking: A Tight Relaxation Approach
by: Deng, Chaowen, et al.
Published: (2026)

Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes
by: Jiang, Zhengyi, et al.
Published: (2026)

Tight any-shot quantum decoupling
by: Berta, Mario, et al.
Published: (2026)

New bounds for codes over Gaussian integers based on the Mannheim distance
by: Shi, Minjia, et al.
Published: (2026)

Derivatives of entropy and the MMSE conjecture
by: Mansanarez, Paul, et al.
Published: (2023)

Maximum entropy based testing in network models: ERGMs and constrained optimization
by: Ghosh, Subhro, et al.
Published: (2026)

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

A Tight Context-aware Privacy Bound for Histogram Publication
by: Saeidian, Sara, et al.
Published: (2025)