Results 21 to 30 of about 480,328 (233)
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes [PDF]
arXiv admin note: text overlap with arXiv:0906 ...
Lopez-Permouth, Sergio R. +3 more
openaire +3 more sources
Repeated-root constacyclic codes of length 3lp and their dual codes
Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\langle \rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\langle ^{3lp^{s}}\rangle$, where $ $ is a primitive $(q-1)$th root of unity.
Li Liu +3 more
openaire +3 more sources
Fast and accurate evaluation of Wigner 3j, 6j, and 9j symbols using prime factorisation and multi-word integer arithmetic [PDF]
We present an efficient implementation for the evaluation of Wigner 3j, 6j, and 9j symbols. These represent numerical transformation coefficients that are used in the quantum theory of angular momentum.
Forssén, C., Johansson, H. T.
core +2 more sources
AMDS Symbol-Pair Codes from Repeated-Root Cyclic Codes
arXiv admin note: text overlap with arXiv:2010.04329.
openaire +2 more sources
b-Symbol Distance Distribution of Repeated-Root Cyclic Codes [PDF]
6 ...
Mostafanasab, Hojjat +1 more
openaire +2 more sources
Repeated-root constacyclic codes of length 4ℓp
Constacyclic codes form a well-known class of linear codes, and are generalizations of cyclic and negacyclic codes. In this paper, we determine generator polynomials of all constacyclic codes of length 4 ź m p n over the finite field F q with q elements, where p , ź are distinct odd primes, q is a power of p and m , n are positive integers.
Anuradha Sharma, Saroj Rani
openaire +1 more source
Extrinsic Calibration for a Modular 3D Scanning Quality Validation Platform with a 3D Checkerboard
Optical 3D scanning applications are increasingly used in various medical fields. Setups involving multiple adjustable systems require repeated extrinsic calibration between patients.
Mirko Kaiser +6 more
doaj +1 more source
Improving multivariate Horner schemes with Monte Carlo tree search
Optimizing the cost of evaluating a polynomial is a classic problem in computer science. For polynomials in one variable, Horner's method provides a scheme for producing a computationally efficient form.
A. Plaat +18 more
core +1 more source
Accurate calibration of the 3-dB bandwidth of analog baseband (ABB) filters is critical in modern wireless transceivers. Existing replica-based and loopback-based calibration methods require substantial auxiliary hardware, impose matching constraints, or
Kyudong Kim, Jaeeun Jang
doaj +1 more source
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ling, S., Niederreiter, H., Solé, P.
openaire +3 more sources

