Results 1 to 10 of about 258,202 (236)
Changes and contributions to the gender pay gap in surgery in Canada: a repeated cross-sectional analysis from 1996 to 2020 [PDF]
Objectives Occupational gender segregation is a contributing factor to gender pay inequity in medicine but has not been thoroughly characterised. We assessed the historical relationship between surgeon sex, type of work and value of procedural payments ...
Tara Kiran +3 more
doaj +2 more sources
Repeated-root constacyclic codes of length $ p_1p_2^t p^s $ and their dual codes
Let $ \mathbb{F}_q $ be the finite field with $ q = p^{k} $ elements, and $ p_{1}, p_{2} $ be two distinct prime numbers different from $ p $. In this paper, we first calculate all the $ q $-cyclotomic cosets modulo $ p_1p_2^t $ as a preparation for the ...
Hongfeng Wu, Li Zhu
doaj +1 more source
Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over
Let p be an odd prime, where ϑ and m are positive integers. Let ψ be a nonzero element of the finite field Fq, where q=pm, and R=Fq+uFq+u2Fq(u3=0). In this paper, we determine completely the symbol-triple distances of all ψ-constacyclic codes of length ...
Hai Q. Dinh +3 more
doaj +1 more source
Let p be a prime, s, m be positive integers, γ be a nonzero element of the finite field Fpm, and let R=Fpm[u]/⟨u3⟩ be the finite commutative chain ring.
Mohammed E. Charkani +3 more
doaj +1 more source
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj +1 more source
Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2
Let p be an odd prime, and Fp(m) is the finite field of pm elements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2ps over Fp(m) are established.
Hai Q. Dinh +2 more
doaj +1 more source
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length $6p^{s}$ over $\mathbb F_{p^{m}}$ .
Hai Q. Dinh +3 more
doaj +1 more source
Unique Generators for Cyclic Codes of Arbitrary Length over Fpmu/u3 and Their Applications
Cyclic codes play a very important role in the history of coding theory since they have good algebraic structures that can be widely used in coding and decoding.
Hongju Li +3 more
doaj +1 more source
On a Family of Quantum Synchronizable Codes Based on the
In this paper, we propose a family of quantum synchronizable codes from repeated-root cyclic codes and constacyclic codes. This family of quantum synchronizable codes are based on (λ(u + v)|u - v) construction which is constructed from ...
Chao Du +4 more
doaj +1 more source
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m
Let $p\not =5$ be any odd prime. Using the algebraic structures of all cyclic codes of length $5p^{s}$ over the finite commutative chain ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ , in this paper, the exact values of Hamming ...
Hai Q. Dinh +3 more
doaj +1 more source

