← Back to Patent Explorer
US4569052A Expired / Lapsed US ⏱️ 0.0 years remaining

Coset code generator for computer memory protection

Assignee: Unisys Corp
•
Filing: 1983-07-14
•
Granted: 1986-02-04
•
Expires: 2003-07-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus for protecting computer memory utilizes a parity matrix to generate an n-k check bit signal of an extended linear (n,k,4) code from a k data bit signal. Exclusive-OR gates add the n-k check bit signal to an n-k tag bit signal selected from a predetermined class, to form, when concatenated with the k data bit signal, an element of a code of a certain class. The element comprising the k data bit signal is written in memory. A correction matrix or And gate cooperating with exclusive-OR gates detects an attempt to access the k data bit signal with an n-k key bit signal belonging to the same class as the n-k tag bit signal, but which does not match it.

Inventors

  • 👤 Martin Cohn
  • 👤 Terry A. Welch
  • 👤 Abraham Lempel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 15:21
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/14; G06F12/1458; G06F11/00; G06F11/07; G06F11/08; G06F11/10; H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13

Claims Analysis

Total Claims: 60
Claim 1
Independent Claim 288 words
An apparatus for protecting computer memory using coset codes of weight 2 comprising: coding means for receiving a k data bit signal, and for generating an n-k check bit signal of an extended linear (n,k,4) code from said k data bit signal; first generator means for providing an n-k tag bit signal having even weight; second generator means for providing an n-k key bit signal having even weight; addition means, coupled to said coding means and said first and second generator means, for receiving said n-k tag bit signal, and an n-k check bit signal generated from a k data bit signal received by said coding means, and for generating a first sum signal by performing exclusive-OR addition of said n-k tag bit signal to said n-k check bit signal, said first sum signal and said k data bit signal from which said n-k check bit signal is generated being received by said computer memory, said addition means further for receiving said n-k key bit signal, and an n-k check bit signal generated from said k data bit signal read from said memory and received by said coding means, and for generating a second sum signal by performing exclusive-OR addition of said n-k key bit signal to said n-k check bit signal generated from said k data bit signal read from said computer memory and received by said coding means; and testing means, coupled to said addition means, for receiving said first sum signal read from said memory, and for receiving said second sum signal generated by said addition means, and for detecting and indicating a disparity of an even number of bit signals between said first sum signal read from said memory and said second sum signal.
Claim 2
Independent Claim 288 words
An apparatus for protecting computer memory using coset codes of weight 2 comprising: coding means for receiving a k data bit signal, and for generating an n-k check bit signal of an extended linear (n,k,4) code from said k data bit signal; first generator means for providing an n-k tag bit signal having even weight; second generator means for providing an n-k key bit signal having even weight; addition means, coupled to said coding means and said first and second generator means, for receiving said n-k tag bit signal, and an n-k check bit signal generated from a k data bit signal received by said coding means, and for generating a first sum signal by performing exclusive-OR addition of said n-k tag bit signal to said n-k check bit signal, said first sum signal and said k data bit signal from which said n-k check bit signal is generated being received by said computer memory, said addition means further for receiving said n-k key bit signal, and an n-k check bit signal generated from said k data bit signal read from said memory and received by said coding means, and for generating a second sum signal by performing exclusive-OR addition of said n-k key bit signal to said n-k check bit signal generated from said k data bit signal read from said computer memory and received by said coding means; and testing means, coupled to said addition means, for receiving said first sum signal read from said memory, and for receiving said second sum signal generated by said addition means, and for detecting and indicating a disparity of an even number of bit signals between said first sum signal read from said memory and said second sum signal.
Claim 3
Dependent Claim 14 words
An apparatus as in claim 1 wherein said coding means comprises a parity matrix.
Claim 4
Dependent Claim 36 words
An apparatus as in claim 2 wherein said addition means comprises a first set of n-k exclusive-OR gates, each of said gates of said first set generating an exclusive-OR sum of corresponding components of received signals.
Claim 5
Dependent Claim 106 words
An apparatus as in claim 3 wherein said testing means comprises a second set of n-k exclusive-OR gates, each of said gates of said second set receiving and generating an exclusive-OR sum of corresponding components of said first sum signal read from said memory and said second sum signal generated by said addition means; and a correction matrix, coupled to said second set of exclusive-OR gates, which receives said exclusive-OR sums generated by said second set of exclusive-OR gates and detects and indicates a disparity of an even number of bit signals between said first sum signal read from said memory and said second sum signal.
Claim 6
Dependent Claim 13 words
An apparatus as in claim 4 wherein k is a power of 2.
Claim 7
Dependent Claim 10 words
An apparatus as in claim 4 wherein k is 8.
Claim 8
Dependent Claim 10 words
An apparatus as in claim 4 wherein k is 16.
Claim 9
Dependent Claim 10 words
An apparatus as in claim 4 wherein k is 32.
Claim 10
Dependent Claim 10 words
An apparatus as in claim 4 wherein k is 36.
Claim 11
Dependent Claim 13 words
An apparatus as in claim 1 wherein k is a power of 2.
Claim 12
Dependent Claim 10 words
An apparatus as in claim 1 wherein k is 8.
Claim 13
Dependent Claim 10 words
An apparatus as in claim 1 wherein k is 16.
Claim 14
Dependent Claim 10 words
An apparatus as in claim 1 wherein k is 32.
Claim 15
Dependent Claim 10 words
An apparatus as in claim 1 wherein k is 36.
Claim 16
Dependent Claim 71 words
An apparatus as in claim 1 wherein said testing means is additionally for receiving said k data bit signal read from said memory, and for detecting and indicating a disparity of one bit signal between said first sum signal read from said memory and said second sum signal, and for correcting an error in said k data bit signal read from said memory which said disparity of one bit signal signifies.
Claim 17
Dependent Claim 14 words
An apparatus as in claim 15 wherein said coding means comprises a parity matrix.
Claim 18
Dependent Claim 36 words
An apparatus as in claim 16 wherein said addition means comprises a first set of n-k exclusive-OR gates, each of said gates of said first set generating an exclusive-OR sum of corresponding components of received signals.
Claim 19
Dependent Claim 159 words
An apparatus as in claim 17 wherein said testing means comprises a second set of n-k exclusive-OR gates, each of said gates of said second set receiving and generating an exclusive-OR sum of corresponding components of said first sum signal read from said memory and said second sum signal generated by said addition means; and a correction matrix, coupled to said second set of exclusive-OR gates, which receives said exclusive-OR sums generated by said second set of exclusive-OR gates, receives said k data bit signal read from said memory, detects and indicates a disparity of an even number of bit signals between said first sum signal read from said memory and said second sum signal, detects and indicates a disparity of one bit signal between said first sum signal read from said memory and said second sum signal, and corrects an error in said k data bit signal read from said memory which said disparity of one bit signifies.
Claim 20
Dependent Claim 13 words
An apparatus as in claim 18 wherein k is a power of 2.
Claim 21
Dependent Claim 10 words
An apparatus as in claim 18 wherein k is 8.
Claim 22
Dependent Claim 10 words
An apparatus as in claim 18 wherein k is 16.
Claim 23
Dependent Claim 10 words
An apparatus as in claim 18 wherein k is 32.
Claim 24
Dependent Claim 10 words
An apparatus as in claim 18 wherein k is 36.
Claim 25
Dependent Claim 13 words
An apparatus as in claim 15 wherein k is a power of 2.
Claim 26
Dependent Claim 10 words
An apparatus as in claim 15 wherein k is 8.
Claim 27
Dependent Claim 10 words
An apparatus as in claim 15 wherein k is 16.
Claim 28
Dependent Claim 10 words
An apparatus as in claim 15 wherein k is 32.
Claim 29
Dependent Claim 10 words
An apparatus as in claim 15 wherein k is 36.
Claim 30
Independent Claim 337 words
An apparatus for protecting computer memory using coset codes of weight 3 comprising: coding means for receiving a k data bit signal and for generating an n-k check bit signal of an extended linear (n,k,4) code from said k data bit signal; first generator means for providing an n-k tag bit signal chosen from a set of two signals consisting of an all zero n-k bit signal and a fixed but arbitrary n-k bit signal having odd weight, whose n-k bits do not form a column of a correction matrix corresponding to said linear (n,k,4) code; second generator means for providing an n-k key bit signal chosen from said set of two signals; addition means, coupled to said coding means and said first and second generator means, for receiving said n-k tag bit signal, and an n-k check bit signal generated from a k data bit signal received by said coding means, and for generating a first sum signal by performing exclusive-OR addition of said n-k tag bit signal to said n-k check bit signal, said first sum signal, and said k data bit signal from which said n-k check bit signal is generated being received by said computer memory, said addition means further for receiving said n-k key bit signal, and an n-k check bit signal generated from said k data bit signal read from said memory and received by said coding means, and for generating a second sum signal by performing exclusive-OR addition of said n-k key bit signal to said n-k check bit signal generated from said k data bit signal read from said computer memory and received by said coding means; and testing means, coupled to said addition means, for receiving said first sum signal read from said memory and for receiving said second sum signal generated by said addition means, and for detecting and indicating a disparity of an odd number, not less than 3, of bit signals between said first sum signal read from said memory and said second sum signal.
Claim 31
Independent Claim 337 words
An apparatus for protecting computer memory using coset codes of weight 3 comprising: coding means for receiving a k data bit signal and for generating an n-k check bit signal of an extended linear (n,k,4) code from said k data bit signal; first generator means for providing an n-k tag bit signal chosen from a set of two signals consisting of an all zero n-k bit signal and a fixed but arbitrary n-k bit signal having odd weight, whose n-k bits do not form a column of a correction matrix corresponding to said linear (n,k,4) code; second generator means for providing an n-k key bit signal chosen from said set of two signals; addition means, coupled to said coding means and said first and second generator means, for receiving said n-k tag bit signal, and an n-k check bit signal generated from a k data bit signal received by said coding means, and for generating a first sum signal by performing exclusive-OR addition of said n-k tag bit signal to said n-k check bit signal, said first sum signal, and said k data bit signal from which said n-k check bit signal is generated being received by said computer memory, said addition means further for receiving said n-k key bit signal, and an n-k check bit signal generated from said k data bit signal read from said memory and received by said coding means, and for generating a second sum signal by performing exclusive-OR addition of said n-k key bit signal to said n-k check bit signal generated from said k data bit signal read from said computer memory and received by said coding means; and testing means, coupled to said addition means, for receiving said first sum signal read from said memory and for receiving said second sum signal generated by said addition means, and for detecting and indicating a disparity of an odd number, not less than 3, of bit signals between said first sum signal read from said memory and said second sum signal.
Claim 32
Dependent Claim 14 words
An apparatus as in claim 29 wherein said coding means comprises a parity matrix.
Claim 33
Dependent Claim 36 words
An apparatus as in claim 30 wherein said addition means comprises a first set of n-k exclusive-OR gates, each of said gates of said first set generating an exclusive-OR sum of corresponding components of received signals.
Claim 34
Dependent Claim 160 words
An apparatus as in claim 31 wherein said testing means comprises: a second set of n-k exclusive-OR gates, each of said gates of said second set receiving and generating an exclusive-OR sum of corresponding components of said first sum signal read from said memory and said second sum signal generated by said addition means; inverting means, coupled to said second set of n-k exclusive-OR gates, for inverting said sums generated by said second set of exclusive-OR gates which correspond in position to zero components of said fixed but arbitrary n-k bit signal having odd weight, whose n-k bits do not form a column of a correction matrix corresponding to said linear (n,k,4) code; and And gate means, coupled to said inverting means and said second set of exclusive-OR gates, for receiving said inverted sums, and said sums generated by said second set of exclusive-OR gates which are not inverted, and for detecting and indicating when all received signals are one.
Claim 35
Dependent Claim 73 words
An apparatus as in claim 32 wherein said inverting means comprises inverters, each disposed to receive a sum generated by said second set of exclusive-OR gates which corresponds in position to a zero component of said fixed but arbitrary n-k bit signal having odd weight, whose n-k bits do not form a column of a correction matrix corresponding to said linear (n,k,4) code, and wherein said And gate means comprises an And gate.
Claim 36
Dependent Claim 13 words
An apparatus as in claim 33 wherein k, is a power of 2.
Claim 37
Dependent Claim 10 words
An apparatus as in claim 33 wherein k is 8.
Claim 38
Dependent Claim 10 words
An apparatus as in claim 33 wherein k is 16.
Claim 39
Dependent Claim 10 words
An apparatus as in claim 33 wherein k is 32.
Claim 40
Dependent Claim 10 words
An apparatus as in claim 33 wherein k is 36.
Claim 41
Dependent Claim 13 words
An apparatus as in claim 29 wherein k is a power of 2.
Claim 42
Dependent Claim 10 words
An apparatus as in claim 29 wherein k is 8.
Claim 43
Dependent Claim 10 words
An apparatus as in claim 29 wherein k is 16.
Claim 44
Dependent Claim 10 words
An apparatus as in claim 29 wherein k is 32.
Claim 45
Dependent Claim 10 words
An apparatus as in claim 29 wherein k is 36.
Claim 46
Dependent Claim 99 words
An apparatus as in claim 29 wherein said testing means is additionally for receiving said k data bit signal read from said memory, and for detecting and indicating a disparity of an even number of bit signals between said first sum signal read from said memory and said second sum signal, and for detecting and indicating a disparity of one bit signal between said first sum signal read from said memory and said second sum signal, and for correcting an error in said k data bit signal read from said memory which said disparity of one bit signal signifies.
Claim 47
Dependent Claim 14 words
An apparatus as in claim 44 wherein said coding means comprises a parity matrix.
Claim 48
Dependent Claim 36 words
An apparatus as in claim 45 wherein said addition means comprises a first set of n-k exclusive-OR gates, each of said gates of said first set generating an exclusive-OR sum of corresponding components of received signals.
Claim 49
Dependent Claim 264 words
An apparatus as in claim 46 wherein said testing means comprises: a second set of n-k exclusive-OR gates, each of said gates of said second set receiving and generating an exclusive-OR sum of corresponding components of said first sum signal read from said memory and said second sum signal generated by said addition means; inverting means, coupled to said second set of n-k exclusive-OR gates, for inverting said sums generated by said second set of exclusive-OR gates which correspond in position to zero components of said fixed but arbitrary n-k bit signal having odd weight, whose n-k bits do not form a column of a correction matrix corresponding to said linear (n,k,4) code; And gate means, coupled to said inverting means and said second set of exclusive-OR gates, for receiving said inverted sums, and said sums generated by said second set of exclusive-OR gates which are not inverted, and for detecting and indicating when all received signals are one; and a correction matrix, coupled to said second set of exclusive-OR gates, which receives said exclusive-OR sums generated by sid second set of exclusive-OR gates, receives said k data bit signal read from said memory, detects and indicates a disparity of an even number of bit signals between said first sum signal read from said memory and said second sum signal, detects and indicates a disparity of one bit signal between said first sum signal read from said memory and said second sum signal, and corrects an error in said k data bit signal read from said memory which said disparity of one bit signifies.
Claim 50
Dependent Claim 73 words
An apparatus as in claim 47 wherein said inverting means comprises inverters, each disposed to receive a sum generated by said second set of exclusive-OR gates which corresponds in position to a zero component of said fixed but arbitrary n-k bit signal having odd weight, whose n-k bits do not form a column of a correction matrix corresponding to said linear (n,k,4) code, and wherein said And gate means comprises an And gate.
Claim 51
Dependent Claim 13 words
An apparatus as in claim 48 wherein k is a power of 2.
Claim 52
Dependent Claim 10 words
An apparatus as in claim 48 wherein k is 8.
Claim 53
Dependent Claim 10 words
An apparatus as in claim 48 wherein k is 16.
Claim 54
Dependent Claim 10 words
An apparatus as in claim 48 wherein k is 32.
Claim 55
Dependent Claim 10 words
An apparatus as in claim 48 wherein k is 36.
Claim 56
Dependent Claim 13 words
An apparatus as in claim 44 wherein k is a power of 2.
Claim 57
Dependent Claim 10 words
An apparatus as in claim 49 wherein k is 8.
Claim 58
Dependent Claim 10 words
An apparatus as in claim 44 wherein k is 16.
Claim 59
Dependent Claim 10 words
An apparatus as in claim 44 wherein k is 32.
Claim 60
Dependent Claim 10 words
An apparatus as in claim 44 wherein k is 36.

References Cited (Backward Citations)

US3466601A Cited
US3550082A Cited
US4271520A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-02-03 1989-08-05 1990-02-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-02-03 1993-08-05 1994-02-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-02-03 1997-08-05 1998-02-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag