Almwct--Two new computationally efficient afgorithms are developed for fmdiug tke exact burst-comxtiug limit of a cyclic code. The first algorithm is based on testing tbe culumn rank of certain submatrices of the parity& matrix of the code. Aa auxiliary result is a proof that every cyclic (n,k) code, with a min immu distauce of at least three, CorrecQ at least all bursts of length L(n-2k+l)/2J ...

We give explicit lower bounds on the modular degree of a rational elliptic curve. The technique is via a convolution-type formula involving the symmetric-square L-function, for which an analogue of “no Siegel zeros” is known due to a result of Goldfeld, Hoffstein, and Lieman; our main task is to determine an explicit constant for their bound. Combined with an easy bound on the Faltings height i...

In this paper, we develop an algorithm for computing the zeros of a generalized state space model described by the matrix 5-tuple (E; A;B;C;D), where E may be a singular matrix but det(A ? E) 6 = 0. The characterization of these zeros is based on the system matrix of the corresponding 5-tuple. Both the characterization and the computational algorithm are extensions of equivalent results for sta...

Inequalities in access to health, reflecting shortages and inadequate geographical distribution of health professionals, have been indicated as a challenge for Brazil. This paper analyzes the geographical distribution of professionals of the Mais Médicos Program allocated in the Northeastern Region of Brazil, through a descriptive cross-sectional study. Secondary data provided by the Health Min...