:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Leyva-Acosta, Zoe, Yeomans, Eduardo Acuña, Hernandez-Quiroz, Francisco
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Information Theory
Accesso online:	https://arxiv.org/abs/2407.21162
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Space-bounded online Kolmogorov complexity is additive
di: Bauwens, Bruno, et al.
Pubblicazione: (2025)

Worst-case optimal adaptive alphabetic prefix-free coding
di: Gagie, Travis
Pubblicazione: (2021)

All Kolmogorov complexity functions are optimal, but are some more optimal?
di: Bauwens, Bruno, et al.
Pubblicazione: (2025)

Coding methods for string reconstruction from erroneous prefix-suffix compositions
di: Chen, Zitan
Pubblicazione: (2025)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
di: Yang, Yaoyu, et al.
Pubblicazione: (2024)

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
di: Abrahão, Felipe S., et al.
Pubblicazione: (2024)

Kolmogorov complexity as a combinatorial tool
di: Shen, Alexander
Pubblicazione: (2024)

A look at the Kolmogorov complexity of finite groupoids and algebras
di: Cardó, Carles
Pubblicazione: (2023)

Kolmogorov--Nagumo Mean Frameworks for Conditional Entropy
di: Kamatsuka, Akira, et al.
Pubblicazione: (2026)

High-probability sample complexities for policy evaluation with linear function approximation
di: Li, Gen, et al.
Pubblicazione: (2023)

Infinite families of optimal and minimal codes over rings using simplicial complexes
di: Wu, Yanan, et al.
Pubblicazione: (2024)

Neural Weight Norm = Kolmogorov Complexity
di: Musat, Tiberiu
Pubblicazione: (2026)

Highly-sensitive measure of complexity captures boolean networks regimes and temporal order more optimally
di: Luevano, Manuel de J., et al.
Pubblicazione: (2024)

On the existence of Ulanowicz's optimal structural resilience in complex networks
di: Wei, Si-Yao, et al.
Pubblicazione: (2026)

Quantifying coherence with quantum addition
di: Mukhopadhyay, Chiranjib, et al.
Pubblicazione: (2018)

Kolmogorov-Loveland betting strategies lose the Betting game on open sets
di: Petrović, Tomislav
Pubblicazione: (2024)

The geometry of intersecting codes and applications to additive combinatorics and factorization theory
di: Borello, Martino, et al.
Pubblicazione: (2024)

An additive refinement of quantum channel capacities
di: Wang, D. -S.
Pubblicazione: (2022)

Computing efficiently a parity-check matrix for Zps-additive codes
di: Fernández-Córdoba, Cristina, et al.
Pubblicazione: (2024)

Secret sharing with additive access structures from correlated random variables
di: Miller, David, et al.
Pubblicazione: (2026)

Initialization and Rate-Quality Functions for Generative Network Layer Protocols
di: Thorsager, Mathias, et al.
Pubblicazione: (2026)

Is speckle noise more challenging to mitigate than additive noise?
di: Malekian, Reihaneh, et al.
Pubblicazione: (2024)

Is star complexity a proxy for information based complexity of graphs?
di: Standish, Russell K.
Pubblicazione: (2025)

Order-theoretic models for decision-making: Learning, optimization, complexity and computation
di: Hack, Pedro
Pubblicazione: (2024)

The Kolmogorov Complexity of Irish traditional dance music
di: McGettrick, Michael, et al.
Pubblicazione: (2024)

On the best approximation by finite Gaussian mixtures
di: Ma, Yun, et al.
Pubblicazione: (2024)

Generative Network Layer for Communication Systems with Artificial Intelligence
di: Thorsager, Mathias, et al.
Pubblicazione: (2023)

On Eisenstein additive codes over chain rings and linear codes over mixed alphabets
di: Jose, Leijo, et al.
Pubblicazione: (2024)

The entropic doubling constant and robustness of Gaussian codebooks for additive-noise channels
di: Gavalakis, Lampros, et al.
Pubblicazione: (2024)

$\mathbb{F}_q\mathbb{F}_{q^2}$-additive cyclic codes and their Gray images
di: Yadav, Ankit, et al.
Pubblicazione: (2025)

On polycyclic linear and additive codes associated to a trinomial over a finite chain ring
di: Chibloun, Abdelghaffar, et al.
Pubblicazione: (2025)

Continual Deep Reinforcement Learning for Decentralized Satellite Routing
di: Lozano-Cuadra, Federico, et al.
Pubblicazione: (2024)

A leave-one-out approach to approximate message passing
di: Bao, Zhigang, et al.
Pubblicazione: (2023)

The complexity of elliptic normal bases
di: Panario, Daniel, et al.
Pubblicazione: (2024)

Information entropy of complex probability
di: Li, Chan, et al.
Pubblicazione: (2025)

An optimal tradeoff between entanglement and copy complexity for state tomography
di: Chen, Sitan, et al.
Pubblicazione: (2024)

Gaussian random projections of convex cones: approximate kinematic formulae and applications
di: Han, Qiyang, et al.
Pubblicazione: (2022)

Sketching sparse low-rank matrices with near-optimal sample- and time-complexity using message passing
di: Liu, Xiaoqi, et al.
Pubblicazione: (2022)

Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games
di: Rigas, Pete
Pubblicazione: (2023)

Total/dual correlation/coherence, redundancy/synergy, complexity, and O-information for real and complex valued multivariate data
di: Pascual-Marqui, Roberto D., et al.
Pubblicazione: (2025)