Results 1 to 5 of 5

Thread: BIN@ERN: binary-ternary compressing data coding

  1. #1
    Member
    Join Date
    Jan 2012
    Location
    Russia
    Posts
    2
    Thanks
    0
    Thanked 0 Times in 0 Posts

    BIN@ERN: binary-ternary compressing data coding

    If someone is interested in the subject and knows the russian language - you can see here a new publication: http://arxiv.org/ftp/arxiv/papers/1201/1201.5603.pdf
    It's annotation (http://arxiv.org/abs/1201.5603):
    This paper describes a new method of data encoding which may be used in various modern digital, computer and telecommunication systems and devices. The method permits the compression of data for storage or transmission, allowing the exact original data to be reconstructed without any loss of content. The method is characterized by the simplicity of implementation, as well as high speed and compression ratio. The method is based on a unique scheme of binary-ternary prefix-free encoding of characters of the original data. This scheme does not require the transmission of the code tables from encoder to decoder; allows for the linear presentation of the code lists; permits the usage of computable indexes of the prefix codes in a linear list for decoding; makes it possible to estimate the compression ratio prior to encoding; makes the usage of multiplication and division operations, as well as operations with the floating point unnecessary; proves to be effective for static as well as adaptive coding; applicable to character sets of any size; allows for repeated compression to improve the ratio.

  2. #2
    Member BetaTester's Avatar
    Join Date
    Dec 2010
    Location
    Brazil
    Posts
    43
    Thanks
    0
    Thanked 3 Times in 3 Posts

  3. #3
    Member Karhunen's Avatar
    Join Date
    Dec 2011
    Location
    USA
    Posts
    91
    Thanks
    2
    Thanked 1 Time in 1 Post
    I assume fountain codes are a successor to Gray codes, and implemented with ASICs today but mechanical switches in times past http://www.google.com/patents/US3174106

  4. #4
    Expert
    Matt Mahoney's Avatar
    Join Date
    May 2008
    Location
    Melbourne, Florida, USA
    Posts
    3,257
    Thanks
    307
    Thanked 797 Times in 489 Posts
    allows for repeated compression to improve the ratio.
    I should hope so because the compression ratios are pretty bad otherwise. (If that's what the tables are. I don't know Russian).

  5. #5
    Member
    Join Date
    Jan 2012
    Location
    Russia
    Posts
    2
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Quote Originally Posted by BetaTester View Post
    raptor codes are for the errorless coding
    bin@ern codes are for the entropy coding
    here are two different fields of application

Similar Threads

  1. lzma's binary tree matchfinder
    By Shelwien in forum Data Compression
    Replies: 7
    Last Post: 13th October 2011, 08:38
  2. Need advice on compressing specific sample of data
    By Piotr Tarsa in forum Data Compression
    Replies: 11
    Last Post: 21st April 2011, 23:01
  3. Compressing small bits of data
    By fredrp in forum Data Compression
    Replies: 9
    Last Post: 28th April 2009, 22:27
  4. RC Coding
    By rasputin in forum Data Compression
    Replies: 10
    Last Post: 6th November 2008, 18:54
  5. Bytewise vs Binary
    By Shelwien in forum Forum Archive
    Replies: 9
    Last Post: 30th March 2008, 16:51

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •