# US 2026/0252236 A1 · System and Method for Codebook-Based Data Encoding with Temporal Pattern Recognition

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

- Number: US 2026/0252236 A1
- Document ID: US20260252236A1
- Status: Published application
- Kind: A1
- Application number: 19/227,409
- Filed: 2025-06-03
- Published: 2026-08-27
- Earliest claimed: 2021-08-17
- Assignees: Atombeam Technologies Inc.
- Applicants: AtomBeam Technologies Inc.
- Inventors: Joshua Cooper; Charles Yeomans
- Web page: https://patentgrep.com/patent/US20260252236A1

## CPC

- G06F 3/0608: {Saving storage space on storage systems}
- G06F 3/0623: {in relation to content}
- G06F 3/0656: {Data buffering arrangements}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- H03M 7/405: {Tree adaptation}
- H03M 7/6005: {Decoder aspects}
- H03M 7/6011: {Encoder aspects}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

A system and method for codebook-based data encoding with temporal pattern recognition. Time-series data is analyzed to identify recurring patterns across multiple time scales, enabling the creation of temporally-optimized codebooks. Portions of data are encoded by different encoding libraries, dynamically selected based on the data's temporal characteristics, providing substantial improvements in compression efficiency over single-algorithm approaches. This methodology also enhances security as multiple decoding libraries must be used to decode the data. In some embodiments, each portion of data may be encoded using different sourceblock sizes aligned with natural temporal boundaries, further improving compression and security. Encoding libraries may be rotated according to identified temporal cycles or pseudo-randomly to maximize both efficiency and protection. The system continuously evaluates compression improvements and refines its approach based on measured performance across different temporal contexts.

## Claims

### Claim 1

A computer system comprising a hardware memory, wherein the computer system is configured to execute software instructions stored on nontransitory machine-readable storage media that:
analyze time-series data to identify recurring temporal patterns across multiple time scales;
select a list of codebooks for encoding a plurality of sourcepackets based on the identified temporal patterns, each sourcepacket comprising a sourcepacket identifier and one or more of the identified temporal patterns, the list comprising a codebook identifier for each codebook;
for each sourcepacket:
encode the sourcepacket with a codebook in the list of codebooks dynamically selected based on the sourcepacket's temporal characteristics;
associate the sourcepacket identifier with the encoded sourcepacket;
associate the codebook identifier of the codebook which produced the encoded sourcepacket with the sourcepacket identifier; and
send a data pair comprising the respective sourcepacket identifier and its associated codebook identifier to a combiner.

### Claim 2 (depends on 1)

The system of claim 1, wherein the codebooks used to encode the data are combined as a single codebook.

### Claim 3 (depends on 1)

The system of claim 1, wherein the data structure further comprises a copy of the stored encoded sourcepacket associated with each sourcepacket identifier.

### Claim 4 (depends on 1)

The system of claim 1, wherein the sourcepacket identifier is a universal unique identifier (UUID).

### Claim 5 (depends on 1)

The system of claim 1, wherein the codebook identifier is a universal unique identifier (UUID).

### Claim 6

A method for codebook-based data encoding, comprising the steps of:
analyze time-series data to identify recurring temporal patterns across multiple time scales;
select a list of codebooks for encoding a plurality of sourcepackets based on the identified temporal patterns, each sourcepacket comprising a sourcepacket identifier and one or more of the identified temporal patterns, the list comprising a codebook identifier for each codebook;
for each sourcepacket:
encode the sourcepacket with a codebook in the list of codebooks dynamically selected based on the sourcepacket's temporal characteristics;
associate the sourcepacket identifier with the encoded sourcepacket;
associate the codebook identifier of the codebook which produced the encoded sourcepacket with the sourcepacket identifier; and
send a data pair comprising the respective sourcepacket identifier and its associated codebook identifier to a combiner.

### Claim 7 (depends on 6)

The method of claim 6, further comprising the step of combining the codebooks used to encode the data into a single codebook.

### Claim 8 (depends on 6)

The method of claim 6, further comprising the step of including a copy of the stored encoded sourcepacket associated with each sourcepacket identifier in the data structure.

### Claim 9 (depends on 6)

The method of claim 6, wherein the sourcepacket identifier is a universal unique identifier (UUID).

### Claim 10 (depends on 6)

The method of claim 6, wherein the codebook identifier is a universal unique identifier (UUID).
