# US 2011/0234432 A1 · Systems and methods for optimizing bit utilization in data encoding

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

- Number: US 2011/0234432 A1
- Document ID: US20110234432A1
- Status: Published application
- Kind: A1
- Application number: 13/155,049
- Filed: 2011-06-07
- Published: 2011-09-29
- Earliest claimed: 2006-06-27
- Assignees: Verizon Services Corp.
- Inventors: Stephen C. Palmer; Richard Wyatt
- Web page: https://patentgrep.com/patent/US20110234432A1

## CPC

- H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M 7/02: Conversion to or from weighted codes, i.e. the weight given to a digit depending on the position of the digit within the block or code word
- 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

In one of many possible embodiments, a system for optimizing bit utilization in data encoding is provided. The exemplary system includes a data processing subsystem configured to identify a total number of unique characters within a set of data, which number represents an original base of representation of the set of data. The data processing subsystem is further configured to convert the set of data to a base of representation that is higher than the original base of representation and then encode the base-converted data with a fixed-length encoding scheme.

## Claims

### Claim 1

A system comprising:
a data source configured to provide a set of data; and
a data processing subsystem communicatively coupled to said data source and configured to
identify a total number of unique characters within said set of data, said set of data having an original base of representation equal to said total number of unique characters;
convert said set of data to a higher base of representation, said higher base of representation being greater in value than said original base of representation; and
encode said base-converted data with a fixed-length encoding scheme.

### Claim 2 (depends on 1)

The system of claim 1, wherein said data processing subsystem is further configured to store said unique characters within a digit list file.

### Claim 3 (depends on 2)

The system of claim 2, wherein one or more characters not included within said set of data are additionally stored within said digit list file.

### Claim 4 (depends on 2)

The system of claim 2, wherein said data processing subsystem is further configured to use said digit list file to convert said set of data to said higher base of representation.

### Claim 5 (depends on 1)

The system of claim 1, wherein said higher base of representation comprises a maximum power of said original base of representation that is less than or equal to 2n, wherein n is equal to a length of said fixed-length encoding scheme.

### Claim 6 (depends on 1)

The system of claim 1, further comprising a compression module configured to compress said encoded data.

### Claim 7 (depends on 1)

The system of claim 1, further comprising a decoder configured to decode said encoded data.

### Claim 8 (depends on 1)

The system of claim 1, wherein said data processing system is further configured to convert said base-converted data to said original base of representation.

### Claim 9 (depends on 1)

The system of claim 1, wherein said fixed-length encoding scheme comprises at least one of an American Standard Code for Information Interchange (ASCII) encoding scheme, an Extended Binary-Coded Decimal Interchange Code (EBCDIC) encoding scheme, and a Unicode encoding scheme.

### Claim 10 (depends on 1)

The system of claim 1, wherein said set of data comprises decimal data.

### Claim 11 (depends on 1)

The system of claim 1, wherein said set of data comprises a text file.

### Claim 12

A method comprising:
identifying a total number of unique characters within a set of data, said set of data having an original base of representation equal to said total number of unique characters;
converting said set of data to a higher base of representation, said higher base of representation being greater in value than said original base of representation; and
encoding said base-converted data with a fixed-length encoding scheme.

### Claim 13 (depends on 12)

The method of claim 12, further comprising storing within a digit list file said unique characters.

### Claim 14 (depends on 13)

The method of claim 13, further comprising storing within said digit list file one or more characters not included within said set of data.

### Claim 15 (depends on 13)

The method of claim 13, further comprising using said digit list file to convert said set of data to said higher base of representation.

### Claim 16 (depends on 12)

The method of claim 12, wherein said higher base of representation comprises a maximum power of said original base of representation that is less than or equal to 2n, wherein n is equal to a length of said fixed-length encoding scheme.

### Claim 17 (depends on 12)

The method of claim 12, further comprising compressing said encoded data.

### Claim 18 (depends on 12)

The method of claim 12, further comprising decoding said encoded data.

### Claim 19 (depends on 12)

The method of claim 12, further comprising converting said base-converted data to said original base of representation.

### Claim 20 (depends on 12)

The method of claim 12, wherein said fixed-length encoding scheme comprises at least one of an American Standard Code for Information Interchange (ASCII) encoding scheme, an Extended Binary-Coded Decimal Interchange Code (EBCDIC) encoding scheme, and a Unicode encoding scheme.

### Claim at position 21

21-25. (canceled)
