The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems. Scientists involved in discrete mathematics, combinatorics, computer science, information theory, geometry, algebra or number theory will find the book of particular significance. It is designed both as an introductory textbook for the beginner and as a reference book for the expert mathematician and engineer. A number of unsolved problems suitable for research projects are also discussed.

A translation surface is obtained by taking plane polygons and gluing their edges by translations. We ask which subgroups of the Veech group of a primitive translation surface can be realised via a translation covering. For many primitive surfaces we prove that partition stabilising congruence subgroups are the Veech group of a covering surface. We also address the coverings via their monodromy groups and present examples of cyclic coverings in short orbits, i.e. with large Veech groups.

Recently, various types of single valued neutrosophic (SVN) rough set models were presented based on the same inclusion relation. However, there is another SVN inclusion relation in SVN sets. In this paper, we propose a new type of SVN covering rough set model based on the new inclusion relation.

This work studies abelian branched coverings of smooth complex projective surfaces from the topological viewpoint. Geometric information about the coverings (such as the first Betti numbers of a smooth model or intersections of embedded curves) is related to topological and combinatorial information about the base space and branch locus. Special attention is given to examples in which the base space is the complex projective plane and the branch locus is a configuration of lines.