About: Source coding theorem   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

The source coding theorem states that information can be compressed until Shannon entropy and if the compressed code rate is smaller than Shannon entropy, the information loss must be imposed. In mathematical relation, the optimum number of compressed data bits is where the is the number of symbols and assumed to be sufficiently large, is entropy and is information source.

AttributesValues
rdfs:label
  • Source coding theorem
rdfs:comment
  • The source coding theorem states that information can be compressed until Shannon entropy and if the compressed code rate is smaller than Shannon entropy, the information loss must be imposed. In mathematical relation, the optimum number of compressed data bits is where the is the number of symbols and assumed to be sufficiently large, is entropy and is information source.
dcterms:subject
abstract
  • The source coding theorem states that information can be compressed until Shannon entropy and if the compressed code rate is smaller than Shannon entropy, the information loss must be imposed. In mathematical relation, the optimum number of compressed data bits is where the is the number of symbols and assumed to be sufficiently large, is entropy and is information source.
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software