Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up

Golomb coding is a lossless data compression method using a family of data compression codes. Alphabets following a geometric distribution will have a Golomb code as an optimal prefix code, 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.

NotificationsYou must be signed in to change notification settings

koushik2001/Golomb-coding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

Golomb-coding

The Golomb coding is a form of parameterized coding in which integers to be coded are stored as values relative to a constant b.A positive integer x is represented in two parts:

  1. The first part is a unary representation of q+1, where q is the quotient floor(x/b)
  2. The second part is a special binary representation of the remainder r = x-qb. Note that there are b possible remainders. For example, if b = 3, the possible remainders will be 0, 1 & 2.

About

Golomb coding is a lossless data compression method using a family of data compression codes. Alphabets following a geometric distribution will have a Golomb code as an optimal prefix code, 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.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

[8]ページ先頭
©2009-2025 Movatter.jp