Bounds for DNA codes with constant GC-content.
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The code problem for directed figures”
Bounds for DNA codes with constant GC-content.
General bounds for identifying codes in some infinite regular graphs.
Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Syntax-Directed Adjoint Fortran Code
Uwe Naumann, Jan Riehme (2007)
Computer Science and Information Systems
Similarity:
A simple proof for the existence of exponentially balanced Gray codes.
Suparta, I Nengah (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a complete set of operations for factorizing codes
Clelia De Felice (2006)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes)....
Defect theorem in the plane
Włodzimierz Moczurad (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider the defect theorem in the context of labelled polyominoes, , two-dimensional figures. The classical version of this property states that if a set of words is not a code then the words can be expressed as a product of at most words, the smaller set being a code. We survey several two-dimensional extensions exhibiting the boundaries where the theorem fails. In particular, we establish the defect property in the case of three dominoes ( × 1 or 1 × rectangles).
On equivalence of two tests for codes.
Falucskai, J. (2008)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
On optimal linear codes over .
Kanazawa, Rie, Maruta, Tatsuya (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a class of infinitary codes
Nguyen Huong Lâm, Do Long Van (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: