The identifying code problem is a newly emerging search problem, challenging both from a theoretical and a computational point of view, even for special graphs like bipartite graphs. Hence, a typical line of attack for ...

This paper presents a novel multiple serial code concatenation (SCC) strategy to combat the error-floor problem in iterated sparse graph-based error correcting codes such as turbo product-codes (TPC) and low-density ...

A quantitative rationale for the evolution of the genetic code is developed considering the principle of minimal hardware. This principle defines an optimal code as one that minimizes for a given amount of information ...

The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite ...

In the search for a dynamic programming-based algorithm derived from the modular decomposition of graphs, we analyze the behavior of the identifying code number under disjoint union and join operations. This study lead us ...

Background. In a recent work I transformed a complex and integrated text like the International Code of Zoological Nomenclature into a network of interconnected parts of text. This new approach allowed understanding that ...

We report here two complete coding genome sequences of novel genotype GII.8 sapovirus strains identified in diarrhea samples collected from two Peruvian children. The complete coding genome sequences of both GII.8 variants ...

In spite of its importance for rock art studies, rock art motifs coding and classification process is not always made explicit. In this discussion of the process of rock art classification, we consider an exploratory ...

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group ...