The redundancy gains of almost lossless universal source coding over envelope families - Archive ouverte HAL Access content directly
Conference Papers Year :

The redundancy gains of almost lossless universal source coding over envelope families

Jorge Silva
  • Function : Author
  • PersonId : 1029729
Universidad de Chile = University of Chile [Santiago]
Pablo Piantanida
Laboratoire des signaux et systèmes
CV

Domains

Computer Science [cs] Information Theory [cs.IT] Computer Science [cs] Networking and Internet Architecture [cs.NI] Mathematics [math] Information Theory [math.IT] Mathematics [math] Statistics [math.ST]

Pablo Piantanida  : Connect in order to contact the contributor

https://hal-centralesupelec.archives-ouvertes.fr/hal-01742332

Submitted on : Saturday, March 24, 2018-2:19:11 PM

Last modification on : Friday, March 24, 2023-2:53:06 PM

Not file

Dates and versions

hal-01742332 , version 1 (24-03-2018)

Identifiers

Cite

Jorge Silva, Pablo Piantanida. The redundancy gains of almost lossless universal source coding over envelope families. 2017 IEEE International Symposium on Information Theory (ISIT), Jun 2017, Aachen, France. ⟨10.1109/ISIT.2017.8006880⟩. ⟨hal-01742332⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS SUP_LSS INSMI SUP_TELECOMS CENTRALESUPELEC UNIV-PARIS-SACLAY GS-ENGINEERING GS-COMPUTER-SCIENCE
38 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More