Results 51 to 60 of about 281,189 (325)
IET Information Security, 2021 Three closely related polynomial‐based group key pre‐distribution schemes have recently been proposed, aimed specifically at wireless sensor networks.
Chris J Mitchell
doaj +1 more source
A Unique Representation of Cyclic Codes over GR(pn,r)
Axioms, 2022 Let R be a Galois ring, GR(pn,r), of characteristic pn and of order pnr. In this article, we study cyclic codes of arbitrary length, N, over R. We use discrete Fourier transform (DFT) to determine a unique representation of cyclic codes of length, N, in ...
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
The Electronic Journal of Combinatorics, 1998 Let ${\bf F}(n)$ be a family of partitions of $n$ and let ${\bf F}(n,d)$ denote the set of partitions in ${\bf F}(n)$ with Durfee square of size $d$. We define the Durfee polynomial of ${\bf F}(n)$ to be the polynomial $P_{{\bf F},n}= \sum |{\bf F}(n,d)|y^d$, where $ 0 \leq d \leq \lfloor \sqrt{n} \rfloor.$ The work in this paper is motivated by ...
E. Rodney Canfield +2 more
openaire +2 more sources
Extremal Polynomials Connected with Zolotarev Polynomials [PDF]
Vestnik St. Petersburg University, Mathematics, 2020 In this paper, the authors deal with the following extremal problem: Using the notation \(P_{n}(x,t)=x_{0}t^{n}+x_{1}t^{n-1}+\dotsb+x_{n}\) for a polynomial of degree not greater than \(n\), \(n\ge 2\) and given real parameters \[ a>1,\quad b0,\quad A \] maximize the magnitude of \(P_{n}(x,b)\) at the following constraints \[ |P_{n}(x,t)|\le M\quad ...
Agafonova, I. V., Malozemov, V. N.
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Digital technologies hold promise for transforming healthcare by enhancing personalized treatments and offer valuable opportunities to improve patient care. Here, we evaluated several novel, self‐administered, home‐based, digital endpoints for their association with corresponding conventional standard clinical measures (primary) in ...
Arne Mueller +14 more
wiley +1 more source
Memory‐constrained implementation of lattice‐based encryption scheme on standard Java Card platform
IET Information Security, 2021 The lattice‐based encryption scheme has high efficiency and reliability, and it can be run on small devices with limited memory capacity and computational resources such as sensor nodes or smart cards.
Ye Yuan +4 more
doaj +1 more source
Mathematics, 2023 In order to propose a deeper analysis of the general quartic equation with real coefficients, the analytical solutions for all cubic and quartic equations were reviewed here; then, it was found that there can only be one form of the resolvent cubic that ...
Mauricio Chávez-Pichardo +4 more
doaj +1 more source
Recurrence coefficients for discrete orthonormal polynomials and the Painlevé equations [PDF]
, 2013 We investigate semi-classical generalizations of the Charlier and Meixner polynomials, which are discrete orthogonal polynomials that satisfy three-term recurrence relations.
Clarkson, Peter
core +1 more source
A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi +17 more
wiley +1 more source
Some inequalities for maximum modules of polynomials
International Journal of Mathematics and Mathematical Sciences, 1991 A well-known result of Ankeney and Rivlin states that if p(z) is a polynomial of degree n, such that p(z)≠0 in |z|
N. K. Govil
doaj +1 more source