On the singular decomposition of matrices.
On the size of transducers for bidirectional decoding of prefix codes
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...
On the size of transducers for bidirectional decoding of prefix codes
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...
On the size of transducers for bidirectional decoding of prefix codes
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...
On the stack-size of general tries
Digital trees or tries are a general purpose flexible data structure that implements dictionaries built on words. The present paper is focussed on the average-case analysis of an important parameter of this tree-structure, i.e., the stack-size. The stack-size of a tree is the memory needed by a storage-optimal preorder traversal. The analysis is carried out under a general model in which words are produced by a source (in the information-theoretic sense) that emits symbols. Under some natural assumptions...
On the Stack-Size of General Tries
Digital trees or tries are a general purpose flexible data structure that implements dictionaries built on words. The present paper is focussed on the average-case analysis of an important parameter of this tree-structure, i.e., the stack-size. The stack-size of a tree is the memory needed by a storage-optimal preorder traversal. The analysis is carried out under a general model in which words are produced by a source (in the information-theoretic sense) that emits symbols. Under some natural...
On the structure of linear recurrent error-control codes
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.
On the structure of linear recurrent error-control codes
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.
On the structure of some group codes.
On the suitability of the internet multimedia storage for steganographic information transfer in MP4 files
The aim of this work is to analyze suitability of existing internet multimedia storage services to use as a covert (steganographic) transmission channel. After general overview we focus specifically on the YouTube service. In particular, we study the feasibility of the recently proposed new steganographic technique [6] of hiding information directly in the structure of the mp4-encoded video file. Our statistical analysis of the set of 1000 video files stored by this service show the practical limitations...
On the synthesis of a class of interpolating circuits
On the uncertainty inequality as applied to discrete signals.
On the Weight Distribution of the Coset Leaders of Constacyclic Codes
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...
On Two Conditional Entropies without Probability.
On two special cases of the optimum decision rule for the radar signal processing
On typical encodings of multivariate ergodic sources
We show that the typical coordinate-wise encoding of multivariate ergodic source into prescribed alphabets has the entropy profile close to the convolution of the entropy profile of the source and the modular polymatroid that is determined by the cardinalities of the output alphabets. We show that the proportion of the exceptional encodings that are not close to the convolution goes to zero doubly exponentially. The result holds for a class of multivariate sources that satisfy asymptotic equipartition...
On weighted entropy of type and its generalizations
Belis and Guiasu studied a generalization of Shannon entropy as weighted or useful entropy. In this paper, the weighted entropy of type is defined and characterized and some if its properties are studied. Further generalizations involving more parameters of weighted entropy are also specified.
On Weighted Parametric Information Measure
One-adhesive polymatroids
Adhesive polymatroids were defined by F. Matúš motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single point outside their intersection. It is shown that two polymatroids are one-adhesive if and only if two closely related polymatroids have joint extension. Using this result, adhesive polymatroid pairs on a five-element set are characterized.
One-way communication complexity of symmetric boolean functions
We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...