US4146046A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Coded record and methods of and apparatus for encoding and decoding records
Assignee: BT Commercial Corp
•
Filing: 1975-03-31
•
Granted: 1979-03-27
•
Expires: 1995-03-31
Abstract
Abstract A novel record with alternate width modulated bars and spaces is decoded by comparing the width of each bar or space with a pair of reference values based on the product and quotient of a constant and the width of another bar or space to establish bit value. When the width value is greater or less than the reference value, the bit value is established. When the width values lie between the reference values, a state of equality is established which is resolved into a bit value by reference to the results of a prior or subsequent comparison. A system embodying the method includes storage means for storing width values, reference registers for establishing successive different sets of product and quotient reference values, and comparators controlled by the stored width and reference values for establishing the greater and less than and equality status conditions. In one embodiment, a shift register and logic circuits controlled by the status conditions provide dynamic interpretation of the status conditions into code bits as the character is read. In another embodiment, the status conditions are stored and then translated into code bits after a complete character has been read. In one code set, each character code of seven bits formed by four bars and three spaces uses five bits to define the character and the remaining two bits to provide separate bar and space parity bits. This and the fact that only one space "1" and one bar "1" are included in a proper code results in a code with an extremely low expected rate of undetected error. The system also includes separate parity check circuits for the decoded bar and space bits.
Inventors
- 👤 Bruce W. Dobras
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 19:51
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/10544; G06K7/10821; G06K7/10881; G06K7/01; G06K7/016; G06K7/0166; G06K7/14; G06K7/1404; G06K7/146; G06K7/1486
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
113 words
A method of encoding an N bit character code on a record which comprises the steps of recording said N bits on said record with X bits recorded in areas of a first characteristic and Y bits recorded in areas of a second characteristic and wherein X and Y are integers and X + Y = N, recording a first parity bit for the X bits in an area of said first characteristic which follows said X bit areas, and recording a second parity bit for the Y bit in an area of said second characteristic which follows said Y bit areas, whereby the encoded character code includes N + 2 bit recordings.
Claim 2
Independent Claim
113 words
A method of encoding an N bit character code on a record which comprises the steps of recording said N bits on said record with X bits recorded in areas of a first characteristic and Y bits recorded in areas of a second characteristic and wherein X and Y are integers and X + Y = N, recording a first parity bit for the X bits in an area of said first characteristic which follows said X bit areas, and recording a second parity bit for the Y bit in an area of said second characteristic which follows said Y bit areas, whereby the encoded character code includes N + 2 bit recordings.
Claim 3
Dependent Claim
48 words
The method set forth in claim 1 wherein the steps of recording said N bits includes printing X discrete and spaced areas on the record to define Y intervening areas and varying the sizes of the X and Y areas in accordance with binary "0" and "1" data.
Claim 4
Dependent Claim
130 words
A coded record for an N bit character which comprises a record, N areas of different first and second characteristics on said record alternated with each other along a given path, said areas of first and second characteristics having different widths as measured along said path representing different code values, a first additional area following said N areas along said path and having a width as measured along said path representing the value of a code checking bit for the code values represented by the areas of said first characteristic, and a second additional area following said first additional areas and having a width as measured along said path representing the value of a code checking bit for the code values represented by the areas of the said second characteristic.
Claim 5
Dependent Claim
130 words
A coded record for an N bit character which comprises a record, N areas of different first and second characteristics on said record alternated with each other along a given path, said areas of first and second characteristics having different widths as measured along said path representing different code values, a first additional area following said N areas along said path and having a width as measured along said path representing the value of a code checking bit for the code values represented by the areas of said first characteristic, and a second additional area following said first additional areas and having a width as measured along said path representing the value of a code checking bit for the code values represented by the areas of the said second characteristic.
Claim 6
Dependent Claim
68 words
The method of claim 2 wherein the relative widths of pairs of said printed areas and the relative widths of pairs of said intervening areas provide said binary "0" and "1" data, and including the step of correlating the width of said first parity bit with said recorded X bits so that said X bits and said first parity bit collectively include only a single wide printed area.
Claim 7
Dependent Claim
41 words
The method of claim 4 which includes the step of correlating the width of said second parity bit with said recorded Y bits so that said Y bits and said second parity bit collectively include only a single wide intervening area.
Claim 8
Dependent Claim
145 words
A coded record for reading by relative movement between the record and a reader along a path comprising a record member, and a series of segments of different first and second characteristics alternated with each other along said series, the segments in said series having different widths measured in a direction along said path and the relative widths of sequentially-positioned pairs of segments of like characteristic in said series providing coded representations of data values, at least some of said segments forming a part of the coded representation of more than one data value, said series of segments including only a single relatively wide segment of each of said first and second characteristics measured in a direction along said path, whereby said segments can be validly altered only by simultaneously changing the width of segments of both said first and second characteristics in opposite directions.
Claim 9
Dependent Claim
145 words
A coded record for reading by relative movement between the record and a reader along a path comprising a record member, and a series of segments of different first and second characteristics alternated with each other along said series, the segments in said series having different widths measured in a direction along said path and the relative widths of sequentially-positioned pairs of segments of like characteristic in said series providing coded representations of data values, at least some of said segments forming a part of the coded representation of more than one data value, said series of segments including only a single relatively wide segment of each of said first and second characteristics measured in a direction along said path, whereby said segments can be validly altered only by simultaneously changing the width of segments of both said first and second characteristics in opposite directions.
Claim 10
Independent Claim
97 words
The method of encoding an N bit character code on a record which comprises the steps of, recording X bits of said code by printing X discrete and spaced areas on the record to define Y intervening areas and wherein X and Y are integers and X + Y = N, and varying the sizes of the X and Y areas between wide and narrow values in accordance with binary "1" and "0" data, the width of said narrow X printed areas under normal printing conditions being substantially less than the width of said narrow Y spaces.
Claim 11
Independent Claim
97 words
The method of encoding an N bit character code on a record which comprises the steps of, recording X bits of said code by printing X discrete and spaced areas on the record to define Y intervening areas and wherein X and Y are integers and X + Y = N, and varying the sizes of the X and Y areas between wide and narrow values in accordance with binary "1" and "0" data, the width of said narrow X printed areas under normal printing conditions being substantially less than the width of said narrow Y spaces.
Claim 12
Dependent Claim
33 words
The method of encoding set forth in claim 7 wherein the width of said wide X printed areas under normal printing conditions is substantially less than the width of said wide Y spaces.
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) | 1982-03-26 | 1982-09-25 | 1983-03-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1986-03-26 | 1986-09-25 | 1987-03-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1990-03-26 | 1990-09-25 | 1991-03-27 | $7700.00 | Window Closed / Lapsed |