{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:49Z","timestamp":1725562609378},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220671"},{"type":"electronic","value":"9783540248385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_33","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T21:34:14Z","timestamp":1281303254000},"page":"446-457","source":"Crossref","is-referenced-by-count":5,"title":["A Huffman-Based Error Detecting Code"],"prefix":"10.1007","author":[{"given":"Paulo E. D.","family":"Pinto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Faller, N.: An adaptative Method for Data Compression. In: Record of the 7th Asilomar Conference on Circuits, Systems and Computers, Naval Postgraduate School, Monterrey, Ca., pp. 593\u2013597 (1973)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","volume":"24","author":"R.G. Gallager","year":"1978","unstructured":"Gallager, R.G.: Variations on a Theme by Huffman. IEEE Transactions on Information Theory\u00a024, 668\u2013674 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR3","volume-title":"Coding And Information Theory","author":"R.W. Hamming","year":"1980","unstructured":"Hamming, R.W.: Coding And Information Theory. Prentice-Hall, Englewood Cliffs (1980)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1951","unstructured":"Huffman, D.A.: A Method for the Construction of Minimum Redundancy Codes. Proceedings of the IRE\u00a040, 1098\u20131101 (1951)","journal-title":"Proceedings of the IRE"},{"key":"33_CR5","volume-title":"The Art of Computer Programming, V.1: Fundamental Algorithms","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, V.1: Fundamental Algorithms, 2nd edn. Addison-Wesley, Reading (1973)","edition":"2"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","volume":"6","author":"D.E. Knuth","year":"1985","unstructured":"Knuth, D.E.: Dynamic Huffman Coding. Journal of Algorithms\u00a06, 163\u2013180 (1985)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1145\/79147.79150","volume":"37","author":"L.L. Larmore","year":"1990","unstructured":"Larmore, L.L., Hirshberg, D.S.: A fast algorithm for optimal length-limited Huffman codes. JACM\u00a037(3), 464\u2013473 (1990)","journal-title":"JACM"},{"issue":"5","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1137\/S009753979731981X","volume":"30","author":"R.L. Milidi\u00fa","year":"2000","unstructured":"Milidi\u00fa, R.L., Laber, E.S.: The Warm-up Algorithm: A Lagrangean Construction of Length Restricted Huffman Codes. Siam Journal on Computing\u00a030(5), 1405\u20131426 (2000)","journal-title":"Siam Journal on Computing"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00453-001-0060-4","volume":"31","author":"R.L. Milidi\u00fa","year":"2001","unstructured":"Milidi\u00fa, R.L., Laber, E.S.: Improved Bounds on the Ineficiency of Length Restricted Codes. Algorithmica\u00a031(4), 513\u2013529 (2001)","journal-title":"Algorithmica"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/jagm.1999.1012","volume":"28","author":"R.L. Milidi\u00fa","year":"1999","unstructured":"Milidi\u00fa, R.L., Laber, E.S., Pessoa, A.A.: Improved Analysis of the FGK Algorithm. Journal of Algorithms\u00a028, 195\u2013211 (1999)","journal-title":"Journal of Algorithms"},{"key":"33_CR11","unstructured":"Pinto, P.E.D., Protti, F., Szwarcfiter, J.L.: Parity codes. Technical Report NCE 01\/04, Universidade Federal do Rio de Janeiro. Rio de Janeiro (2004) (submitted)"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0019-9958(64)90241-4","volume":"7","author":"E.S. Schwartz","year":"1964","unstructured":"Schwartz, E.S.: An Optimum Encoding with Minimal Longest Code and Total Number of Digits. Information and Control\u00a07, 37\u201344 (1964)","journal-title":"Information and Control"},{"issue":"5","key":"33_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1093\/comjnl\/38.5.339","volume":"38","author":"A. Turpin","year":"1995","unstructured":"Turpin, A., Moffat, A.: Practical length-limited coding for large alphabeths. Computer J.\u00a038(5), 339\u2013347 (1995)","journal-title":"Computer J."}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:13:30Z","timestamp":1620011610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}