A bstruciA method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is shown which specifies carefully chosen subsets of the digits of the new codes that must be codewords in one of the shorter subcodes. Lower bounds to the rate and the minimum distance of the new code are derived in...

In an optical channel for a digital holographic data storage system, burst errors, in the form of severe amplitude compression, are experienced in the vicinity of dust and other optical aberrations in the channel. The locations of these burst errors are approximately xed over a range of perturbations in magni cation and vertical-horizontal position. In a calibrated channel, lower error rates ca...

In this paper we present an extended version of a turbo decoder which can cope with occasional phase shifts of the received signal. Such shifts are usually caused by noise bursts which prevent a proper synchronization of the incoming signal. To model such a channel we propose a concatenation of the BSC and the AWGN channel which can easily be incorporated into the classical turbo decoding algor...

Some structural properties of the burst-correcting convolutional codes constructed by Berlekamp and Preparata are investigated. These properties are used to evaluate the error probability per word of these codes. 1. Introduetion In a different paper 5), the author describes a stochastic model for Massey's binary type B2 burst-correcting convolutional decoders 4). From this model a formal expres...

Error-correcting codes have contributed in a significant way for both the theoretical referred to as random errors, or else errors can appear in bursts of many errors each It was shown that long LDPC codes with iterative decoding achieve. LDPC codes provide good random error performance nearer to Shannon limit. iterations such errors can be corrected by concatenating LDPC codes with RS codes. b...

This paper presents a novel vector quantizer (VQ) design algorithm for a burst error channel (BEC). The algorithm minimizes the average distortion when the BEC is in normal state of operation, while maintaining a minimum fidelity when the BEC is in the undesirable state. An iterative design procedure is first derived in the algorithm for obtaining a local optimal solution. A novel genetic schem...

This paper presents a methodology to calculate the bit-error rate for the data transmission in the upstream direction of Gigabit PON systems. In traditional optical receivers, the signal consists of a continuous bit stream. In the upstream direction of a PON however, the signal consists of a succession of packets with varying amplitudes. Hence the receiver needs to quickly extract the decision ...

We propose a game-based method for synthesizing a runtime enforcer for a reactive system to ensure that a set of safety-critical properties always holds even if errors occur in the system due to design defect or environmental disturbance. The runtime enforcer does not modify the internals of the system or provide a redundant implementation; instead, it monitors the input and output of the syste...

Adaptive modulation is applied in conjunction with a decision-feedback equalizer (DFE) in order to mitigate the effects of the slowly varying wide-band multipath Rayleigh fading channel in a noise-limited environment. An upper-bound mean bit-error rate and bits per symbol performance is introduced for this scheme by utilizing the pseudo signal-to-noise ratio at the output of the DFE in order to...

Saccadic eye movements of different sizes and directions are represented in an orderly topographic map across the intermediate and deep layers of the superior colliculus (SC), where large saccades are encoded caudally and small saccades rostrally. Based on experiments in the cat, it has been suggested that saccades are initiated by a hill of activity at the caudal site appropriate for a particu...