Cover Image

The complexity of elliptic normal bases

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Panario, Daniel, Sall, Mohamadou, Wang, Qiang
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Quantum Codes from Group Ring Codes
by: Abdukhalikov, Kanat, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Causal Emergence 2.0: Quantifying emergent complexity
by: Hoel, Erik
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Layered Belief Propagation for Low-complexity Large MIMO Detection Based on Statistical Beams
by: Takahashi, Takumi, et al.
Published: (2018)