Rice encoding is...

Go To Last Post
13 posts / 0 new
Author
Message
#1
  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

Rice is not a perfect encoding algorithm.  So what applications would you use it for?

This topic has a solution.
Last Edited: Tue. Dec 17, 2019 - 03:39 AM
  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

What does wikipedia say?

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

Kartman wrote:
What does wikipedia say?

 

to search

"

Golomb coding is a lossless data compression method using a family of data compression codes invented by Solomon W. Golomb in the 1960s. Alphabets following a geometric distribution will have a Golomb code as an optimal prefix code,[1] making Golomb coding highly suitable for situations in which the occurrence of small values in the input stream is significantly more likely than large values."

 

small values like 1,2,...100, 101???

 

small compared to what?

This reply has been marked as the solution. 
  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0
  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

You’re really asking your question in the wrong place - not too many of us are experts in data compression. I’d suggest stackoverflow.

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

When you use a highly efficient code, you remove some of the redundancy...thus with other things being equal, making it more susceptible to corruption.

 

for example if you want to transmit long lists containing these choices:

 

fatcat

fastfrog

biglion

 

If a few letters here & there get garbled, it is still easy to fix & correctly receive the info.

If you are smart, you might say , let's just send 1, 2, or 3 , decode (convert) at the end & thereby increase throughput.  Now it is much easier for garbling to result in a wrong decode (all else being equal).

Of course, error-correction means can be added, they simply increase redundancy in a more statistically optimized manner.

 

 

When in the dark remember-the future looks brighter than ever.   I look forward to being able to predict the future!

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

I researched Rice encoding, its pretty poor.  So I'm going to work on LZ77 and LZ78

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 1

Maybe look at ‘middle-out’ compression. It achieves a Weissman score of 2.89. This is significantly better than anything else for music and video.

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

Rice with spice is twice as nice as rice with ice.

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

Simonetta wrote:

Rice with spice is twice as nice as rice with ice.

 

Jesus....

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

Although not quite a compression algorithm per se, I've heard that 'tip-to-tip' is also quite efficient provided the proper height and angle sorting is done in advance.

Letting the smoke out since 1978

 

 

 

 

Last Edited: Fri. Dec 20, 2019 - 02:07 AM
  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

Done the lz77 algorithm, going to do one more, the lz78 and call it a day on compression algorithms.

Next up is a GUI manager, ordered the TM7000B LC display today for a Christmas present to myself....

 

Merry Christmas freaks.  heart

  • 1
  • 2
  • 3
  • 4
  • 5
Total votes: 0

"Dare to be naïve." - Buckminster Fuller