Patent US4905259A successfully refreshed from Google Patents.
US4905259A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of constructing block codes
Assignee: Individual
•
Filing: 1988-04-18
•
Granted: 1990-02-27
•
Expires: 2008-04-18
Abstract
Abstract A method of selecting at least one code word from a set of second data having at least one data group representing a set of first data having at least one data group including the steps of determining for one of the set of second data, all those data groups in the set of first data covered by the one of the set of second data, eliminating the covered data group from the set of first data, selecting as one of the at least one code word the one of the set of second data which covers the maximum number of data groups in the set of first data, and repeating the above steps until a given criteria is satisfied.
Inventors
- 👤 Jerry S. Nardi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 08:14
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3082; H04; H04N; H04N19/00; H04N19/90; H04N19/94
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
157 words
A method of selecting at least one code word from a set of second data, said at least one code word being selected to represent data in a set of first data, said sets of first and second data each having at least one data group, the method comprising the steps of: determining for one of said at least one data group of said set of second data, all those data groups in said set of first data covered by said one of said at least one data group of said set of second data; selecting as one of said at least one code word the one of said at least one data group of said set of second data which covers the maximum number of data groups remaining in said set of first data; eliminating the covered data groups from said set of first data; and repeating the above steps until a given criteria is satisfied.
Claim 2
Independent Claim
157 words
A method of selecting at least one code word from a set of second data, said at least one code word being selected to represent data in a set of first data, said sets of first and second data each having at least one data group, the method comprising the steps of: determining for one of said at least one data group of said set of second data, all those data groups in said set of first data covered by said one of said at least one data group of said set of second data; selecting as one of said at least one code word the one of said at least one data group of said set of second data which covers the maximum number of data groups remaining in said set of first data; eliminating the covered data groups from said set of first data; and repeating the above steps until a given criteria is satisfied.
Claim 3
Dependent Claim
20 words
The method according to claim 1, wherein said first data comprises source words and said second data comprises reproduction words.
Claim 4
Dependent Claim
23 words
The method according to claim 1, wherein said given criteria is that all data groups in said set of first data are covered.
Claim 5
Dependent Claim
39 words
The method according to claim 1, wherein said step of determining comprises the step of selecting a joint probability matrix Q that minimizes mutual information of said set of first data with respect to said set of second data.
Claim 6
Dependent Claim
76 words
The method according to claim 4, wherein sets of first and second data groups each consists of N elements and said step of determining further comprises the step of determining that a data group of said first set is covered by a data group of said second set if, when the elements of the two data groups are paired, each pair with first data element i and second data element j occurs exactly NQ ij times.
Claim 7
Dependent Claim
88 words
The method according to claim 1, further comprising after the step of eliminating the covered data groups from said set of first data, the steps of determining for each of the covered data groups in the set of first data, all those data groups in the set of second data covered by each of the data groups in the set of first data and eliminating each data group in said set of second data which is covered by said covered data groups in said set of first data.
Claim 8
Dependent Claim
35 words
The method according to claim 6, wherein said given criteria is that all data groups in said set of first data are covered or all data groups in said set of second data are eliminated.
Claim 9
Dependent Claim
39 words
The method according to claim 6, wherein said step of determining comprises the step of selecting a joint probability matrix Q that minimizes mutual information of said set of first data with respect to said set of second data.
Claim 10
Dependent Claim
77 words
The method according to claim 8, wherein said sets of first and second data groups each consists of N elements and said step of determining further comprises the step of determining that a data group of said first set is covered by a data group of said second set if, when the elements of the two data groups are paired, each pair with first data element i and second data element j occurs exactly NQ ij times.
Claim 11
Independent Claim
183 words
A method of selecting a set of code words representing first data comprised of at least one character from a first arbitrary alphabet, said method adapted for use in data transmission devices, comprising the steps of: (a) determining a set of first vectors representing the first data; (b) determining a set of second vectors from a second arbitrary alphabet; (c) selecting as a first code word in the set of code words one of said set of second vectors; (d) determining the number of the first vectors of those remaining in said set of first vectors which are covered by each of said second vectors; (e) eliminating from said set of first vectors all those vectors covered by said first code word; (f) selecting as a next code word in the set of code words a second vector covering a maximum number of first vectors of those remaining in said set of first vectors; (g) eliminating the first vectors covered by the next code word from the set of first vectors; (h) repeating steps (e) through (g) until a given criteria is satisfied.
Claim 12
Independent Claim
183 words
A method of selecting a set of code words representing first data comprised of at least one character from a first arbitrary alphabet, said method adapted for use in data transmission devices, comprising the steps of: (a) determining a set of first vectors representing the first data; (b) determining a set of second vectors from a second arbitrary alphabet; (c) selecting as a first code word in the set of code words one of said set of second vectors; (d) determining the number of the first vectors of those remaining in said set of first vectors which are covered by each of said second vectors; (e) eliminating from said set of first vectors all those vectors covered by said first code word; (f) selecting as a next code word in the set of code words a second vector covering a maximum number of first vectors of those remaining in said set of first vectors; (g) eliminating the first vectors covered by the next code word from the set of first vectors; (h) repeating steps (e) through (g) until a given criteria is satisfied.
Claim 13
Dependent Claim
25 words
The method according to claim 10, wherein said first and second vectors comprise first strictly typical source vectors and second strictly typical reproduction vectors, respectively.
Claim 14
Dependent Claim
22 words
The method according to claim 11, wherein said given criteria is that all vectors in said set of second vectors are eliminated.
Claim 15
Dependent Claim
44 words
The method according to claim 11, wherein said step of determining the number of covered vectors comprises the step of selecting a joint probability matrix Q that minimizes mutual information of said set of first vectors with respect to said set of second vectors.
Claim 16
Dependent Claim
78 words
The method according to claim 13, wherein said first and second set of vectors each consists of N elements and said step of determining the number of covered vectors further comprises the step of determining that a vector of said first set is covered by a vector of said second set if, when the elements of the two vectors are paired, each pair with first vectors element i and second vectors element j occurs exactly NQ ij times.
Claim 17
Dependent Claim
83 words
The method according to claim 11, further comprising, after the step of eliminating the covering vectors from the set of first vectors, the steps of determining for each of the covered vectors in the set of first vectors, all those vectors in the set of second vectors covered by each of the covered vectors in the set of first vectors and eliminating each vector in said set of second vectors which is covered by said covered vectors in said set of first vectors.
Claim 18
Dependent Claim
33 words
The method according to claim 15, wherein said given criteria is that all vectors in said set of first vectors are covered or all vectors in said set of second vectors are eliminated.
Claim 19
Dependent Claim
30 words
The method according to claim 15, wherein said step of determining the number of covered vectors comprises the step of selecting a joint probability matrix Q that minimizes mutual information.
Claim 20
Dependent Claim
78 words
The method according to claim 17, wherein said first and second set of vectors each consists of N elements and said step of determining the number of covered vectors further comprises the step of determining that a vector of said first set is covered by a vector of said second set if, when the elements of the two vectors are paired, each pair with first vectors element i and second vectors element j occurs exactly NQ ij times.
Claim 21
Independent Claim
161 words
A device for selecting at least one code word from a set of second data said at least one code word being selected to represent data in a set of first data, said sets of first and second data having at least one data group, said device comprising: determining means for determining, for one of said at least one data group of said set of second data, all those data groups in said set of first data covered by said one of said set of second data; selecting means for selecting as one of said at least one code word the one of said at least one data group of said set of second data which covers the maximum number of data groups of the data groups remaining in said set of first data; eliminating means for eliminating the covered data groups from said set of first data; and means for repeating the above steps until a given criteria is satisfied.
Claim 22
Independent Claim
161 words
A device for selecting at least one code word from a set of second data said at least one code word being selected to represent data in a set of first data, said sets of first and second data having at least one data group, said device comprising: determining means for determining, for one of said at least one data group of said set of second data, all those data groups in said set of first data covered by said one of said set of second data; selecting means for selecting as one of said at least one code word the one of said at least one data group of said set of second data which covers the maximum number of data groups of the data groups remaining in said set of first data; eliminating means for eliminating the covered data groups from said set of first data; and means for repeating the above steps until a given criteria is satisfied.
Claim 23
Dependent Claim
20 words
The device according to claim 19, wherein said first data comprises source words and said second data comprises reproduction words.
Claim 24
Dependent Claim
23 words
The device according to claim 19, wherein said given criteria is that all data groups in said set of first data are covered.
Claim 25
Dependent Claim
35 words
The device according to claim 19, further comprising selecting means for selecting a joint probability matrix Q that minimizes mutual information of said set of first data with respect to said set of second data.
Claim 26
Dependent Claim
76 words
The device according to claim 22, wherein said sets of first and second data groups each consists of N elements and said determining means further comprises determining means for determining that a data group of said first set is covered by a data group of said second set if, when the elements of the two data groups are paired, each pair with first data element i and second data element j occurs exactly NQ ij times.
Claim 27
Dependent Claim
72 words
The device according to claim 19, further comprising determining means for determining, for each covered data group in said set of first data, all those data groups in said set of second data covered by said one of said set of first data and eliminating means for eliminating each data group in said set of second data groups which is covered by said covered data groups in said set of first data.
Claim 28
Dependent Claim
36 words
The device according to claim 24, wherein said given criteria is that all data groups in said set of first data are covered or all data groups in said set of second data groups are eliminated.
Claim 29
Dependent Claim
35 words
The device according to claim 24, further comprising selecting means for selecting a joint probability matrix Q that minimizes mutual information of said set of first data with respect to said set of second data.
Claim 30
Dependent Claim
76 words
The device according to claim 26, wherein said sets of first and second data groups each consisfts of N elements and said determining means further comprises determining means for determining that a data group of said first set is covered by a data group of said second set if, when the elements of the two data groups are paired, each pair with first data element i and second data element j occurs exactly NQ ij times.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-02-26 | 1993-08-28 | 1994-02-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-02-26 | 1997-08-28 | 1998-02-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-02-26 | 2001-08-28 | 2002-02-27 | $7700.00 | Window Closed / Lapsed |