Error correcting system and device

Claim 1

A method of correcting errors by obtaining a coefficient of each term of an error location polynomial from a syndrome when an error number is n equal to or less than a maximum number table to be corrected by a long distance code in decoding the long distance code, comprising the steps of: setting data words A.sub.(i+j-2) to each element q i ,j of a matrix consisting of p rows and (p+1) columns, where 1≦i≦p, 1≦j≦p+1; setting syndromes S.sub.(i+j-2) on the basis of the data words A.sub.(i+j-2) to each element a i ,j of a matrix consisting of n rows and (n+1) columns formed by substituting the error number n for the p; performing left hand elementary transformation over the matrix; and obtaining said coefficient of each term of said polynomial.

Claim 2

A method of correcting errors by obtaining a coefficient of each term of an error location polynomial from a syndrome when an error number is n equal to or less than a maximum number table to be corrected by a long distance code in decoding the long distance code, comprising the steps of: setting data words A.sub.(i+j-2) to each element q i ,j of a matrix consisting of p rows and (p+1) columns, where 1≦i≦p, 1≦j≦p+1; setting syndromes S.sub.(i+j-2) on the basis of the data words A.sub.(i+j-2) to each element a i ,j of a matrix consisting of n rows and (n+1) columns formed by substituting the error number n for the p; performing left hand elementary transformation over the matrix; and obtaining said coefficient of each term of said polynomial.

Claim 4

A method of correcting errors by obtaining an error pattern corresponding to error locations from error locations and a syndrome when an error number is n equal to or less than a maximum number t table to be corrected by a long distance code in decoding the long distance code, comprising the steps of: setting data V i ,j-1 to each element a i ,j of a matrix consisting of n rows and (n+1) columns, wherein 1≦i≦n, 1≦j≦n; setting syndromes S i-1 on the basis of the data words V i ,j-1 to each element a i ,j ; performing left hand elementary transformation over the matrix, and obtaining each error pattern corresponding to the error locations.

Claim 5

A method of correcting errors by obtaining an error pattern corresponding to error locations from error locations and a syndrome when an error number is n equal to or less than a maximum number t table to be corrected by a long distance code in decoding the long distance code, comprising the steps of: setting data V i ,j-1 to each element a i ,j of a matrix consisting of n rows and (n+1) columns, wherein 1≦i≦n, 1≦j≦n; setting syndromes S i-1 on the basis of the data words V i ,j-1 to each element a i ,j ; performing left hand elementary transformation over the matrix, and obtaining each error pattern corresponding to the error locations.

Claim 6

A device for ocrrecting errors by obtaining a coefficient of each term of an error location polynomial from a syndrome or an error pattern corresponding to error locations from error locations and a syndrome in decoding a long distance code, comprising: a plurality of memory means M i ,j for storing each of data words A.sub.(i+j-2) corresponding to each element q i ,j of a matrix consisting of p rows and (p+1) columns; a plurality of buffer means (D 1 , D 2 , . . . D p+1 ) each connected to each column of said memory means for substituting the the data words; and a plurality of computing means (C 1 , C 2 , . . . C p+1 ) with Galois field connected to each column of said memory means; said memory means, said buffer means and said computing means being adapted to process concurrently each of the data words stored in each column in one row of said memory means.

Claim 7

A device for ocrrecting errors by obtaining a coefficient of each term of an error location polynomial from a syndrome or an error pattern corresponding to error locations from error locations and a syndrome in decoding a long distance code, comprising: a plurality of memory means M i ,j for storing each of data words A.sub.(i+j-2) corresponding to each element q i ,j of a matrix consisting of p rows and (p+1) columns; a plurality of buffer means (D 1 , D 2 , . . . D p+1 ) each connected to each column of said memory means for substituting the the data words; and a plurality of computing means (C 1 , C 2 , . . . C p+1 ) with Galois field connected to each column of said memory means; said memory means, said buffer means and said computing means being adapted to process concurrently each of the data words stored in each column in one row of said memory means.

Claim 8

A method of correcting errors by obtaining values corresponding to n error locations from an error location polynomial in decoding an error correcting code for correcting a plurality of errors, comprising the steps of: substituting sequentially each of elements indicating each of locations of received words in a received word train for the error location polynomial, thereby obtaining each value of each term in the error location polynomial whenever each of elements is substituted; adding each other respective obtained values of the terms till values corresponding to n-1 error locations are obtained on the basis of the elements and the added values of the terms; and calculating a value corresponding to a nth error location on the basis of the values corresponding to the n-1 error locations.

Claim 9

A method of correcting errors by obtaining values corresponding to n error locations from an error location polynomial in decoding an error correcting code for correcting a plurality of errors, comprising the steps of: substituting sequentially each of elements indicating each of locations of received words in a received word train for the error location polynomial, thereby obtaining each value of each term in the error location polynomial whenever each of elements is substituted; adding each other respective obtained values of the terms till values corresponding to n-1 error locations are obtained on the basis of the elements and the added values of the terms; and calculating a value corresponding to a nth error location on the basis of the values corresponding to the n-1 error locations.

Claim 10

A method of correcting errors by obtaining a coefficient of each term of an error location polynominal from a syndrome or an error pattern from error locations and a syndrome in decoding a long distance code by setting data words A.sub.(i+j-2) to each element a i ,j of a matrix consisting of p rows and (p+1) columns, wherein 1≦i≦p, 1≦j≦p+1, performing left side fundamental transformation over the matrix, and obtaining the coefficient of the error correction polynomial or the error pattern, comprising the steps of: storing the data words A.sub.(i+j-2) corresponding to each element a i ,j of the matrix consisting of p rows and (p+1) columns in a matrix memory; and processing concurrently each of the data words stored in each row in one column of said memory by using resisters provided in every row and every column of said matrix memory and computing means provided in every row of said matrix memory.

Claim 11

A method of correcting errors by obtaining a coefficient of each term of an error location polynominal from a syndrome or an error pattern from error locations and a syndrome in decoding a long distance code by setting data words A.sub.(i+j-2) to each element a i ,j of a matrix consisting of p rows and (p+1) columns, wherein 1≦i≦p, 1≦j≦p+1, performing left side fundamental transformation over the matrix, and obtaining the coefficient of the error correction polynomial or the error pattern, comprising the steps of: storing the data words A.sub.(i+j-2) corresponding to each element a i ,j of the matrix consisting of p rows and (p+1) columns in a matrix memory; and processing concurrently each of the data words stored in each row in one column of said memory by using resisters provided in every row and every column of said matrix memory and computing means provided in every row of said matrix memory.