We study the computational problem of determining covering radius a rational polytope. This parameter is defined as minimal dilation factor that needed for lattice translates correspondingly dilated polytope to cover whole space. As our main result, we describe new algorithm this problem, which simpler, more efficient and easier implement than only prior Kannan (1992). Motivated by variant famo...

Let AR,q denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area Covering Codes. In this paper, infinite sets of families AR,q, where R is fixed but q ranges over an infinite set of pr...

In this paper we define Z2Z4−Simplex and MacDonald Codes of type α and β and we give the covering radius of these codes.

An infinite class of binary linear completely regular and completely transitive codes is given. The covering radius of these codes is growing with the length of the code.

This paper presents the design, modeling, and testing of a flexible tactile sensor and its applications. This sensor is made of polymer materials and can detect the 2D surface texture image and contact-force estimation. The sensing mechanism is based on the novel contact deflection effect of a membrane. We measure the deflection of the membrane with measuring the strain in the membrane with emb...