This paper demonstrates two improvements in coding techniques that could be used for memory word coding. First, within the fixed structure of a Hamming single-error-correcting, double-errordetecting (SEC/DED) code, an improvement can be obtained in circuit cost and operational speed over more conventional code implementations. Second, the mechanics of error correction in a fault-tolerant comput...

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...

The paper discusses the limits of error correction coding for spread spectrum-based video watermarking. The error correction code has as input the watermark data bits and as output the values which will be scaled and used to modify the video pixels (transform coefficients). The data rate of the watermark can increase only at the expense of increasing code rate. Theoretically, the scheme is seen...

In this paper we describe a new error-correcting code (ECC) inspired by the Naccache-Stern cryptosystem. While by far less efficient than Turbo codes, the proposed ECC happens to be more efficient than some established ECCs for certain sets of parameters. The new ECC adds an appendix to the message. The appendix is the modular product of small primes representing the message bits. The receiver ...

In this article we outline a method for generating linear optics circuits that encode quantum-error-correcting codes. Using this method we produce a single-error-correcting code encoding one wave packet over five which can be implemented using linear optics and feed-forward correction. This code improves on the capacity of the best known code that can be implemented using linear optics and satu...

Molecular Communications is a promising area with significant potential applications. To enhance the reliability of the transmission process, self-orthogonal convolutional codes (SOCCs) are proposed and investigated with respect to both bit error rate (BER) and energy efficiency. The codes are compared to both an un-coded system and one that employs Hamming codes to show that they can provide a...

This paper has presented a simple and systematic procedure for constructing both type Bl and type B2 codes. The type B2 codes presented are optimal codes. According to the author’s definition of the efficiency of recurrent codes for burst-error correction, the type Bl codes presented have efficiencies (x) > 0.5. As far as the correction of binary burst errors is concerned, the type Bl code pres...

A new construction method for codes correcting multiple localized burst errors is proposed. The codes obtained by this method improve upon codes presented by Larsson in size, while keeping the encoding and decoding complexity low. Like the Larsson codes, the proposed codes are asymptotically optimal when the number of bursts to be corrected is fixed and the correctable burst length grows linear...