On variable-length-to-block coding
Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from fixed-rate sources through fixed-rate noiseless channels, buffer overflow results. The latter phenomenon is an important consideration in th...
Saved in:
| Published in | IEEE transactions on information theory Vol. 18; no. 6; pp. 765 - 774 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
IEEE
01.11.1972
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0018-9448 1557-9654 |
| DOI | 10.1109/TIT.1972.1054899 |
Cover
| Abstract | Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from fixed-rate sources through fixed-rate noiseless channels, buffer overflow results. The latter phenomenon is an important consideration in the retrieval of compressed data from storage. The probability of buffer overflow decreases exponentially with buffer length and we determine the relation between rate and exponent size for memoryless sources. We obtain codes that maximize the overflow exponent for any given transmission rate exceeding the source entropy and present asymptotically optimal coding algorithms whose complexity grows linearly with codeword length. It turns out that the optimum error exponents of variable-length-to-block coding are identical with those of block-to-variable-length coding and are related in an interesting way to Renyi's generalized entropy function. |
|---|---|
| AbstractList | Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from fixed-rate sources through fixed-rate noiseless channels, buffer overflow results. The latter phenomenon is an important consideration in the retrieval of compressed data from storage. The probability of buffer overflow decreases exponentially with buffer length and we determine the relation between rate and exponent size for memoryless sources. We obtain codes that maximize the overflow exponent for any given transmission rate exceeding the source entropy and present asymptotically optimal coding algorithms whose complexity grows linearly with codeword length. It turns out that the optimum error exponents of variable-length-to-block coding are identical with those of block-to-variable-length coding and are related in an interesting way to Renyi's generalized entropy function. |
| Author | Jelinek, F. Schneider, K. |
| Author_xml | – sequence: 1 givenname: F. surname: Jelinek fullname: Jelinek, F. – sequence: 2 givenname: K. surname: Schneider fullname: Schneider, K. |
| BookMark | eNp9kDtPwzAUhS1UJNrCjsRSMbC52ImfI6p4VKrUpcyW41wXgxuXOEXi35MqHRAD09XRPd8ZvgkaNakBhK4pmVNK9P1muZlTLYs5JZwprc_QmHIusRacjdCYEKqwZkxdoEnO731knBZjdLtuZl-2DbaKgCM02-4NdwlXMbmPmUt1aLaX6NzbmOHqdKfo9elxs3jBq_XzcvGwwq7QRYc94yC05EzSgjEhXelpXcqS8LKSVgF4x7VwmuqaSAtQeeVULSkjTPnKi3KK7obdfZs-D5A7swvZQYy2gXTIplBMKdHPTZEYiq5NObfgjQud7UJqutaGaCgxRyWmV2KOSsxJSQ-SP-C-DTvbfv-H3AxIAIBf9eH7A2J2bJo |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TCOMM_2024_3379385 crossref_primary_10_1145_3230653 crossref_primary_10_1109_18_605570 crossref_primary_10_1109_TCOM_1982_1095501 crossref_primary_10_1007_BF01099202 crossref_primary_10_1109_18_567651 crossref_primary_10_1002_asi_4630280104 crossref_primary_10_1109_TIT_2017_2787181 crossref_primary_10_1109_18_79912 crossref_primary_10_1109_18_720531 crossref_primary_10_1109_18_79932 crossref_primary_10_3390_e20120896 crossref_primary_10_3390_e21101022 crossref_primary_10_1109_18_6022 crossref_primary_10_1109_TIT_1987_1057285 crossref_primary_10_1109_TIT_2010_2046248 crossref_primary_10_1109_18_771230 crossref_primary_10_3103_S8756699015030024 crossref_primary_10_1587_transfun_E93_A_1904 crossref_primary_10_1109_TIT_1974_1055302 crossref_primary_10_1137_0127048 crossref_primary_10_1109_TIT_1977_1055714 crossref_primary_10_1109_TIT_2007_913570 crossref_primary_10_1587_transfun_E101_A_249 crossref_primary_10_1109_18_259639 crossref_primary_10_1109_TCOM_1981_1094913 crossref_primary_10_1109_TIT_1982_1056465 crossref_primary_10_1109_18_108258 crossref_primary_10_1109_18_556605 crossref_primary_10_1109_TIT_1987_1057366 crossref_primary_10_1109_18_771231 crossref_primary_10_1109_TIT_1981_1056322 crossref_primary_10_3103_S8756699011060045 crossref_primary_10_1109_76_728418 crossref_primary_10_1109_TIT_2006_878151 crossref_primary_10_1109_18_945241 crossref_primary_10_1109_TIT_2010_2046251 crossref_primary_10_1109_TIT_1984_1056911 crossref_primary_10_3103_S8756699017010071 crossref_primary_10_1587_transfun_E99_A_2281 crossref_primary_10_1080_01969728508927780 crossref_primary_10_1109_TIT_1981_1056331 crossref_primary_10_1109_18_53746 crossref_primary_10_1109_TIT_1974_1055171 crossref_primary_10_1109_TIT_2008_929959 |
| Cites_doi | 10.1109/TIT.1966.1053907 10.1214/aoms/1177706108 10.1109/TIT.1968.1054193 10.1109/TIT.1968.1054147 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.1972.1054899 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 774 |
| ExternalDocumentID | 10_1109_TIT_1972_1054899 1054899 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c292t-f45e697547124467c3f1d373053b7a8eefc596c919d07aeebf8c8d714048fbf63 |
| IEDL.DBID | RIE |
| ISSN | 0018-9448 |
| IngestDate | Thu Oct 02 06:59:18 EDT 2025 Wed Oct 01 05:50:15 EDT 2025 Thu Apr 24 23:01:41 EDT 2025 Wed Aug 27 02:14:33 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c292t-f45e697547124467c3f1d373053b7a8eefc596c919d07aeebf8c8d714048fbf63 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 28488605 |
| PQPubID | 23500 |
| PageCount | 10 |
| ParticipantIDs | crossref_citationtrail_10_1109_TIT_1972_1054899 ieee_primary_1054899 crossref_primary_10_1109_TIT_1972_1054899 proquest_miscellaneous_28488605 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 19721101 |
| PublicationDateYYYYMMDD | 1972-11-01 |
| PublicationDate_xml | – month: 11 year: 1972 text: 19721101 day: 01 |
| PublicationDecade | 1970 |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 1972 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | jelinek (ref1) 1968 ref9 schneider (ref4) 1970 ref3 ref6 kesten (ref8) 0 kemperman (ref10) 1961 tunstall (ref7) 1968 ref2 feller (ref5) 1957; 1 |
| References_xml | – ident: ref3 doi: 10.1109/TIT.1966.1053907 – year: 1968 ident: ref7 publication-title: Synthesis of noiseless compression codes – year: 1961 ident: ref10 publication-title: The Passage Problem for a Stationary Markov Chain – ident: ref6 doi: 10.1214/aoms/1177706108 – volume: 1 year: 1957 ident: ref5 publication-title: An Introduction to Probability Theory and Its Applications – ident: ref9 doi: 10.1109/TIT.1968.1054193 – ident: ref2 doi: 10.1109/TIT.1968.1054147 – year: 1968 ident: ref1 publication-title: Probabilistic Information Theory – year: 1970 ident: ref4 publication-title: Reliable data compression of constant rate Markov sources for fixed rate channels – year: 0 ident: ref8 publication-title: Personal communication |
| SSID | ssj0014512 |
| Score | 1.2894876 |
| Snippet | Variable-length-to-block codes are a generalization of run-length codes. A coding theorem is first proved. When the codes are used to transmit information from... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 765 |
| SubjectTerms | Buffer overflows Channel coding Codes Complexity theory Data compression Decoding Entropy Random variables Symbols Terminology |
| Title | On variable-length-to-block coding |
| URI | https://ieeexplore.ieee.org/document/1054899 https://www.proquest.com/docview/28488605 |
| Volume | 18 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore digital library customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEB5qT3qw2irW5yJeBLPtvrLJUcRSheqlhd6W3SSLUNkV3Xrw1zuzj1IfiLdlyYSQZPLNZDLzAVzoQHucDxVD48BjviI2QK4d5mopcAsl3Nd0Dzl54OOZfz8P5i24WuXCGGPKx2fGps8ylq9ztaSrMtRwtK-l3ICNUPAqV2sVMfADp6oM7qACo8_RhCSHcjC9m9rErmXX8l8gqORU-XEQl-gy6sCkGVf1qGRhL4vEVh_fSjb-d-A7sF2bmdZ1tS92oWWyLnQaCger1ugubK3VI-zB-WNmvaPzTOlUjChWiidW5CxBwFtYKieY24PZ6HZ6M2Y1iQJTrnQLlvqB4TIMEIQQyXmovNTRHup14CVhLIxJVSC5ko7UwzA2JkmFEprK-PkiTVLu7UM7yzNzAJZAY0XFgpjUEfelSkLiOXJD7I8MKb8Pg2ZeI1VXGCeii-eo9DSGMsKViGglonpC-nC5knipqmv80bZHE7vWrv591ixdhJpB4Y44M_nyLULgFQK9tcPfBY9gk7qv8gqPoV28Ls0JGhhFclrurE_6FMi2 |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8QwEB5WPagHH6vi2yJeBFO32yRNjiLKrrp62QVvZZukCEor2vXgr3emj8UX4q2UJA2TTL-ZTGY-gCMrbChlxzA0DkLGDbEBShuwrtUKt1AiuaVzyMGt7I341b24b8HJNBfGOVdePnM-PZaxfJubCR2VoYajfa31DMwJzrmosrWmMQMugqo2eIAqjF5HE5Ts6NNhf-gTv5Zfj_AFhEpWlR-_4hJfLpdh0Mysulby6E-KxDfv34o2_nfqK7BUG5reWbUzVqHlsjYsNyQOXq3TbVj8VJFwDQ7vMu8N3WdKqGJEslI8sCJnCULeo2dyArp1GF1eDM97rKZRYKaruwVLuXBSRwJhCLFcRiZMAxuiZoswicbKudQILY0OtO1EY-eSVBllqZAfV2mSynADZrM8c5vgKTRXzFgRlzoivzZJRExH3QjHI1OKb8FpI9fY1DXGieriKS59jY6OcSViWom4FsgWHE97PFf1Nf5ou0aC_dSufn3QLF2MukEBj3Hm8slrjNCrFPpr2793PID53nBwE9_0b693YIE-VWUZ7sJs8TJxe2huFMl-ucs-AKv2zAM |
| 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%3Ajournal&rft.genre=article&rft.atitle=On+variable-length-to-block+coding&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Jelinek%2C+F.&rft.au=Schneider%2C+K.&rft.date=1972-11-01&rft.pub=IEEE&rft.issn=0018-9448&rft.volume=18&rft.issue=6&rft.spage=765&rft.epage=774&rft_id=info:doi/10.1109%2FTIT.1972.1054899&rft.externalDocID=1054899 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |