{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:14:06Z","timestamp":1740028446598,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_33","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"372-384","source":"Crossref","is-referenced-by-count":1,"title":["The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case"],"prefix":"10.1007","author":[{"given":"Mordecai J.","family":"Golin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/00150517.1995.12429169","volume":"33","author":"J. Abrahams","year":"1995","unstructured":"Abrahams, J.: Varn codes and generalized Fibonacci trees. The Fibonacci Quarterly\u00a033(1), 21\u201325 (1995)","journal-title":"The Fibonacci Quarterly"},{"issue":"2","key":"33_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.4310\/CIS.2001.v1.n2.a1","volume":"1","author":"J. Abrahams","year":"2001","unstructured":"Abrahams, J.: Code and Parse Trees for Lossless Source Encoding. Communications in Information and Systems\u00a01(2), 113\u2013146 (2001)","journal-title":"Communications in Information and Systems"},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/322203.322205","volume":"27","author":"D. Altenkamp","year":"1980","unstructured":"Altenkamp, D., Mehlhorn, K.: Codes: Unequal Probabilities, Unequal Letter Costs. Journal of the ACM\u00a027(3), 412\u2013427 (1980)","journal-title":"Journal of the ACM"},{"issue":"6","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/18.59940","volume":"36","author":"T. Berger","year":"1990","unstructured":"Berger, T., Yeung, R.W.: Optimum \u201c1\u201d-ended Binary Prefix codes. IEEE Transactions on Information Theory\u00a036(6), 1435\u20131441 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1109\/18.335933","volume":"40","author":"R.M. Capocelli","year":"1994","unstructured":"Capocelli, R.M., De Santis, A., Persiano, G.: Binary Prefix Codes Ending in a \u201c1\u201d. IEEE Transactions on Information Theory\u00a040(1), 1296\u20131302 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"33_CR6","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1109\/18.850708","volume":"46","author":"C. Sze-Lok","year":"2000","unstructured":"Sze-Lok, C., Golin, M.: A Dynamic Programming Algorithm for Constructing Optimal \u201c1\u201d-ended Binary Prefix-Free Codes. IEEE Transactions on Information Theory\u00a046(4), 1637\u20131644 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s00453-001-0063-1","volume":"31","author":"V.S.-N. Choi","year":"2001","unstructured":"Choi, V.S.-N., Golin, M.J.: Lopsided Trees I: Analyses. Algorithmica\u00a031, 240\u2013290 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1137\/0212028","volume":"12","author":"D.M. Choy","year":"1983","unstructured":"Choy, D.M., Wong, C.K.: Construction of Optimal Alpha-Beta Leaf Trees with Applications to Prefix Codes and Information Retrieval. SIAM Journal on Computing\u00a012(3), 426\u2013446 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR9","unstructured":"Cot, N.: Complexity of the Variable-length Encoding Problem. In: Proceedings of the 6th Southeast Conference on Combinatorics, Graph Theory and Computing, pp. 211\u2013224 (1975)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0019-9958(69)90084-9","volume":"14","author":"I. Csisz\u00e1r","year":"1969","unstructured":"Csisz\u00e1r, I.: Simple Proofs of Some Theorems on Noiseless Channels. Inform. Contr.\u00a014, 285\u2013298 (1969)","journal-title":"Inform. Contr."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00534840","volume":"12","author":"I. Csisz\u00e1r","year":"1969","unstructured":"Csisz\u00e1r, I., Katona, G., Tsun\u00e1dy, G.: Information Sources with Different Cost Scales and the Principle of Conservation of Energy. Z. Wahrscheinlichkeitstheorie verw\u00a012, 185\u2013222 (1969)","journal-title":"Z. Wahrscheinlichkeitstheorie verw"},{"issue":"5","key":"33_CR12","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/18.705558","volume":"44","author":"M. Golin","year":"1998","unstructured":"Golin, M., Rote, G.: A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs. IEEE Transactions on Information Theory\u00a044(5), 1770\u20131781 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Golin, M., Na, H.: Optimal prefix-free codes that end in a specified pattern and similar problems: the uniform probability case. In: Data Compression Conference, DCC 2001, March 2001, pp. 143\u2013152 (2001)","DOI":"10.1109\/DCC.2001.917145"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0166-218X(99)00107-9","volume":"93","author":"M. Golin","year":"1999","unstructured":"Golin, M., Schuster, A.: Optimal Point-to-Point Broadcast Algorithms via Lopsided Trees. Discrete Applied Mathematics\u00a093, 233\u2013263 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"33_CR15","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1137\/S0097539794268388","volume":"25","author":"M. Golin","year":"1996","unstructured":"Golin, M., Young, N.: Prefix Codes: Equiprobable Words, Unequal Letter Costs. SIAM Journal on Computing\u00a025(6), 1281\u20131292 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"33_CR16","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/65950.65955","volume":"36","author":"S. Kapoor","year":"1989","unstructured":"Kapoor, S., Reingold, E.: Optimum Lopsided Binary Trees. Journal of the Association for Computing Machinery\u00a036(3), 573\u2013590 (1989)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/TIT.1961.1057615","volume":"7","author":"R.M. Karp","year":"1961","unstructured":"Karp, R.M.: Minimum-redundancy coding for the discrete noiseless channel. IRE Transactions on Information Theory\u00a07, 27\u201339 (1961)","journal-title":"IRE Transactions on Information Theory"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0019-9958(62)90183-3","volume":"5","author":"R.M. Krause","year":"1962","unstructured":"Krause, R.M.: Channels Which Transmit Letters of Unequal Duration. Inform. Contr.\u00a05, 13\u201324 (1962)","journal-title":"Inform. Contr."},{"key":"33_CR19","volume-title":"Elements of the Theory of Computation","author":"H.R. Lewis","year":"1998","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice Hall, Englewood Cliffs (1998)","edition":"2"},{"issue":"2","key":"33_CR20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/321879.321883","volume":"22","author":"Y. Perl","year":"1975","unstructured":"Perl, Y., Garey, M.R., Even, S.: Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. Journal of the Association for Computing Machinery\u00a022(2), 202\u2013214 (1975)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/18.272477","volume":"40","author":"S.A. Savari","year":"1994","unstructured":"Savari, S.A.: Some Notes on Varn Coding. IEEE Transactions on Information Theory\u00a040(1), 181\u2013186 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"33_CR22","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1109\/18.850666","volume":"46","author":"S.A. Savari","year":"2000","unstructured":"Savari, S.A.: A Probabilistic Approach to Some Asymptotics in Noiseless Communications. IEEE Transactions on Information Theory\u00a046(4), 1246\u20131262 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Yeung, R.: A First Course in Information Theory. Kluwer Academic\/Plenum Publishers (2002)","DOI":"10.1007\/978-1-4419-8608-5"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A Mathematical Theory of Communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"issue":"3","key":"33_CR25","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1145\/321592.321601","volume":"17","author":"L.E. Stanfel","year":"1970","unstructured":"Stanfel, L.E.: Tree Structures for Optimal Searching. Journal of the Association for Computing Machinery\u00a017(3), 508\u2013517 (1970)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"33_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0019-9958(71)90155-0","volume":"19","author":"B.F. Varn","year":"1971","unstructured":"Varn, B.F.: Optimal Variable Length Codes (Arbitrary Symbol Costs and Equal Code Word Probabilities). Informat. Contr.\u00a019, 289\u2013301 (1971)","journal-title":"Informat. Contr."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:02:45Z","timestamp":1739966565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11534273_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}