Mã hóa Entropy

Uses your system voice; voice and rate in settings.

The name shown is in vi. The article below is in English and is not a translation.

Q1345239Snapshot

≈ 3 min read

Names in other languages

  • Italianocodificazione entropica
  • Русскийэнтропийное кодированиекодирование энтропии, кодирование с минимальной избыточностью, энтропийное сжатие
  • Españolcodificación entrópicacodificacion entropica, codificacion entrópica
  • cacodificació entròpica
  • slentropično kodiranje
  • Українськаентропійне кодування
  • Češtinaentropické kódování
  • DeutschEntropiekodierungEntropie-Kodierung, Entropiecodierung
  • eoentropia enkodigo
  • Françaiscodage entropiquecode entropique
  • العربيةترميز بالاعتلاجترميز انتروبي
  • فارسیکدگذاری آنتروپی
  • fientropiakoodaus
  • Englishentropy codingentropy encoding
  • Tiếng ViệtMã hóa Entropy
  • 日本語エントロピー符号エントロピー符号化
  • 한국어엔트로피 부호화
  • 中文熵編碼法熵编码

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In information theory, an entropy coding (or entropy encoding) is any lossless data compression method that attempts to approach the lower bound declared by Shannon's source coding theorem, which states that any lossless data compression method must have an expected code length greater than or equal to the entropy of the source. More precisely, the source coding theorem states that for any source distribution, the expected code length satisfies \operatorname E_{x\sim P}[\ell(d(x))] \geq \operatorname E_{x\sim P}[-\log_b(P(x))] , where \ell is the function specifying the number of symbols in a code word, d is the coding function, b is the number of symbols used to make output codes and P is the probability of the source symbol. An entropy coding attempts to approach this lower bound. Two of the most common entropy coding techniques are Huffman coding and arithmetic coding. If the approximate entropy characteristics of a data stream are known in advance (especially for signal compression), a simpler static code may be useful. These static codes include universal codes (such as Elias gamma coding or Fibonacci coding) and Golomb codes (such as unary coding or Rice coding).…

In information theory, an entropy coding (or entropy encoding) is any lossless data compression method that attempts to approach the lower bound declared by Shannon's source coding theorem, which states that any lossless data compression method must have an expected code length greater than or equal to the entropy of the source. More precisely, the source coding theorem states that for any source distribution, the expected code length satisfies \operatorname E_{x\sim P}[\ell(d(x))] \geq \operatorname E_{x\sim P}[-\log_b(P(x))] , where \ell is the function specifying the number of symbols in a code word, d is the coding function, b is the number of symbols used to make output codes and P is the probability of the source symbol. An entropy coding attempts to approach this lower bound. Two of the most common entropy coding techniques are Huffman coding and arithmetic coding. If the approximate entropy characteristics of a data stream are known in advance (especially for signal compression), a simpler static code may be useful. These static codes include universal codes (such as Elias gamma coding or Fibonacci coding) and Golomb codes (such as unary coding or Rice coding). Since 2014, data compressors have started using the asymmetric numeral systems (ANS) family of entropy coding techniques, which allows combination of the compression ratio of arithmetic coding with a processing cost similar to Huffman coding. ANS has been adopted by compressors developed by Facebook (Zstandard), Apple (LZFSE), and Google (Draco), among others.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1364626876 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot entropy-coding-156461-8cb5b4edda5f5e43 · hash 8cb5b4edda5f5e43a811143507d5fbdcf7f48bf938e91e6adfc383dbd1580d87 · captured 1784299092.0 · version history

Cite this page as: encyclopegia.org, “Mã hóa Entropy”, snapshot entropy-coding-156461-8cb5b4edda5f5e43. https://encyclopegia.org/a/entropy-coding

Sources cited in this revision

Extracted from the cited revision's reference blocks; absent citations are not invented.