The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci. 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [IEEE Commun. Lett. 3 (1999) 245–247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer...
In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci.
411 (2010) 1785–1792] a bideterministic transducer is defined for
the bidirectional deciphering of words by the method introduced by Girod [IEEE
Commun. Lett. 3 (1999) 245–247]. Such a method is defined using
prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a
transducer that allows both right-to-left and left-to-right decoding by this...
In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci.
411 (2010) 1785–1792] a bideterministic transducer is defined for
the bidirectional deciphering of words by the method introduced by Girod [IEEE
Commun. Lett. 3 (1999) 245–247]. Such a method is defined using
prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a
transducer that allows both right-to-left and left-to-right decoding by this...
We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.
We are extending to linear recurrent codes, i.e., to
time-varying convolutional codes, most of the classic structural
properties of fixed convolutional codes. We are also proposing a
new connection between fixed convolutional codes and linear block
codes. These results are obtained thanks to a module-theoretic
framework which has been previously developed for linear control.
Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between
vector spaces determined by the lengths of the codes are applied. It is proven
that the weight distributions of the coset leaders don’t depend on the word
length, but on generator polynomials only. In particular, we prove that every
constacyclic code has the same weight distribution...
A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular,...
Currently displaying 41 –
49 of
49