Results 51 to 60 of about 12,236 (229)
For nonzero coprime integers a and b, a positive integer l is said to be good with respect to a and b if there exists a positive integer k such that l divides ak + bk. Since the early 1990s, the notion of good integers has attracted considerable attention from researchers. This continued interest stems from both their elegant number‐theoretic structure
Somphong Jitman, Anwar Saleh Alwardi
wiley +1 more source
PROPERTIES OF GROUPS G OF DOUBLE ERRORS AND ITS INVARIANTS IN BCH CODES
The goal of the work is the further extending the scope of application of code automorthism in methods and algorithms of error correction by these codes. The effectiveness of such approach was demonstrated by norm of syndrome theory that was developed by
V. A. Lipnitskij, A. V. Serada
doaj +1 more source
Self-dual cyclic codes over finite chain rings [PDF]
Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic codes of length
Chen, Bocong, Ling, San, Zhang, Guanghui
core
The cyclotomic polynomial topologically [PDF]
Abstract. We interpret the coefficients of the cyclotomic polynomial in terms of simplicial homology.
Musiker, Gregg, Reiner, Victor
openaire +2 more sources
Chebotarev's theorem for cyclic groups of order pq$pq$ and an uncertainty principle
Abstract Let p$p$ be a prime number and ζp$\zeta _p$ a primitive p$p$th root of unity. Chebotarev's theorem states that every square submatrix of the p×p$p \times p$ matrix (ζpij)i,j=0p−1$(\zeta _p^{ij})_{i,j=0}^{p-1}$ is nonsingular. In this paper, we prove the same for principal submatrices of (ζnij)i,j=0n−1$(\zeta _n^{ij})_{i,j=0}^{n-1}$, when n=pr ...
Maria Loukaki
wiley +1 more source
q-Analogue of a binomial coefficient congruence
We establish a q-analogue of the congruence (papb)≡(ab) (modp2) where p is a prime and a and b are positive integers.
W. Edwin Clark
doaj +1 more source
General Gate Teleportation and the Inner Structure of Its Clifford Hierarchies
ABSTRACT The quantum gate teleportation mechanism allows for the fault‐tolerant implementation of “Clifford hierarchies” of gates assuming, among other things, a fault‐tolerant implementation of the Pauli gates. We discuss how this method can be extended to assume the fault‐tolerant implementation of any orthogonal unitary basis of operators, in such a
Samuel González‐Castillo +3 more
wiley +1 more source
A Note on Factorization and the Number of Irreducible Factors of xn − λ over Finite Fields
Let Fq be a finite field, and let n be a positive integer such that gcd(q,n)=1. The irreducible factors of xn−1 and xn−λ are fundamental concepts with wide applications in cyclic codes and constacyclic codes.
Jinle Liu, Hongfeng Wu
doaj +1 more source
Growth problems in diagram categories
Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley +1 more source
Unitary cyclotomic polynomials
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and Kronecker polynomials.
Moree, Pieter, Tóth, László
openaire +4 more sources

