No assignee for patent application serial number 405936 has been made.
News editors obtained the following quote from the background information supplied by the inventors: "In modern world, the volume of data that needs to be transmitted and stored is growing exponentially and often faster than the infrastructure used to process it, creating constant demand for data compression methods and technologies. Huffman coding, Shannon-Fano and Arithmetic coding are some of the few well known entropy encoding techniques, many variations of which are extensively used in lossless data compression solutions. The first two methods use prefix codes and characterized by higher speed, but in most cases somewhat inferior to the third method in the degree of compression. Huffman and Shannon-Fano coding are better suited for the two-pass (static) coding, while Arithmetic coding lends itself better to single-pass (adaptive) coding. All three methods are widely used because it is always a trade-off between the rate of compression and speed of the process, as well as the amount of memory, data storage and other resources involved in each encoding solution. That leaves a niche for a fast and effective method of entropy encoding, which can be implemented equally well with single-pass as well as with multi-pass encoding scheme."
As a supplement to the background information on this patent application, VerticalNews correspondents also obtained the inventors' summary information for this patent application: "The present invention is a solution to an automated process of lossless data coding, which allows reducing information redundancy by encoding the data stream using unique sets of prefix codes to replace serial elements (bit-series or characters) of the original data. Therefore, the invention establishes: a method of identification of compressive prefix code sets, a method of generation of prefix codes in the set, a method of encoding and a method of decoding data using the above mentioned code sets.
BRIEF DESCRIPTION OF DRAWINGS
"This invention will be more apparent from the following description in conjunction with the appended drawings, in which
"FIG. 1 illustrates a method of identification of the code sets of the present invention;
"FIG. 2 illustrates a method of generation of prefix codes in the code set;
"FIG. 3 illustrates a method of encoding source characters using prefix codes sets of the present invention;
"FIG. 4 illustrates a method of decoding characters using prefix code sets of the present invention."
For additional information on this patent application, see: Nesiolovskiy, Igor Valeryevich; Nesiolovskiy, Artem Igorevich. Entropy Method of Binary-Ternary Lossless Data Coding. U.S. Patent Application Serial Number 405936, filed
Keywords for this news article include: Patents, Information Technology, Information and Data Compression.
Our reports deliver fact-based news of research and discoveries from around the world. Copyright 2013, NewsRx LLC
Most Popular Stories
- NSA Defends Global Cellphone Tracking Legality
- Top Websites for U.S. Hispanics
- Networks Vie for U.S. Hispanic TV Viewers
- Ad Counts Rise in 2013 for Hispanic Magazines
- Saab Gets Back into the Game; U.S. Auto Sales Soar
- Apple Wants Samsung to Pay $22M for Patent Dispute Legal Bills
- Apple Activates Customer-Tracking iBeacon
- Starbucks Gets Grinchy; No Gingerbread Lattes for Tampa Customers
- A Biography of Jonathan Ive, Apple's Creative Chief
- Jobs Report Brings Cheer As Unemployment Drops to Five-year Low