US5237574A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Error-resilient information encoding
Assignee: Maxtor Corp
•
Filing: 1991-12-11
•
Granted: 1993-08-17
•
Expires: 2011-12-11
Abstract
Abstract A method for determining whether particular information was used in encoding a codeword; the codeword is formed by encoding information as a first preliminary code sequence using a first code and then combining the first preliminary code sequence with a second preliminary code sequence generated using a second code; the particular information is encoded as a desired first preliminary code sequence in accordance with said first code; the desired first preliminary code sequence is then stripped from the codeword to derive a test sequence; the test sequence is decoded in accordance with the second code, and a determination is made, based on the decoding, whether the particular information was used in encoding the codeword. In another aspect, bad sector, servo correction, and sector address values are encoded for storage in a header associated with a sector of storage on a storage medium by encoding the address value with leading zero symbols in accordance with a code having a first rate, encoding the bad sector and servo correction values in a systematic code having a second rate, and combining these sequences to generate a codeword of the first code such that the bad sector and servo correction values appear explicitly in the codeword.
Inventors
- 👤 Lih-Jyh Weng
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 12:33
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1883; G11B20/1806; G11B20/1813; H; H03; H03M; H03M13/00; H03M13/29; G11B2220/00; G11B2220/20
Claims Analysis
Total Claims: 39
Claim 1
Independent Claim
143 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein the legitimate code sequences of said second code are a subset of the legitimate code sequences of said first code.
Claim 2
Independent Claim
143 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein the legitimate code sequences of said second code are a subset of the legitimate code sequences of said first code.
Claim 3
Independent Claim
136 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said previously encoded codeword is a legitimate code sequence of said first code.
Claim 4
Independent Claim
136 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said previously encoded codeword is a legitimate code sequence of said first code.
Claim 5
Independent Claim
135 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said previously encoded codeword is not systematic with respect to said information.
Claim 6
Independent Claim
135 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said previously encoded codeword is not systematic with respect to said information.
Claim 7
Independent Claim
150 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first code is a cyclic error correcting (n,k) code and said second code is a cyclic error correcting (n,m) code where m is smaller than k.
Claim 8
Independent Claim
150 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first code is a cyclic error correcting (n,k) code and said second code is a cyclic error correcting (n,m) code where m is smaller than k.
Claim 9
Independent Claim
145 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said second code can be fully decoded by permutation decoding but said first code can not be fully decoded by permutation decoding.
Claim 10
Independent Claim
145 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said second code can be fully decoded by permutation decoding but said first code can not be fully decoded by permutation decoding.
Claim 11
Independent Claim
138 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first code is rate (33,8) code and said second code is a (33,2) code.
Claim 12
Independent Claim
138 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first code is rate (33,8) code and said second code is a (33,2) code.
Claim 13
Independent Claim
159 words
A method for determining whether particular information was used in encoding a previously encoded codeword and reconstructing additional information from said previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, encoding additional information in a second preliminary code sequence in accordance with a second code, and combining said first preliminary code sequence with said second preliminary code sequence, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, and if said particular information was used in encoding said previously encoded codeword, reconstructing said additional information based on said decoding.
Claim 14
Independent Claim
159 words
A method for determining whether particular information was used in encoding a previously encoded codeword and reconstructing additional information from said previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, encoding additional information in a second preliminary code sequence in accordance with a second code, and combining said first preliminary code sequence with said second preliminary code sequence, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, and if said particular information was used in encoding said previously encoded codeword, reconstructing said additional information based on said decoding.
Claim 15
Dependent Claim
18 words
The method of claim 7 wherein said additional information comprises a bad sector flag for a magnetic disk.
Claim 16
Dependent Claim
18 words
The method of claim 7 wherein said additional information comprises a servo correction number for a magnetic disk.
Claim 17
Dependent Claim
17 words
The method of claim 7 wherein said second code is systematic with respect to said additional information.
Claim 18
Dependent Claim
24 words
The method of claim 7 wherein said codeword comprises a string of an symbols, the high order m said symbols being said additional information.
Claim 19
Dependent Claim
44 words
The method of claim 7 wherein said decoding comprises encoding simultaneously in parallel in accordance with said second code possible code sequences corresponding to each possible value of said additional information, and comparing simultaneously in parallel each possible code sequence with said test sequence.
Claim 20
Independent Claim
150 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first preliminary code sequence comprises a string of A symbols, the high order k said symbols comprising at least one zero symbol followed by said information.
Claim 21
Independent Claim
150 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first preliminary code sequence comprises a string of A symbols, the high order k said symbols comprising at least one zero symbol followed by said information.
Claim 22
Independent Claim
151 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining aid first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said decoding comprises permutation decoding over a field of finite elements having fewer elements than the field that would be required for fully decoding said previously encoded codeword.
Claim 23
Independent Claim
151 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining aid first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said decoding comprises permutation decoding over a field of finite elements having fewer elements than the field that would be required for fully decoding said previously encoded codeword.
Claim 24
Independent Claim
141 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said determining comprises detecting the distance between said test sequence and legitimate code sequences of said second code.
Claim 25
Independent Claim
141 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said determining comprises detecting the distance between said test sequence and legitimate code sequences of said second code.
Claim 26
Dependent Claim
18 words
The method of claim 15 wherein said determining further comprises comparing said distance with a predetermined threshold value.
Claim 27
Dependent Claim
25 words
The method of claim 16 wherein said predetermined threshold has a maximum value that is smaller than the error correcting capability of said second code.
Claim 28
Dependent Claim
21 words
The method of claim 17 wherein said predetermined threshold is the same as the error correcting capability of said first code.
Claim 29
Independent Claim
144 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first and second codes comprise maximum distance separable codes, said first code having a smaller distance than said second code.
Claim 30
Independent Claim
144 words
A method for determining whether particular information was used in encoding a previously encoded codeword, said previously encoded codeword having been formed by encoding information as a first preliminary code sequence in accordance with a first code, and combining said first preliminary code sequence with a second preliminary code sequence generated in accordance with a second code, said method comprising encoding said particular information as a particular first preliminary code sequence in accordance with said first code, stripping said particular first preliminary code sequence from said previously encoded codeword to derive a test sequence, decoding said test sequence in accordance with said second code, and determining, based on said decoding, whether said particular information was used in encoding said previously encoded codeword, wherein said first and second codes comprise maximum distance separable codes, said first code having a smaller distance than said second code.
Claim 31
Independent Claim
120 words
A method for encoding bad sector, servo correction, and sector address values for storage in a header associated with a sector of storage on a storage medium comprising encoding the address value with leading zero symbols in accordance with a first code having a first rate to form a first preliminary code sequence, encoding the bad sector and servo correction values in a systematic second code having a second rate to form a second preliminary code sequence, and combining said first and second preliminary code sequences to generate a codeword of said first code such that said bad sector and servo correction values appear explicitly in said codeword but said sector address value does not appear explicitly in said codeword.
Claim 32
Independent Claim
120 words
A method for encoding bad sector, servo correction, and sector address values for storage in a header associated with a sector of storage on a storage medium comprising encoding the address value with leading zero symbols in accordance with a first code having a first rate to form a first preliminary code sequence, encoding the bad sector and servo correction values in a systematic second code having a second rate to form a second preliminary code sequence, and combining said first and second preliminary code sequences to generate a codeword of said first code such that said bad sector and servo correction values appear explicitly in said codeword but said sector address value does not appear explicitly in said codeword.
Claim 33
Dependent Claim
20 words
The apparatus of claim 20, wherein said codeword may be subjected to no more than a predetermined degree of corruption.
Claim 34
Independent Claim
163 words
A method of locating a sector from among sectors on a magnetic disk comprising encoding the respective addresses of said sectors as first preliminary code sequences in accordance with a first code, forming codewords for said sectors based on combining said first preliminary code sequences with second preliminary code sequences generated in accordance with a second code, recording said codewords in said sectors during formatting of said magnetic disk, reading one of said codewords, possibly corrupted, from a sector rotating under a head, stripping the first preliminary code sequence of said sector being located from said possibly corrupted codeword to derive a test sequence, decoding said test sequence in accordance with said second code to determine the number of errors in said possibly corrupted codeword, comparing said number of errors to a threshold T, and if the number of errors is no greater than T, accepting said sector rotating under said head as the one being sought, otherwise proceeding to the next sector.
Claim 35
Independent Claim
163 words
A method of locating a sector from among sectors on a magnetic disk comprising encoding the respective addresses of said sectors as first preliminary code sequences in accordance with a first code, forming codewords for said sectors based on combining said first preliminary code sequences with second preliminary code sequences generated in accordance with a second code, recording said codewords in said sectors during formatting of said magnetic disk, reading one of said codewords, possibly corrupted, from a sector rotating under a head, stripping the first preliminary code sequence of said sector being located from said possibly corrupted codeword to derive a test sequence, decoding said test sequence in accordance with said second code to determine the number of errors in said possibly corrupted codeword, comparing said number of errors to a threshold T, and if the number of errors is no greater than T, accepting said sector rotating under said head as the one being sought, otherwise proceeding to the next sector.
Claim 36
Independent Claim
200 words
A method of checking whether a sector of a magnetic disk to be written during a write operation should be written comprising encoding the respective addresses of said sectors as first preliminary code sequences in accordance with a first code, forming codewords for said sectors based on combining said first preliminary code sequences with second preliminary code sequences generated from bad sector information indicating whether the respective sectors should be written, in accordance with a second code, recording said codewords in said sectors during formatting of said magnetic disk, reading one of said codewords, possibly corrupted, from a sector rotating under a head, stripping the first preliminary code sequence of the sector to be written from said possibly corrupted codeword to derive a test sequence, decoding said test sequence in accordance with said second code to determine the number of errors in said possibly corrupted codeword, comparing said number of errors to a threshold T, if the number of errors is no greater than T, accepting the sector rotating under said head as the one to be written, and checking the thus decoded bad sector information to determine whether said sector should be written, otherwise proceeding to the next sector.
Claim 37
Independent Claim
200 words
A method of checking whether a sector of a magnetic disk to be written during a write operation should be written comprising encoding the respective addresses of said sectors as first preliminary code sequences in accordance with a first code, forming codewords for said sectors based on combining said first preliminary code sequences with second preliminary code sequences generated from bad sector information indicating whether the respective sectors should be written, in accordance with a second code, recording said codewords in said sectors during formatting of said magnetic disk, reading one of said codewords, possibly corrupted, from a sector rotating under a head, stripping the first preliminary code sequence of the sector to be written from said possibly corrupted codeword to derive a test sequence, decoding said test sequence in accordance with said second code to determine the number of errors in said possibly corrupted codeword, comparing said number of errors to a threshold T, if the number of errors is no greater than T, accepting the sector rotating under said head as the one to be written, and checking the thus decoded bad sector information to determine whether said sector should be written, otherwise proceeding to the next sector.
Claim 38
Independent Claim
204 words
A method of locating a sector of a track of a magnetic disk and centering a head on said track comprising encoding the respective addresses of the sectors of said track as first preliminary code sequences in accordance with a first code, forming codewords for said sectors based on combining said first preliminary code sequences with second preliminary code sequences generated from servo control information about the location of the center of said track, in accordance with a second code, recording said codewords in said sectors during formatting of said magnetic disk, reading one of said codewords, possibly corrupted, from a sector rotating under said head, stripping the first preliminary code sequence of said sector being located from said possibly corrupted codeword to derive a test sequence, decoding said test sequence in accordance with said second code to determine the number of errors in said possibly corrupted codeword, comparing said number of errors to a threshold T, and if the number of errors is no greater than T, accepting said sector rotating under said head as the one being sought, deriving said servo control information from said test sequence and using the thus derived servo control information to control the location of said head.
Claim 39
Independent Claim
204 words
A method of locating a sector of a track of a magnetic disk and centering a head on said track comprising encoding the respective addresses of the sectors of said track as first preliminary code sequences in accordance with a first code, forming codewords for said sectors based on combining said first preliminary code sequences with second preliminary code sequences generated from servo control information about the location of the center of said track, in accordance with a second code, recording said codewords in said sectors during formatting of said magnetic disk, reading one of said codewords, possibly corrupted, from a sector rotating under said head, stripping the first preliminary code sequence of said sector being located from said possibly corrupted codeword to derive a test sequence, decoding said test sequence in accordance with said second code to determine the number of errors in said possibly corrupted codeword, comparing said number of errors to a threshold T, and if the number of errors is no greater than T, accepting said sector rotating under said head as the one being sought, deriving said servo control information from said test sequence and using the thus derived servo control information to control the location of said head.
References Cited (Backward Citations)
US3638182A
Cited
US4413340A
Cited
US4598403A
Cited
US4413339A
Cited
WO1983001334A1
Cited
US4503420A
Cited
US4769819A
Cited
US4750178A
Cited
EP0205667A1
Cited
EP0248536A2
Cited
US4847705A
Cited
US4955022A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-08-16 | 1997-02-15 | 1997-08-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-08-16 | 2001-02-15 | 2001-08-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-08-16 | 2005-02-15 | 2005-08-17 | $7700.00 | Window Closed / Lapsed |