Optimal universal coding with respect to the maximal individual relative redundancy criterion

In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-var...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of IEEE International Symposium on Information Theory p. 420
Main Authors: Shtarkov, Yu.M., Tjalkens, Tj.J., Willems, F.M.J.
Format: Conference Proceeding
Language:English
Published: IEEE 1997
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.
AbstractList In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a relative redundancy criterion is a better measure for the code's performance than the absolute redundancy. We design universal fixed-to-variable length codes and variable-to-fixed length codes under the same conditions and compare their relative redundancy behavior.
Author Tjalkens, Tj.J.
Shtarkov, Yu.M.
Willems, F.M.J.
Author_xml – sequence: 1
  givenname: Yu.M.
  surname: Shtarkov
  fullname: Shtarkov, Yu.M.
  organization: Inst. for Problems of Inf. Transmission, Moscow, Russia
– sequence: 2
  givenname: Tj.J.
  surname: Tjalkens
  fullname: Tjalkens, Tj.J.
– sequence: 3
  givenname: F.M.J.
  surname: Willems
  fullname: Willems, F.M.J.
BookMark eNotkM1LAzEQxQMqqHXv4in_wNZkN59HKX4UCj3Yq5RsZtZG2mzJptX-9wbrMDC_w5vH492SyzhEJOSesynnzD7O3-erKbdWTxVvW6kvSGW1YWXb1kplr0k1jl-sjJDCCnNDPpb7HHZuSw8xHDGNhfwAIX7S75A3NOG4R59pHmjeIN25nz9xiBCOAQ4FE25dLq8F4BDBRX-iPoWMKQzxjlz1bjti9X8nZPXyvJq91Yvl63z2tKiD0bk2YAGwk1I3GjtsDFMaRA9S9KppVMOkM65hDrzymvnO9A4Ut44brkUnoJ2Qh7NtQMT1PpWM6bQ-V9D-AgAeVcw
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISIT.1997.613357
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library Online
  url: http://ieeexplore.ieee.org/Xplore/DynWel.jsp
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 613357
GroupedDBID 6IE
6IK
6IL
AAJGR
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i87t-8d9ddeb55727ebe28067d4fd54f6226205a8a20adc6c70cb8fad619a18174b4d3
IEDL.DBID RIE
ISBN 9780780339569
0780339568
IngestDate Wed Jun 26 19:22:52 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i87t-8d9ddeb55727ebe28067d4fd54f6226205a8a20adc6c70cb8fad619a18174b4d3
ParticipantIDs ieee_primary_613357
PublicationCentury 1900
PublicationDate 19970000
PublicationDateYYYYMMDD 1997-01-01
PublicationDate_xml – year: 1997
  text: 19970000
PublicationDecade 1990
PublicationTitle Proceedings of IEEE International Symposium on Information Theory
PublicationTitleAbbrev ISIT
PublicationYear 1997
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000454948
Score 1.2672913
Snippet In this paper we consider the compaction of data generated by a binary memoryless source with fixed but unknown probabilities. We argue that in this case a...
SourceID ieee
SourceType Publisher
StartPage 420
SubjectTerms Decoding
Entropy
Hafnium
Title Optimal universal coding with respect to the maximal individual relative redundancy criterion
URI https://ieeexplore.ieee.org/document/613357
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA62J0--Kr7JwWvadDfZJGdtaS8qtAcvUrJJFgp2V7Qr_nxnkrYiePE2-2BZMjDfPPJ9IeRWccshzTBMZYVlQomS2RAckzIzlcDRlMOe7mSmHp71_UhsdbYjFyaEEDefhT6acZbvG9diq2wA0JNL1SEdZXSiau3aKagkZ4SOhbnmeY4suI2-zvbabKeU3Ayms-kciXqqn77562yVCC3jg3_91CHp_VD06NMOfI7IXqhPyMsjBICVfaVt2m4BlmvwOcV2K4XKGnmVdN1QSPvoyn7Fl5c7ThZNzJbPAAayyzDyUggrqOfc1D0yH4_mdxO2OT-BLbVaM-0NxK5SSkhRwFU4QlVeVF6KqshQh15abTNuvSuc4q7UlfVQTlnAfHCZ8Pkp6dZNHc4IHYah5aYK0ktAfMdLkZfOFaYE_DPOynNyjAuzeEsKGYu0Jhd_3r0k-0kCFtsYV6S7fm_DNel8-PYmuvQbrXmgHw
link.rule.ids 310,311,782,786,791,792,798,4054,4055,27934,54767
linkProvider IEEE
linkToHtml http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoGWDiVcQbD6xp3cSO4xlataIUpGZgQZVjO1IlmiBIED-fu7gtQmJhuzwURT7pvnv4-0zIjWSaQZqhAhnGOuCSZ4F2zgRChCrnOJoy2NMdzeT0Obkb8LXOdsOFcc41m89cF81mlm9LU2OrrAfQEwnZItuCy1h6stamoYJacoonTWmesChCHtxKYWd9rdZzSqZ649k4Raqe7Pqv_jpdpQGX4d6_fmufdH5IevRpAz8HZMsVR-TlEULAUr_S2m-4AMuU-Jxiw5VCbY3MSlqVFBI_utRfzcuLDSuLem7LpwMD-WUYeykEFlR0LosOSYeD9HYUrE5QCBaJrILEKohemRCQpICzcIgqLc-t4HkcohK90IkOmbYmNpKZLMm1hYJKA-qD07iNjkm7KAt3Qmjf9TVTuRNWAOYblvEoMyZWGSCgMlqckkNcmPmb18iY-zU5-_PuNdkZpQ-T-WQ8vT8nu14QFpsaF6RdvdfukrQ-bH3VuPcbStGjcA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+IEEE+International+Symposium+on+Information+Theory&rft.atitle=Optimal+universal+coding+with+respect+to+the+maximal+individual+relative+redundancy+criterion&rft.au=Shtarkov%2C+Yu.M.&rft.au=Tjalkens%2C+Tj.J.&rft.au=Willems%2C+F.M.J.&rft.date=1997-01-01&rft.pub=IEEE&rft.isbn=9780780339569&rft.spage=420&rft_id=info:doi/10.1109%2FISIT.1997.613357&rft.externalDocID=613357
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780339569/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780339569/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780339569/sc.gif&client=summon&freeimage=true