AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group code, or equivalently, if and only if, it is a full uniform code. Thus, the structure for 3-infix—outfix code being a maximal code can be completely determined
AbstractSolid codes, a special class of bifix codes, were introduced recently in the connection with...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group ...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractA language L such that no word in L is a proper factor of another word in L is said to be an...
AbstractWe present, in the style of a survey, several results linked to the problem of embedding a b...
AbstractThe proposition “For composable thin codes Y and Z, the composition Y∘Z is maximal if and on...
AbstractWe define a code in a sofic shift as a set of blocks of symbols of the shift such that any b...
The canonical coding partition of a set of words is the finest partition such that the words contain...
AbstractIn this paper, we study the decompositions of recognizable strong maximal codes and obtain t...
In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
AbstractA language L ⊆ X* is called cohesive prefix code if xLy ∩ L ≠ ∅ implies that y = 1 and xL ⊆ ...
AbstractSolid codes, a special class of bifix codes, were introduced recently in the connection with...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group ...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractA language L such that no word in L is a proper factor of another word in L is said to be an...
AbstractWe present, in the style of a survey, several results linked to the problem of embedding a b...
AbstractThe proposition “For composable thin codes Y and Z, the composition Y∘Z is maximal if and on...
AbstractWe define a code in a sofic shift as a set of blocks of symbols of the shift such that any b...
The canonical coding partition of a set of words is the finest partition such that the words contain...
AbstractIn this paper, we study the decompositions of recognizable strong maximal codes and obtain t...
In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
AbstractA language L ⊆ X* is called cohesive prefix code if xLy ∩ L ≠ ∅ implies that y = 1 and xL ⊆ ...
AbstractSolid codes, a special class of bifix codes, were introduced recently in the connection with...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
DOI
Add to ORKG