# US 2025/0061298 A1 · Two-dimensional barcodes for greater storage capacity

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0061298 A1
- Document ID: US20250061298A1
- Status: Published application
- Kind: A1
- Application number: 18/940,239
- Filed: 2024-11-07
- Published: 2025-02-20
- Earliest claimed: 2021-11-03
- Inventors: Arlon Blaine Harper; Chase Joshua Harper
- Web page: https://patentgrep.com/patent/US20250061298A1

## CPC

- G06K 7/1417: {2D bar codes}
- G06F 21/36: by graphic or iconic representation
- G06K 7/1434: {Barcodes with supplemental or add-on codes}
- G06K 7/1443: {locating of the code in an image}
- G06K 19/06037: {multi-dimensional coding}
- G06K 19/06056: {the marking comprising a further embedded marking, e.g. a 1D bar code with the black bars containing a smaller sized coding}
- G09C 5/00: Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages
- G06K: GRAPHICAL DATA READING (image or video recognition or understanding G06V); PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G09C: CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY

## Abstract

A method and computer program product provide operations including obtaining first data encoded to form a first array of two-dimensional barcodes, obtaining second data encoded to form a second array of two-dimensional barcodes, and performing a forward mashup algorithm on the first array and second array to form a third array of two-dimensional barcodes, wherein, for each combination of column, row and ordinal position, a binary value in the first array and a binary value in the second array are input to a first Boolean algorithm to produce a binary value for the same combination of column, row and ordinal position in the third array. The operations further include publishing the third array of two-dimensional barcodes, wherein the second array of two-dimensional barcodes are necessary to regenerate the first array of two-dimensional barcodes so that the first data can be decoded.

## Claims

### Claim 1

A computer program product comprising a non-volatile computer readable medium and non-transitory program instructions embodied therein, the program instructions being configured to be executable by a processor to cause the processor to perform operations comprising:
obtaining first data encoded to form a first array of two-dimensional barcodes, wherein each two-dimensional barcode in the first array includes a grid of dots representing binary values, wherein each dot has a location identified by a unique combination of a column and a row within the grid, and wherein each two-dimensional barcode is identified by a unique ordinal position in the first array;
obtaining second data encoded to form a second array of two-dimensional barcodes, wherein each two-dimensional barcode in the second array includes a grid of dots representing binary values, wherein each dot has a location identified by a unique combination of a column and a row within the grid, and wherein each two-dimensional barcode is identified by a unique ordinal position in the second array;
performing a forward mashup algorithm on the first array and second array to form a third array of two-dimensional barcodes, wherein, for each combination of column, row and ordinal position, the binary value in the first array and the binary value in the second array are input to a first Boolean algorithm to produce a binary value for the same combination of column, row and ordinal position in the third array; and
publishing the third array of two-dimensional barcodes, wherein the second array of two-dimensional barcodes are necessary to regenerate the first array of two-dimensional barcodes so that the first data can be decoded.

### Claim 2 (depends on 1)

The computer program product of claim 1, wherein each of the two-dimensional barcodes in the second array are identical.

### Claim 3 (depends on 1)

The computer program product of claim 1, the operations further comprising:
performing a reverse mashup algorithm on the third array and the second array to regenerate the first array, wherein, for each combination of column, row and ordinal position, the binary value in the third array and the binary value in the second array are input to a second Boolean algorithm to produce a binary value for the same combination of column, row and ordinal position in the first array.

### Claim 4 (depends on 3)

The computer program product of claim 3, wherein the second Boolean algorithm is predetermined to reverse the operation of the first Boolean algorithm.

### Claim 5 (depends on 4)

The computer program product of claim 4, the operations further comprising:
decoding the regenerated first array of two-dimensional barcode to obtain the first data.

### Claim 6 (depends on 5)

The computer program product of claim 5, wherein the first data includes a data file or an application program.

### Claim 7 (depends on 5)

The computer program product of claim 5, wherein each two-dimensional barcode in the third array of two-dimensional barcodes is published as an image including a grid of dots representing binary values, wherein each dot has a location identified by a unique combination of the column and the row within the grid, and wherein each two-dimensional barcode is identified by the ordinal position in the third array.

### Claim 8 (depends on 1)

The computer program product of claim 1, wherein the first Boolean algorithm is an exclusive OR operator.

### Claim 9 (depends on 1)

The computer program product of claim 1, wherein the third array of two-dimensional barcodes has the same number of two-dimensional barcodes as the first array of two-dimensional barcodes.

### Claim 10 (depends on 1)

The computer program product of claim 1, wherein the third array of two-dimensional barcodes is published by printing and/or displaying.

### Claim 11

A method, comprising:
obtaining first data encoded to form a first array of two-dimensional barcodes, wherein each two-dimensional barcode in the first array includes a grid of dots representing binary values, wherein each dot has a location identified by a unique combination of a column and a row within the grid, and wherein each two-dimensional barcode is identified by a unique ordinal position in the first array;
obtaining second data encoded to form a second array of two-dimensional barcodes, wherein each two-dimensional barcode in the second array includes a grid of dots representing binary values, wherein each dot has a location identified by a unique combination of a column and a row within the grid, and wherein each two-dimensional barcode is identified by a unique ordinal position in the second array;
performing a forward mashup algorithm on the first array and second array to form a third array of two-dimensional barcodes, wherein, for each combination of column, row and ordinal position, the binary value in the first array and the binary value in the second array are input to a first Boolean algorithm to produce a binary value for the same combination of column, row and ordinal position in the third array; and
publishing the third array of two-dimensional barcodes, wherein the second array of two-dimensional barcodes are necessary to regenerate the first array of two-dimensional barcodes so that the first data can be decoded.

### Claim 12 (depends on 11)

The method of claim 11, wherein each of the two-dimensional barcodes in the second array are identical.

### Claim 13 (depends on 11)

The method of claim 11, the operations further comprising:
performing a reverse mashup algorithm on the third array and the second array to regenerate the first array, wherein, for each combination of column, row and ordinal position, the binary value in the third array and the binary value in the second array are input to a second Boolean algorithm to produce a binary value for the same combination of column, row and ordinal position in the first array.

### Claim 14 (depends on 13)

The method of claim 13, wherein the second Boolean algorithm is predetermined to reverse the operation of the first Boolean algorithm.

### Claim 15 (depends on 14)

The method of claim 14, the operations further comprising:
decoding the regenerated first array of two-dimensional barcode to obtain the first data.

### Claim 16 (depends on 15)

The method of claim 15, wherein the first data includes a data file or an application program.

### Claim 17 (depends on 15)

The method of claim 15, wherein each two-dimensional barcode in the third array of two-dimensional barcodes is published as an image including a grid of dots representing binary values, wherein each dot has a location identified by a unique combination of the column and the row within the grid, and wherein each two-dimensional barcode is identified by the ordinal position in the third array.

### Claim 18 (depends on 11)

The method of claim 11, wherein the first Boolean algorithm is an exclusive OR operator.

### Claim 19 (depends on 11)

The method of claim 11, wherein the third array of two-dimensional barcodes has the same number of two-dimensional barcodes as the first array of two-dimensional barcodes.

### Claim 20 (depends on 11)

The method of claim 11, wherein the third array of two-dimensional barcodes is published by printing and/or displaying.
