On the positive and the inversion complexity of Boolean functions
On the pseudoinverse of a sum of symmetric matrices with applications to estimation
On the Quotient Function Employed in the Blind Source Separation Problem
MSC 2010: 42C40, 94A12On the blind source separation problem, there is a method to use the quotient function of complex valued time-frequency informations of two ob-served signals. By studying the quotient function, we can estimate the number of sources under some assumptions. In our previous papers, we gave a mathematical formulation which is available for the sources with-out time delay. However, in general, we can not ignore the time delay. In this paper, we will reformulate our basic theorems...
On the reception of binary phase shift keyed sequences by an autocorrelation receiver
On the regular Sturm-Liouville transform.
On the regularity condition for decomposable communication channels
On the relationship between quasi-affine systems and the à trous algorithm.
We seek to demonstrate a connection between refinable quasi-affine systems and the discrete wavelet transform known as the à trous algorithm. We begin with an introduction of the bracket product, which is the major tool in our analysis. Using multiresolution operators, we then proceed to reinvestigate the equivalence of the duality of refinable affine frames and their quasi-affine counterparts associated with a fairly general class of scaling functions that includes the class of compactly supported...
On the Rényi dimension
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.