:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Panario, Daniel, Sall, Mohamadou, Wang, Qiang
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Information Theory
Accesso online:	https://arxiv.org/abs/2401.11872
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On efficient normal bases over binary fields
di: Sall, Mohamadou, et al.
Pubblicazione: (2024)

Sharing the Path: A Threshold Scheme from Isogenies and Error Correcting Codes
di: Sall, Mohamadou, et al.
Pubblicazione: (2024)

Quantum Codes from Group Ring Codes
di: Abdukhalikov, Kanat, et al.
Pubblicazione: (2024)

Some New Non-binary Quantum Codes from One-generator Quasi-cyclic Codes
di: Bag, Tushar, et al.
Pubblicazione: (2024)

Existence of normal elements with prescribed norms
di: Fernandes, Arthur, et al.
Pubblicazione: (2024)

On the sample complexity of parameter estimation in logistic regression with normal design
di: Hsu, Daniel, et al.
Pubblicazione: (2023)

Infinitude of palindromic almost-prime numbers
di: Tuxanidy, Aleksandr, et al.
Pubblicazione: (2023)

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

On a class of twisted elliptic curve codes
di: Liu, Xiaofeng, et al.
Pubblicazione: (2025)

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

A new family of binary sequences with a low correlation via elliptic curves
di: Jin, Lingfei, et al.
Pubblicazione: (2024)

Null models for comparing information decomposition across complex systems
di: Liardi, Alberto, et al.
Pubblicazione: (2024)

On the Performance of Low-complexity Decoders of LDPC Codes
di: Peng, Qingqing, et al.
Pubblicazione: (2024)

Cumulants of multiinformation density in the case of a multivariate normal distribution
di: Marrelec, Guillaume, et al.
Pubblicazione: (2019)

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

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)

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)

Locally recoverable codes from elliptic surfaces with availability and hierarchical locality
di: Berardini, Elena, et al.
Pubblicazione: (2026)

Low-complexity Voronoi shaping for the Gaussian channel
di: Li, S., et al.
Pubblicazione: (2021)

Low-complexity eigenvector prediction-based precoding matrix prediction in massive MIMO with mobility
di: Qin, Ziao, et al.
Pubblicazione: (2023)

An additively optimal interpreter for approximating Kolmogorov prefix complexity
di: Leyva-Acosta, Zoe, et al.
Pubblicazione: (2024)

Causal Emergence 2.0: Quantifying emergent complexity
di: Hoel, Erik
Pubblicazione: (2025)

Conditional normality and finite-state dimensions revisited
di: Shen, Alexander
Pubblicazione: (2024)

On many-to-one mappings over finite fields
di: Zheng, Yanbin, et al.
Pubblicazione: (2024)

Optimal linear codes with few weights from simplicial complexes
di: Chen, Bing, et al.
Pubblicazione: (2024)

Algorithmic complexity of $β$-expansions and application to A/D conversion
di: Abadie, Valentin, et al.
Pubblicazione: (2024)

Construction of $(n,n)$-functions with low differential-linear uniformity
di: Xie, Xi, et al.
Pubblicazione: (2025)

On many-to-one property of generalized cyclotomic mappings
di: Zheng, Yanbin, et al.
Pubblicazione: (2025)

Large class of many-to-one mappings over quadratic extension of finite fields
di: Zheng, Yanbin, et al.
Pubblicazione: (2025)

Generalized informational functionals and new monotone measures of statistical complexity
di: Iagar, Razvan Gabriel, et al.
Pubblicazione: (2025)

The structure and enumeration of periodic binary sequences with high nonlinear complexity
di: Yuan, Qin, et al.
Pubblicazione: (2026)

Generalized LDPC codes with low-complexity decoding and fast convergence
di: Simegn, Dawit, et al.
Pubblicazione: (2025)

Divergences induced by dual subtractive and divisive normalizations of exponential families and their convex deformations
di: Nielsen, Frank
Pubblicazione: (2023)

Half-duplex communication complexity with adversary can be less than the classical communication complexity
di: Dektiarev, Mikhail, et al.
Pubblicazione: (2024)

Low-complexity tuning of pinching-antenna systems for integrated sensing and communication
di: Asaad, Saba, et al.
Pubblicazione: (2026)

A scalable estimator of higher-order information in complex dynamical systems
di: Liardi, Alberto, et al.
Pubblicazione: (2025)

Stable recovery of complex dictionary-sparse signals from phaseless measurements
di: Xia, Lianxing, et al.
Pubblicazione: (2025)

Data-Driven Neural Estimation of Indirect Rate-Distortion Function
di: Yu, Zichao, et al.
Pubblicazione: (2024)

On the $N$th $2$-adic complexity of binary sequences identified with algebraic $2$-adic integers
di: Chen, Zhixiong, et al.
Pubblicazione: (2025)

On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
di: Estevan, Asier, et al.
Pubblicazione: (2024)