The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the application of link-time compaction and specialization techniques that exploit the ...

Increasing demand for high-speed interchip interconnects requires faster links that consume less power. The Shannon limit for the capacity of these links is at least an order of magnitude higher than the data rate of the current state-of-the-art designs. ...

In this note, we prove that if C is a duadic binary abelian code with splitting µ = µ-1 and the minimum odd weight of C satisfies d² - d + 1 ≠ n, then d(d-1) ≥ n + 11. We show by an example ...

This dissertation is concerned with methods for predictive quantization of signals and images, as well as code design algorithms for these methods. Our first contribution is a careful treatment of the technique of deterministic annealing for entropy-constrained ...

In this paper we propose a novel lightweight approximate authentication algorithm that provides efficient protection for wireless video streaming where bit errors are frequent. The benefits of the proposed algorithm over other algorithms are fast execution, ...

We analyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n ¿ s and size ¿(
Keywords: 05D40, Covering radius, Permutation codes, Restricted intersections

In the paper of WSEAS Dec.2007 [1], we proposed that Surge Protection Devices, such as varistor type SPDs, degraded the transmission rate of Power line communication modem. By the research after that, not only the capacitance of the varistor but also ...

This paper describes the salient features of designing a robust forward error correction coding scheme for satellite data communications and considers various such schemes suitable for a short message application.

Compressive Sampling is an emerging theory that is based on the fact that a relatively small number of random projections of a signal can contain most of its salient information. In this paper, we introduce the concept of Compressive Wireless Sensing ...

In this paper, we propose and evaluate an adaptive resource allocation scheme for Wideband Code Division Multiple Access multimedia systems. We give a discussion on the inherently multi-component nature of multimedia applications for wireless communication ...

The method of root counting is a well established technique in the study of the linear complexity of sequences. Recently, Massey and Serconek [11] have introduced a Discrete Fourier Transform approach to the study of linear complexity. In this paper, ...

The symmetric, orthogonal and self-inverting properties of Hadamard matrices make them useful for a number of present day applications. In addition, the binary nature of elements of the basis vectors helps in the design of efficient algorithms for coding, ...

A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of ...

We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pattern matching and is modeled after the Lempel-Ziv algorithm. As a key new ...