Combinatorial Coding for Short-Block Binary Data Compression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression methods, such as arithmetic coding and Golomb coding, are inefficient for compressing data sequences with a small number of symbols and short block sizes, particularly in binary data transmission, where they often result in longer output lengths or fail to achieve optimal compression.
Innovation Solution
The proposed combinatorial coding technique selects a block size, identifies symbol strings within the data, generates codes for the number and pattern of occurrences of these strings, and combines them to form a compressed data code, utilizing combinatorial mathematics to reduce the number of bits required for representation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If arithmetic coding or Golomb coding is used for binary data with small symbol sets and short block sizes, then compression is attempted, but the output length often increases or optimal compression is not achieved
Solution Approach 1:
The patent changes the fundamental parameter of how binary data is encoded by treating sequences of n bits as combinatorial objects. Instead of using traditional arithmetic or Golomb coding approaches, it maps binary sequences to combinatorial numbers based on the position and count of 1s, achieving better compression for small symbol sets and short block sizes where the combinatorial approach is mathematically more efficient
2Length of stationary object
If traditional compression methods are applied to binary data with two states, then general compression is achieved, but the codes produced are longer than necessary
Solution Approach 1:
The patent transitions from viewing binary data as simple sequences of 0s and 1s to viewing them as combinatorial objects in a higher-dimensional space. By considering the combinatorial position of 1s within n-bit blocks and mapping these to combinatorial numbers, it achieves a more compact representation that reduces the number of bits required compared to traditional one-dimensional encoding approaches
Data Source
AI summary
Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.