๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decoding algorithm for iterated codes correcting compound errors

โœ Scribed by Masazumi Kurihara

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
321 KB
Volume
89
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a decoding algorithm by superposition
On a decoding algorithm by superposition for binary cyclic codes for certain burst errors
โœ Atsushi Ogino; Toshiyuki Kohnosu; Shigeichi Hirasawa; Toshihisa Nishijima ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 600 KB

## Abstract Cyclic codes are often used for the purpose of correcting burst errors in digital transmission and recording systems. Since the implementations of the encoding and syndrome calculations of these codes are simple, these codes have superior properties from a practical perspective. In this

Codes for perfectly correcting errors of
Codes for perfectly correcting errors of limited size
โœ Samira Saidi ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 749 KB

Saidi S., Codes for perfectly correcting errors of limited size, Discrete Mathematics 118 (1993) 207-223. In this paper we study an analogue of perfect codes: codes that perfectly correct errors of limited size, assuming that there is a bound on the number of these errors. Stein's (m, n) crosses (