Results 41 to 50 of about 978,152 (207)
On the Computation of Tensor Functions under Tensor‐Tensor Multiplications with Linear Maps
Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.ABSTRACT In this paper, we study the computation of both algebraic and non‐algebraic tensor functions under the tensor‐tensor multiplication with linear maps. In the case of algebraic tensor functions, we prove that the asymptotic exponent of both the tensor‐tensor multiplication and the tensor polynomial evaluation problem under this multiplication is
Jeong‐Hoon Ju, Susana López‐Moreno
wiley +1 more source
Mathematics, 2021 In heterogeneous networks (HetNets), non-orthogonal multiple access (NOMA) has recently been proposed for hybrid-access small-cells, promising a manifold network capacity compared to OMA.
M. Rehan Usman +6 more
doaj +1 more source
Advanced Quantum Technologies, Volume 9, Issue 6, June 2026.Prime number identification is implemented on IBM Quantum processors through entanglement dynamics. The PIED protocol encodes arithmetic information in the reduced purity of a bipartite quantum system, whose Fourier spectrum reveals prime/composite signatures.
Victor F. dos Santos +3 more
wiley +1 more source
Estudo da transformada de Walsh-Hadamard aplicada à transmissão OFDM [PDF]
, 2006 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Elétrica.Esta dissertação apresenta um estudo da aplicação da Transformada de Walsh-Hadamard (WHT) em diferentes sistemas OFDM ...
Doniak, Marcio Henrique
core
Quasicyclic dyadic codes in Walsh-Hadamard domain
, 2001 A dyadic code is a code which is closed under all dyadic shifts. A quasicyclic dyadic (QCD) code is one which is both quasicyclic and dyadic. We obtain a simple characterization of all QCD codes over any field of odd characteristic using the Walsh ...
Ho Lee, Moon +3 more
core +2 more sources
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform [PDF]
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015 For every fixed constant α > 0, we design an algorithm for computing the k -sparse Walsh-Hadamard transform (i.e., Discrete Fourier Transform over the Boolean cube) of an N -dimensional vector x ∈ R N in time
Mahdi Cheraghchi, Piotr Indyk
openaire +7 more sources
Annalen der Physik, Volume 538, Issue 4, April 2026.The Prouhet‐Thue‐Morse (PTM) sequence emerges as a unifying thread across quantum error correction, noise‐resistant memories, spin‐chain dynamics, quantum chaos, and Dirichlet links to the Riemann zeta function. Mapping PTM‐encoded logical states onto qubit and qudit architectures uncovers symmetry‐protected resilience and multifractal signatures ...
Denis Janković +3 more
wiley +1 more source
Natural-ordered complex Hadamard transform
, 2009 This paper presents a new transform known as natural-ordered complex Hadamard transform (NCHT) which is derived from the Walsh–Hadamard transform (WHT) through the direct block matrix operation.
Ng, Boon Poh +3 more
core +1 more source
IET Communications, Volume 20, Issue 1, January/December 2026.This paper addresses the blind identification of the feedback polynomial for a self‐synchronous scrambler applied to Reed–Solomon codes in non‐cooperative communications. We propose a novel fault‐tolerant method that leverages soft‐decision information to construct an average parity check confidence metric, derives its optimal detection threshold and ...
Yong Ding +5 more
wiley +1 more source
Design and Implementation of a Speller based on EMG Signal
International Journal of Computational Intelligence Systems, 2017 A speller is a communication device designed for those suffering from neuromuscular disorders having difficulty to speak. An EMG based design is proposed which uses eye blinks for character selection that offers high accuracy and more comfort to the user.
P M Shyam Prasad +3 more
doaj +1 more source