Patent US4556977A successfully refreshed from Google Patents.
US4556977A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decoding of BCH double error correction - triple error detection (DEC-TED) codes
Assignee: International Business Machines Corp
•
Filing: 1983-09-15
•
Granted: 1985-12-03
•
Expires: 2003-09-15
Abstract
Abstract Decoding of BCH multiple error correction code codewords with α as a primitive element of the finite field GF (2 m ) is accomplished by generating syndrome subvectors S 1 from all column m-tuple α k positions and syndrome subvectors S 2 from all column m-tuple α 3K positions, generating a permutation of syndrome subvector S 1 for each bit position on the codeword and then selecting those bit positions K where S 1 3 +S 2 +QK=0 as the bit or bits in error.
Inventors
- 👤 Ulrich Olderdissen
- 👤 Hans Schumacher
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 17:48
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/15; H03M13/151; H03M13/152; H03M13/1575
Claims Analysis
Total Claims: 3
Claim 1
Independent Claim
136 words
In an error correcting system based on a BCH multiple error correction code with α as a primitive element of the finite field GF (2 m ) and with an H matrix where each column vector CK includes two m-tuples α k and α 3k a method of locating bit positions K in error in a codeword generated by such a code comprising: (a) generating subsyndrome vectors S 1 and S 2 where S 1 is generated from column m-tuple α k and S is generated from column m-tuple α 3k , (b) generating Q K for each bit position by generating permutations of the syndrome vector S 1 corresponding to the bit positions, (c) selecting those bit positions K where S 1 3 +S 2 +Q K =0 as the bit or bits in error.
Claim 2
Dependent Claim
136 words
In an error correcting system based on a BCH multiple error correction code with α as a primitive element of the finite field GF (2 m ) and with an H matrix where each column vector CK includes two m-tuples α k and α 3k a method of locating bit positions K in error in a codeword generated by such a code comprising: (a) generating subsyndrome vectors S 1 and S 2 where S 1 is generated from column m-tuple α k and S is generated from column m-tuple α 3k , (b) generating Q K for each bit position by generating permutations of the syndrome vector S 1 corresponding to the bit positions, (c) selecting those bit positions K where S 1 3 +S 2 +Q K =0 as the bit or bits in error.
Claim 3
Dependent Claim
79 words
The method of claim 1 including providing an uncorrectable error indication when one bit of the codeword is indicated as being in error by step (c) and parity of the codeword is even, when two bits of the codeword are indicated as being in error by step (c) and parity of the codeword is odd or when the syndrome vector S of the codeword is not zero and no error is indicated as being in error by step (c).
References Cited (Backward Citations)
US3714629A
Cited
US4099160A
Cited
US4142174A
Cited
US4320510A
Cited
US4360916A
Cited
US4416010A
Cited
US4468769A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-12-02 | 1989-06-03 | 1989-12-03 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-12-02 | 1993-06-03 | 1993-12-03 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-12-02 | 1997-06-03 | 1997-12-03 | $7700.00 | Window Closed / Lapsed |