Bar code scan stitching

Claim 1

A method for combining decoded scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and wherein the ordered sequence has a predetermined length, the method comprising the steps of: scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; determining whether the decoded sequences of characters includes one of the first and second delimiting characters; repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found, said first and second decoded sequences having respective lengths; comparing the predetermined length to a sum of the lengths of the first and second decoded sequences of data characters; and based on the comparison and independently of the respective lengths of the first and second decoded sequences, combining the first and second sequences to produce the ordered sequence of data characters.

Claim 2

A method for combining decoded scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and wherein the ordered sequence has a predetermined length, the method comprising the steps of: scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; determining whether the decoded sequences of characters includes one of the first and second delimiting characters; repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found, said first and second decoded sequences having respective lengths; comparing the predetermined length to a sum of the lengths of the first and second decoded sequences of data characters; and based on the comparison and independently of the respective lengths of the first and second decoded sequences, combining the first and second sequences to produce the ordered sequence of data characters.

Claim 3

A method for combining decoded scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and wherein the ordered sequence has a predetermined length, the method comprising the steps of: scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; determining whether the decoded sequences of characters includes one of the first and second delimiting characters; repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; comparing the predetermined length to lengths of the first and second decoded sequences of data characters; and based on the comparison, combining the first and second sequences to produce the ordered sequence of data characters by concatenating the first and second decoded sequences to produce the ordered sequence if the sum of the character lengths of the first and second sequences is equal to the predetermined length.

Claim 4

A method for combining decoded scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and wherein the ordered sequence has a predetermined length, the method comprising the steps of: scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; determining whether the decoded sequences of characters includes one of the first and second delimiting characters; repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; comparing the predetermined length to lengths of the first and second decoded sequences of data characters; and based on the comparison, combining the first and second sequences to produce the ordered sequence of data characters by concatenating the first and second decoded sequences to produce the ordered sequence if the sum of the character lengths of the first and second sequences is equal to the predetermined length.

Claim 10

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character and has a predetermined length, the method comprising the steps of: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; (D) comparing the lengths of the first and second sequences of data characters to the predetermined length; (E) in the event that the sum of the lengths of the first and second sequences of data characters is equal to the predetermined length, combining the first and second sequences of data characters to produce the ordered sequence of data characters; (F) in the event that the sum of the lengths of the first and second sequences of data characters is greater than the predetermined length, performing the following steps: comparing overlapping portions of the first and second sequences of data characters, based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters match, combining the first and second sequences of data characters to produce the ordered sequence of data characters, and based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters do not match, repeating the scanning, determining, repeating, and comparing steps; and in the event that the sum of the lengths of the first and second sequences of data characters is less than the predetermined length, repeating steps (A) through (F).

Claim 11

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character and has a predetermined length, the method comprising the steps of: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; (D) comparing the lengths of the first and second sequences of data characters to the predetermined length; (E) in the event that the sum of the lengths of the first and second sequences of data characters is equal to the predetermined length, combining the first and second sequences of data characters to produce the ordered sequence of data characters; (F) in the event that the sum of the lengths of the first and second sequences of data characters is greater than the predetermined length, performing the following steps: comparing overlapping portions of the first and second sequences of data characters, based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters match, combining the first and second sequences of data characters to produce the ordered sequence of data characters, and based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters do not match, repeating the scanning, determining, repeating, and comparing steps; and in the event that the sum of the lengths of the first and second sequences of data characters is less than the predetermined length, repeating steps (A) through (F).

Claim 13

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and encodes a predetermined check value, the method comprising the steps of: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found, said first and second decoded sequences having respective lengths; (D) independently of the respective lengths of the first and second decoded sequences, combining the first and second sequences of data characters to form a test sequence of data characters; (E) determining a test check value for the test sequence; (F) comparing the test check value to the predetermined encoded check value; and (G) in the event that the test check value is substantially equal to the predetermined check value, combining the first and second sequences of data characters to produce the ordered sequence of data characters.

Claim 14

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and encodes a predetermined check value, the method comprising the steps of: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found, said first and second decoded sequences having respective lengths; (D) independently of the respective lengths of the first and second decoded sequences, combining the first and second sequences of data characters to form a test sequence of data characters; (E) determining a test check value for the test sequence; (F) comparing the test check value to the predetermined encoded check value; and (G) in the event that the test check value is substantially equal to the predetermined check value, combining the first and second sequences of data characters to produce the ordered sequence of data characters.

Claim 16

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character and has a fixed length, the method comprising the steps of: first, determining the fixed length by the steps of: scanning an entire representative bar code symbol along a scan path which includes the first and second delimiting characters to obtain a representative series of elements; decoding the representative series of elements to obtain a representative sequence of data characters; and counting the number of data characters in the representative sequence of data characters to obtain the fixed length, and then: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; (D) comparing the fixed length to the lengths of the first and second sequences of data characters; and (E) in the event that the sum of the lengths of the first and second sequences is equal to the fixed length, combining the first and second sequences to produce the ordered sequence of data characters.

Claim 17

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character and has a fixed length, the method comprising the steps of: first, determining the fixed length by the steps of: scanning an entire representative bar code symbol along a scan path which includes the first and second delimiting characters to obtain a representative series of elements; decoding the representative series of elements to obtain a representative sequence of data characters; and counting the number of data characters in the representative sequence of data characters to obtain the fixed length, and then: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; (D) comparing the fixed length to the lengths of the first and second sequences of data characters; and (E) in the event that the sum of the lengths of the first and second sequences is equal to the fixed length, combining the first and second sequences to produce the ordered sequence of data characters.

Claim 21

The method of one of claims 13, 14 or 15 wherein step (F) further includes performing the step of: based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters do not match, repeating steps (A) through (F).

Claim 22

The method of one of claims 13, 14 or 15 wherein step (F) further includes performing the step of: based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters do not match, combining the first and second sequences of data characters to produce the ordered sequence by the steps of: selecting a sequence of the first and second sequences of data characters corresponding to the scan path that was scanned the most times, and combining the selected sequence with a sequence obtained by removing the overlapping portion from the sequence of the first and second sequences of data characters not selected.

Claim 23

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character and has a fixed length, the method comprising the steps of: first, determining the fixed length, and then: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; (D) comparing the lengths of the first and second sequences of data characters to the fixed length; (E) based on the comparison of the lengths, in the event that the sum of the lengths of the first and second sequences of data characters is equal to the fixed length, combining the first and second sequences of data characters to produce the ordered sequence of data characters; (F) based on the comparison of the lengths, in the event that the sum of the lengths of the first and second sequences of data characters is greater than the fixed length, performing the following steps: (G) comparing overlapping portions of the first and second sequences of data characters, (H) based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters match, combining the first and second sequences of data characters to produce the ordered sequence of data characters, and (I) based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters do not match, repeating steps (A) through (I); and (J) based on the comparison of the lengths, in the event that the sum of the lengths of the first and second sequences of data characters is less than the fixed length, repeating steps (A) through (J).

Claim 24

A method for combining scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of data characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character and has a fixed length, the method comprising the steps of: first, determining the fixed length, and then: (A) scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; (B) determining whether the decoded sequences of characters includes one of the first and second delimiting characters; (C) repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; (D) comparing the lengths of the first and second sequences of data characters to the fixed length; (E) based on the comparison of the lengths, in the event that the sum of the lengths of the first and second sequences of data characters is equal to the fixed length, combining the first and second sequences of data characters to produce the ordered sequence of data characters; (F) based on the comparison of the lengths, in the event that the sum of the lengths of the first and second sequences of data characters is greater than the fixed length, performing the following steps: (G) comparing overlapping portions of the first and second sequences of data characters, (H) based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters match, combining the first and second sequences of data characters to produce the ordered sequence of data characters, and (I) based on the comparison of the overlapping portions, in the event that the overlapping portions of the first and second sequences of data characters do not match, repeating steps (A) through (I); and (J) based on the comparison of the lengths, in the event that the sum of the lengths of the first and second sequences of data characters is less than the fixed length, repeating steps (A) through (J).

Claim 26

The method of one of claims 12, 18 or 19, further comprising the steps of: determining the elapsed time between the step of scanning along the first path and the step of scanning along the second scanning path; comparing the elapsed time to a predetermined acceptable elapsed time; based on the comparison of the times, in the event that the elapsed time is less than the predetermined acceptable elapsed time, performing the remaining steps of the method; based on the comparison of the times, in the event that the elapsed time exceeds the predetermined acceptable time, repeating steps (A) through (C).

Claim 27

A method for combining decoded scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and wherein the ordered sequence has a predetermined length, the method comprising the steps of: scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; determining whether the decoded sequences of characters includes one of the first and second delimiting characters; repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; measuring the elapsed time between finding the first decoded sequence and finding the second decoded sequence; comparing the elapsed time to a predetermined acceptable elapsed time, wherein in the event that the elapsed time is less than the predetermined acceptable elapsed time, performing the remaining steps of the method, and in the event that the elapsed time exceeds the predetermined acceptable time, repeating the scanning, determining, and repeating steps; comparing the predetermined length to lengths of the first and second decoded sequences of data characters; and based on the comparison, combining the first and second sequences to produce the ordered sequence of data characters.

Claim 28

A method for combining decoded scan fragments of a bar code symbol composed of a plurality of bar code elements representing an ordered sequence of characters, wherein the ordered sequence is delimited by a first delimiting character and a second delimiting character, and wherein the ordered sequence has a predetermined length, the method comprising the steps of: scanning the symbol along a plurality of scan paths and decoding the scanned elements to obtain decoded sequences of characters; determining whether the decoded sequences of characters includes one of the first and second delimiting characters; repeating the scanning and determining steps until at least a first decoded sequence with the first delimiting character and a second decoded sequence with the second delimiting character are found; measuring the elapsed time between finding the first decoded sequence and finding the second decoded sequence; comparing the elapsed time to a predetermined acceptable elapsed time, wherein in the event that the elapsed time is less than the predetermined acceptable elapsed time, performing the remaining steps of the method, and in the event that the elapsed time exceeds the predetermined acceptable time, repeating the scanning, determining, and repeating steps; comparing the predetermined length to lengths of the first and second decoded sequences of data characters; and based on the comparison, combining the first and second sequences to produce the ordered sequence of data characters.