The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this study, we present a first attempt to apply the predictable component analysis to voice signals. This method projects the signals in components that optimize the normalized error variance, a quantity related to the predictability of the signals. Using the proposed method along with a wavelet decomposition model, we obtain voice signals estimations. These voice signals are sustained vowel "a"...
The concepts of ambiguity and deficiency for a given bijection on a finite Abelian group were recently introduced [13]. In this work we investigate the ambiguity and deficiency of some well-known polynomials which satisfy Dn(x+y, xy) = xn+yn for every x, y ∊ Fq and n ∊ N, as well as linearized polynomials and Dembowski-Ostrom polynomials (DO polynomials). For some specific values of n (related to...
In this paper we propose a binary arithmetic coding technique for encoding the output of chaotic sources. The model we use for such sources is the free motion of particles on a surface of constant negative curvature. The source symbol probabilities are time-varying and follow a well defined rule as the one associated with a fractal known as Maskit boundary. We show that the average codeword lengths...
Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence of eavesdroppers. In the case of infinite networks, a critical parameter is the maximum density of eavesdroppers that can be accommodated while still guaranteeing an infinite component in the network, i.e., the...
A linear scheme is proposed for multiterminal secret key agreement under a private finite linear source model with public discussion. With a wiretapper observing the public discussion and a subset of the source components, it attains the secrecy capacity perfectly and non-asymptotically with a finite block length. Upper bounds on the block length and public discussion rate are given.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.