Title A new Decoding Method of Redundant Residue Polynomial Codes

نویسندگان

  • Akira SHiozAKi
  • Fujio NisHiDA
  • F. NisHiDA
چکیده

This paper presents a new decoding method of redundant residue polynomial codes. The decoding method has an advantage of correcting errors easily by checking the degree of the product of a polynomial corresponding to a received code and the moduli corresponding to error positions. The number of operations needed fbr this decoding method is about 1/10-11100 tirnes as Iarge as that needed fbr the previous methods. Then the number of decoding operations is examined in relation to the construction of the codes in the case of burst-error correction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Decoding for Polynomial Residue Codes with Non-Pairwise Coprime Moduli

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degreeweighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming...

متن کامل

Decoding the Ternary (23, 11, 9) Quadratic Residue Code

Quadratic residue (QR) codes are cyclic, nominally half-rate codes, that are powerful with respect to their error-correction capabilities. Decoding QR codes is in general a difficult task, but great progress has been made in the binary case since the work of Elia [1] and He et al. [2]. Decoding algorithms for certain nonbinary QR codes were proposed by Higgs and Humphreys in [3] and [4]. In [5]...

متن کامل

Fast algorithm for decoding of systematic quadratic residue codes

A general algorithm for decoding the binary systematic quadratic residue (QR) codes with lookup tables is presented in this study. The algorithm can be applied in decoding the QR codes with either reducible or irreducible generator polynomials. If the generator polynomial of the QR codes is reducible, the number of elements in the Galois field is less than the sum of all correctable error patte...

متن کامل

Redundant residue number system based error correction codes

In this paper residue number system (RNS) arithmetic and redundant residue number system (RRNS) based codes as well as their properties are reviewed. We propose a number of applications for RRNS codes and demonstrate how RRNS codes can be employed in global communication systems, in order to simplify the associated systems by unifying the entire encoding and decoding procedure across global com...

متن کامل

Gray Images of Constacyclic Codes over some Polynomial Residue Rings

Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( . The Gray map   is said to be a ( )-Gray map if the image of any -constacyclic code over    is a -constacyclic code over the field   . In this paper we investigate the existence of   ( )-Gray maps over . In this direction, we find an equivalent ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017