This document specifies an Internet standards track protocol for the Internet community, and requests discussion and suggestions for improvements. Please refer to the current edition of the "Internet Official Protocol Standards" (STD 1) for the standardization state and status of this protocol. Distribution of this memo is unlimited. Abstract This document describes a Fully-Specified Forward Er...

We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.

Based on a sufficient condition proposed by Hollmann and Xiang forconstructing triple-error-correcting codes, the minimum distance of a binary cycliccodeC1,3,13 with three zeros α, α3, and α13 of length 2−1 and the weight divisibilityof its dual code are studied, where m ≥ 5 is odd and α is a primitive element of thefinite field F2m . The codeC1,3,13 is proven to hav...

Error correction is an indispensable component when Physical Unclonable Functions (PUFs) are used in cryptographic applications. So far, there exist schemes that obtain helper data, which they need within the error correction process. We introduce a new scheme, which only uses an error correcting code without any further helper data. The main idea is to construct for each PUF instance an indivi...

In high-speed satellite-to-ground laser communications, it has been shown that the Markov-based erasure channel model is well suited for the downlink experiment results. In that model, since the average erasure rate is relatively high, a low-rate error correction code is needed. In this paper, we focus on the application of low rate systematic Luby transform (SLT) code and show that the perform...

Theory of error correcting codes mostly considers all words of same lengths. Mathematical tools of linear algebra and finite fields greatly helped in its development. However all words of equal lengths idea compromises with efficiency which can be better achieved through variable length codes for noisy channels. There is quite some interest and scope in error coding through variable length cod ...

We propose a general class of concatenated errorcorrecting entropy codes and channel codes. In this way we extend and generalize the existing body of work on iterative decoding of entropy and channel codes. Using the structure and properties of serial concatenated codes, we employ error-correcting entropy codes as the outer code, and a convolutional code as the inner code. The generalization fr...

Due to mushroom development of wireless devices cognitive radio is used to resolve the bandwidth utilization and sacristy problem. The crafty usage of bandwidth in cognitive radio based on error correcting codes is ensured to accomodate un authorized user. This study proposes a transmission model by which a finite sequence of binary cyclic codes constructed by a binary BCH code of length n = 2s...

A link between the theory of error-correcting codes and (t, m, s)nets leads to the efficient construction of two families of very good ternary nets. These have parameters (4r − 4, 4r, (32r + 1)/2 (for all r ≥ 2) and (2r− 4, 2r, (3r − 1)/2) (for all odd r ≥ 3). The underlying codes are cyclic codes.

Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces to the following “curve-fitting” probl...