We determine exact values for the k-error linear complexity L k over the finite field F p of the Legendre sequence L of period p and the Sidelnikov sequence T of period p m − 1. The results arefor 1 ≤ k ≤ (p m − 3)/2 and L k (T ) = 0 for k ≥ (p m − 1)/2. In particular, we prove
Preoperative oral administration of a single dose of 40 mg prednisolone was beneficial to control short-term post-obturation pain after single-visit root canal treatment in patients with symptomatic irreversible pulpitis reducing pain incidence after 24 h by approximately 30% and postoperative analgesic intake by approximately 55%.
We study Boolean functions derived from Fermat quotients modulo p using the Legendre symbol. We prove bounds on several complexity measures for these Boolean functions: the nonlinearity, sparsity, average sensitivity, and combinatorial complexity. Our main tools are bounds on character sums of Fermat quotients modulo p.
Abstract. Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall's sextic residue sequence.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.