Covering code constructions obtaining new codes from starting ones were developed during last years. In this work we propose new constructions of such kind. New linear and nonlinear covering codes and an infinite families of those are obtained with the help of constructions proposed. A table of new upper bounds on the length function is given.

Let [ ] denote a linear code over with length , codimension , and covering radius . We use a modification of constructions of [2 +1 2 3] 2 and [3 +1 3 5] 3 codes ( 5) to produce infinite families of good codes with covering radius 2 and 3 and codimension .

We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...

We find the generating function of self-avoiding walks (SAWs) and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as SAWs, self-avoiding polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails o...

In this paper we propose a new kind of rules inside the regions of a P system. We have called them covering rules due to the fact that, if selected, they can manage all the objects of the region in an exhaustive manner (i.e., they cover all the objects of the region). First, we propose the formal definition of the rules and different ways of using them. This will introduce a second degree of no...

We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...

Pneumococcal surface protein A (PspA) elicits protection in mice against fatal bacteremia and sepsis caused by genetically diverse pneumococci and protects against carriage and lung infection. We determined the PspA families of invasive isolates of Streptococcus pneumoniae recovered from Colombian children <5 years of age. That 97.5% of Colombian isolates belong to PspA families 1 and 2 support...

A lattice in euclidean space which is an orthogonal sum of nontrivial sublattices is called decomposable. We present an algorithm to construct a lattice’s decomposition into indecomposable sublattices. Similar methods are used to prove a covering theorem for generating systems of lattices and to speed up variations of the LLL algorithm for the computation of lattice bases from large generating ...

A species checklist is presented for Finland covering seven smaller families of Opomyzoidea: Anthomyzidae, Asteiidae, Aulacigastridae, Clusiidae, Odiniidae, Opomyzidae and Periscelididae (Diptera).