Abstract Error correcting codes can play a key role in improving the efficiency and reliability of wireless communications. Concatenated codes have the advantages that: 1) breaking the task into stages simplifies decoding, and 2) performance is good against clustered bit errors, fading and bursty interference. Reed-Solomon codes (maximum distance codes) have been popular as an outer code of con...

This thesis studies a new method of combining Turbo Codes with various modulation techniques to take advantage of inherent trade-o s between BER performance, code rate, spectral e ciency and decoder complexity. Our new method, which we call Symbol-Based Turbo Codes, parses the parallel data streams of the Turbo Code encoder into n-bit symbols and maps each symbol to a point in a 2n-ary signal s...

In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR locality, for all parameters, that have both optimal minimum-distance and optimal rate. These codes combine ideas from two popular codes in the distri...

A new decoding algorithm that modifies error searching soft decision method is presented. The proposed algorithm improves the decoding error performance caused by repeated searching. It is shown that the simplicity inherent in the hard decision decoding is still maintained. This paper proposes an error correcting binary channel code which promotes symbol transition. This scheme exploits the err...

A code symbol of a linear code is said to have locality r if this symbol could be recovered by at most r other code symbols. An (n, k, r) locally repairable code (LRC) with all symbol locality is a linear code with length n, dimension k, and locality r for all symbols. Recently, there are lots of studies on the bounds and constructions of LRCs, most of which are essentially based on the generat...

Symbol flipping-based hard decision decoding for non-binary low-density parity check (LDPC) codes has attracted much attention due to low decoding complexity even though the error performance of the symbol flipping decoder is inferior to that of the soft decision decoders. Standard symbol flipping decoding involves two steps, selection of the symbol position to be flipped and selection of the f...

In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of variable length codes (VLC). A bit-level soft-input/soft-output module is derived and is applied in an iterative decoding structure consisting of an outer variable length code and an inner convolutional code. Due to ...

Symbol-pair codes are proposed to protect against pair-errors in symbol-pair read channels. The research of with the largest possible minimum distance is great significance since such have best error-correcting capability. A code meeting Singleton bound called a maximum separable (MDS) code. In this paper, two new classes MDS by utilizing repeated-root cyclic over finite fields odd characterist...

Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with large minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining maximal mi...

To be considered for an IEEE Jack Keil Wolf ISIT Student Paper Award. In this paper we analyze the probabilistic matching of sources with memory to channels with memory so that symbol-by-symbol code with memory without anticipation are optimal, with respect to an average distortion and excess distortion probability. We show achievability of such a symbolby-symbol code with memory without antici...