Decoder for decoding a two-stage encoded code

Claim 1

A decoder for decoding a code C which is two-stage encoded by a C 1 code ((N, K, D) Q dimensional code) and a C 2 code ((n, k, d) q dimensional code), comprising: a C 1 decoder including; error correction means for conducting an error correction of errors below the number [(D-1)/2]([M] is the biggest integer which does not exceed M) to output a decoded word at a first output terminal, and a weight generator which generates a weight signal wj (j=1, 2, . . . , n) at a second output terminal when i (i=0 to [(D-1)/2]) errors are corrected and an error detection (correction disability) is judged; a C 2 decoder for decoding the C 2 code including, forfeiture/error correction means having input terminals connected to said first and second output terminals for judging the position j of the weight signal wj among a weight vector w in a received word r which is otained in accordance with the decoded word output from the C 1 decoder which satisfies the inequality wj≧D/2-K (K=0, 1, . . . [(D-1)/2]), and conducting a forfeiture error decoding which satisfies the inequality nε.sup.(k) +2ne.sup.(k) ≦2τ/D nε.sup.(k) =the number of forfeitures when k=0, 1, . . . , (D-1)/2, ne.sup.(k) =the number of errors when k=0, 1, . . . , (D-1)/2, 0≦τ<dD/2, weighted distance calculating means for calculating a weighted distance ρ.sup.(k) between a decoded word r.sup.(k) and the received word r when a decoded word in each of K=0, 1, . . . , [(D-1)/2] is obtained, comparator means for comparing the weighted distance ρ.sup.(k) and an integer τ, means for outputting the decoded word r.sup.(k) as a correct decoded word when ρ.sup.(k) is smaller than or equal to τ, and means for outputting a correction disability signal when ρ.sup.(k) is larger than τ or no decoded word is obtained by the forfeiture error correction means, wherein ##EQU14##

Claim 3

A method for decoding a two-stage encoded code C from an information source, the code C having a first stage (N,K,D) Q dimensional code C 1 and a second stage (n,k,d) q dimensional code C 2 , comprising the steps of: (a) receiving said two-stage code from said source; (b) correcting errors in said first stage code of a number less than or equal to [(D-1)/2]: (c) producing a jth symbol r j of said second stage code; (d) producing a weight signal Wj corresponding to the weight or r j , W j =i when i errors have been corrected (O≦i≦[(D-1)/2]), W j =D/2 when an error has been detected but is incapable of being corrected; (e) producing a received word vector r and a weight vector w composed of said symbols r j and weight signals W j ; (f) setting a repetition cycle number K to O; (g) determining as a forfeiture the component of r with a weight W j ≧D/2-K; (h) conducting a forfeiture/error correction which satisfies the inequality nε.sup.(k) +2ne.sup.(k) ≦2τ/D, where nε.sup.(k) =the number of forfeitures for K=0, 1 . . . , (D-1)/2, ne.sup.(k) =the number of errors for K=0, 1 . . . , (D-1)/2, O≦τ<dD/2 to obtain a decoded word r.sup.(k) ; (i) calculating a weighted distance ρ (k) between said decoded word and said received word component where ##EQU15## (j) outputting said decoded word when ρ.sup.(k) ≦τ; (k) outputting a correction disability signal when ρ.sup.(k) >τ; (l) terminating said method if k≧(D-1)/2; (m) incrementing K by 1 if K<(D-1)/2; and (n) repeating steps (g) through (m) until step (k) is satisfied.

Claim 4

A method for decoding a two-stage encoded code C from an information source, the code C having a first stage (N,K,D) Q dimensional code C 1 and a second stage (n,k,d) q dimensional code C 2 , comprising the steps of: (a) receiving said two-stage code from said source; (b) correcting errors in said first stage code of a number less than or equal to [(D-1)/2]: (c) producing a jth symbol r j of said second stage code; (d) producing a weight signal Wj corresponding to the weight or r j , W j =i when i errors have been corrected (O≦i≦[(D-1)/2]), W j =D/2 when an error has been detected but is incapable of being corrected; (e) producing a received word vector r and a weight vector w composed of said symbols r j and weight signals W j ; (f) setting a repetition cycle number K to O; (g) determining as a forfeiture the component of r with a weight W j ≧D/2-K; (h) conducting a forfeiture/error correction which satisfies the inequality nε.sup.(k) +2ne.sup.(k) ≦2τ/D, where nε.sup.(k) =the number of forfeitures for K=0, 1 . . . , (D-1)/2, ne.sup.(k) =the number of errors for K=0, 1 . . . , (D-1)/2, O≦τ<dD/2 to obtain a decoded word r.sup.(k) ; (i) calculating a weighted distance ρ (k) between said decoded word and said received word component where ##EQU15## (j) outputting said decoded word when ρ.sup.(k) ≦τ; (k) outputting a correction disability signal when ρ.sup.(k) >τ; (l) terminating said method if k≧(D-1)/2; (m) incrementing K by 1 if K<(D-1)/2; and (n) repeating steps (g) through (m) until step (k) is satisfied.