Results 21 to 30 of about 323 (57)
On deep holes of standard Reed-Solomon codes
, 2012 Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For
Hong, Shaofang, Wu, Rongjun
core +1 more source
On Taking Square Roots without Quadratic Nonresidues over Finite Fields
, 2009 We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary.
Sze, Tsz-Wo
core +2 more sources
Veterinary Dermatology, Volume 35, Issue 4, Page 418-431, August 2024.Background – Diagnosis of canine adverse food reactions (AFRs) is based on vague criteria, such as ‘>50% improvement’ during elimination diet trial (EDT) followed by ‘deterioration’ during provocation test (PT). Objective – The objective of the study was to use predefined criteria to evaluate response during EDT [i.e., Owner Global Assessment of ...
Evi I. Sofou +4 more
wiley +1 more source
Veterinary Dermatology, Volume 35, Issue 4, Page 375-385, August 2024.Background – Perianal fistulas are painful ulcers or sinus tracts that disproportionately affect German shepherd dogs and are proposed as a spontaneous animal model of fistulising Crohn's disease. Objectives – To characterise the rectal and cutaneous microbiota in German shepherd dogs with perianal fistulas and to investigate longitudinal shifts with ...
Christine L. Cain +6 more
wiley +1 more source
Arithmetic Properties of Periodic Maps
, 2004 Let $\psi_1,...,\psi_k$ be periodic maps from $\Bbb Z$ to a field of characteristic p (where p is zero or a prime). Assume that positive integers $n_1,...,n_k$ not divisible by p are their periods respectively.
Sun, Zhi-Wei
core +4 more sources
Forum of Mathematics, PiIn 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source
Hypergeometric L-functions in average polynomial time
, 2020 We describe an algorithm for computing, for all primes $p \leq X$, the mod-$p$ reduction of the trace of Frobenius at $p$ of a fixed hypergeometric motive in time quasilinear in $X$.
Costa, Edgar +2 more
core
Constructing Carmichael numbers through improved subset-product algorithms
, 2013 We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two new algorithms
Alford, W. R. +3 more
core
Walking through the Gaussian Primes
, 2019 The Gaussian Moat problem asks whether one can walk to infinity in the Gaussian integers using the Gaussian primes as stepping stones and taking bounded length steps or not.
Das, Madhuparna
core
The anti-inflammatory effect of hydrogen sulphide on acute necrotizing pancreatitis in rats. [PDF]
Turk J Surg, 2017 Sağlam K +4 more
europepmc +1 more source