We prove that the zero-rate error exponent of the exponential-server timing channel is at least μ/2, where 1/μ is the mean service time. This proves that at low data rates, the timing channel is strictly more reliable than the related Poisson channel with peak intensity μ and zero dark current. This answers a question recently posed by Arikan, who proved that the timing channel’s reliability fu...

With the large-scale construction of high-speed railway, the impact of its high speed on Orthogonal Frequency Division Multiplexing (OFDM) channel estimation has caused a wide range of concern. This paper studies the OFDM systems in high-speed railway environment and its channel estimation using least square (LS) method. In the simulations, we take into account Doppler frequency shift, antenna ...

In a relay channel, between the sender X and the the receiver Y lies at least one relay. Generally, the relay can both transmit its own information and help forwarding other sources’ information. This summary considers the latter case, i.e., the relay intends solely to help the receiver. The relay and the transmitter cooperate to resolve the receiver’s uncertainty. Due to the presence of relay,...

In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on. LCD codes have been extensively studied in literature. On the other hand, MDS codes form an optimal family of classical codes which have wide applications in...

Explicit coding schemes are proposed to achieve the rate-distortion bound for the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion bound for the binary case. The nested structure contains two optimal polar codes for lossy source coding and channel coding, respectively. Moreover, a similar nested polar lattice con...

In the last decade, Daubechies orthogonal wavelets have been successfully used in many signal processing paradims. The construction of these wavelets via two channel perfect reconstruction filter bank requires the identification of necessary conditions that the coefficients of the filters and the roots of binomial polynomials associated with it should exhibit. In this paper, a subclass of polyn...

Recently, Ericson and Zinoviev presented a clever, new construction for spherical codes for the Gaussian channel using ideas of code concatenation and set partitioning. This family of new spherical codes is generated from sets of binary codes using equally spaced symmetric pointsets on the real line. The family contains some of the best known spherical codes in terms of minimum distance. Howeve...

We have implemented a contract checker for asynchronous, message-passing applications to check that service implementations conform to behavioural contracts. Our contract checker is based on a process algebraic theory of conformance and is implemented on top of a software model checker, Zing. The purpose of this paper is to explain the model construction implemented by our contract checker and ...

The first part of the paper presents a construction of orthonormal polynomial wavelets on the interval by means of a Malvar–type decomposition in polynomial coefficient space. With this approach the localization of the wavelets could be improved substantially compared to an earlier construction by the authors. The new basis is then applied to the analysis of turbulence in the presence of walls....