公开(公告)号：DE1231298B

公开(公告)日：1966-12-29

申请号：DEJ0027266

申请日：1964-12-29

Applicant: IBM

Inventor： CHIEN ROBERT TIENWEN ,  STEIN JACK JOSEPH

IPC: H03M13/19

公开(公告)号：CA767811A

公开(公告)日：1967-09-19

申请号：CA767811D

Applicant: IBM

Inventor： FREIMAN CHARLES V ,  CHIEN ROBERT TIENWEN

公开(公告)号：DE2320422A1

公开(公告)日：1973-11-29

申请号：DE2320422

申请日：1973-04-21

Applicant: IBM

Inventor： BOUDREAU PAUL EMILE ,  CHIEN ROBERT TIENWEN ,  PECK CHARLES CLYDE

IPC: H03M13/00 ,  H03M13/09 ,  H03M13/17 ,  H03K13/32

Abstract: If digital data sequences of length n bits are successively encoded for protection against error by appending to each block of n bits in a sequence of r check bits, the r check bits being calculated from the n bits of the block by iteratively dividing the data stream, by a generator polynomial g(x) prior to each transmission and then by iteratively dividing the data sequence and remainder by a scrambler polynomial S(x), then the apparent error E(x) at the receiver due to channel error e(x), after descrambling (multiplying) by polynomial S(x), is represented by the relation E(x) = S(x) e(x). When scrambling polynomial S(x) is of the form S(x) = 1 + x, then each channel error is replaced by two adjacent errors, hence E(x) = (1 = x) e(x). All single and odd errors are nevertheless detectable in such circumstances by modifying g(x) such that g(x) = (1 + x)m 1 t(x). Furthermore, burst type channel error of length >/= b is detectable, in addition to all single and odd errors, if the scrambler polynomial S(x) assumes the form S(x) = (1 + x)m f(x) and the generator polynomial is modified so that g(x) = (1 + x)m 1 t(x) where f(x) and t(x) are polynomials having an odd number of terms and relatively prime and t(x) is of degree >/= b.

公开(公告)号：CA708309A

公开(公告)日：1965-04-20

申请号：CA708309D

Applicant: IBM

Inventor： CHIEN ROBERT TIENWEN