{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:26Z","timestamp":1725663746260},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545224"},{"type":"electronic","value":"9783540384366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54522-0_114","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:58:02Z","timestamp":1330210682000},"page":"246-258","source":"Crossref","is-referenced-by-count":2,"title":["Arithmetic codes - Survey, recent and new results"],"prefix":"10.1007","author":[{"given":"Antoine C.","family":"Lobstein","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/TIT.1986.1057175","volume":"IT-32","author":"J. Astola","year":"1986","unstructured":"J. Astola, \"A note on perfect arithmetic codes,\" IEEE Trans. on Inform. Theory, vol. IT-32, pp. 443\u2013445, May 1986.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/TIT.1970.1054492","volume":"IT-16","author":"A.C.L. Chiang","year":"1970","unstructured":"A.C.L. Chiang and I.S. Reed, \"Arithmetic norms and bounds of the arithmetic AN codes,\" IEEE Trans. on Inform. Theory, vol. IT-16, pp. 470\u2013476, July 1970.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1109\/TIT.1973.1055100","volume":"IT-19","author":"W.E. Clark","year":"1973","unstructured":"W.E. Clark and J.J. Liang, \"On arithmetic weight for a general radix representation of integers,\" IEEE Trans. on Inform. Theory, vol. IT-19, pp. 823\u2013826, November 1973.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/TIT.1974.1055301","volume":"IT-20","author":"W.E. Clark","year":"1974","unstructured":"W.E. Clark and J.J. Liang, \"On modular weight and cyclic nonadjacent forms for arithmetic codes,\" IEEE Trans. on Inform. Theory, vol. IT-20, pp. 767\u2013770, November 1974.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR5","first-page":"49","volume":"67","author":"G. Cohen","year":"1979","unstructured":"G. Cohen and M. Deza, \"Distances invariantes et L-cliques sur certains demi-groupes finis,\" Math. Sci. Hum., vol. 67, pp. 49\u201369, 1979.","journal-title":"Math. Sci. Hum."},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1982.1056538","volume":"IT-28","author":"S. Ernvall","year":"1982","unstructured":"S. Ernvall, \"When does the modular distance induce a metric in the binary case ?,\" IEEE Trans. on Inform. Theory, vol. IT-28, pp. 665\u2013668, July 1982.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR7","unstructured":"S. Ernvall, \"When does the modular distance induce a metric ?,\" Annales Univ. Turku, Ser. A, Math., No185, 64 p., 1983."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/TIT.1985.1057057","volume":"IT-31","author":"S. Ernvall","year":"1985","unstructured":"S. Ernvall, \"On the modular distance,\" IEEE Trans. on Inform. Theory, vol. IT-31, pp. 521\u2013522, July 1985.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR9","first-page":"207","volume":"20-B","author":"S. Ernvall","year":"1985","unstructured":"S. Ernvall, \"The Hamming bound for binary arithmetic AN codes,\" Ars Combinatoria, vol. 20-B, pp. 207\u2013227, December 1985.","journal-title":"Ars Combinatoria"},{"key":"24_CR10","first-page":"31","volume":"25-B","author":"S. Ernvall","year":"1988","unstructured":"S. Ernvall, \"On the Hamming bound for nonbinary arithmetic AN codes,\" Ars Combinatoria, vol. 25-B, pp. 31\u201353, June 1988.","journal-title":"Ars Combinatoria"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1090\/S0025-5718-1987-0906195-7","volume":"49","author":"D.M. Gordon","year":"1987","unstructured":"D.M. Gordon, \"Perfect multiple error-correcting arithmetic codes,\" Mathematics of Computation, vol. 49, pp. 621\u2013633, October 1987.","journal-title":"Mathematics of Computation"},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(85)80006-8","volume":"11","author":"T. Helleseth","year":"1985","unstructured":"T. Helleseth, \"On the covering radius of cyclic linear codes and arithmetic codes\", Discr. Appl. Math., vol. 11, pp. 157\u2013173, 1985.","journal-title":"Discr. Appl. Math."},{"key":"24_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07998-0","volume-title":"Introduction to coding theory. Chapter 10","author":"J.H. Lint van","year":"1982","unstructured":"J.H. van Lint, Introduction to coding theory. Chapter 10, New York-Heidelberg-Berlin: Springer-Verlag, 1982."},{"key":"24_CR14","series-title":"EUT Report","volume-title":"When are modular weights identical ?","author":"A. Lobstein","year":"1986","unstructured":"A. Lobstein, \"When are modular weights identical ?,\" EUT Report 86-WSK-05, University of Technology of Eindhoven, Netherlands, 54 p., August 1986."},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-19368-5_6","volume-title":"On modular weights in arithmetic codes","author":"A. Lobstein","year":"1988","unstructured":"A. Lobstein, \"On modular weights in arithmetic codes,\" Proceedings of \u2018Coding Theory and Applications', 2nd International Colloquium, Cachan-Paris, November 1986, Lecture Notes in Computer Science, No311, pp. 56\u201367, New York: Springer Verlag, 1988."},{"key":"24_CR16","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/18.6043","volume":"IT-34","author":"A. Lobstein","year":"1988","unstructured":"A. Lobstein, \"Comments on \u2018A note on perfect arithmetic codes',\" IEEE Trans. on Inform. Theory, vol. IT-34, pp. 589\u2013590, May 1988.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR17","unstructured":"A. Lobstein, \"On the nonexistence of a perfect binary arithmetic code with modulus 1791,\" ENST Report 88D013, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Paris, France, 12 p., September 1988."},{"key":"24_CR18","unstructured":"A. Lobstein, \"On the nonexistence of a perfect binary arithmetic code with modulus 4097,\" ENST Report 88D014, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Paris, France, 23 p., September 1988."},{"key":"24_CR19","first-page":"24","volume":"29","author":"A. Lobstein","year":"1990","unstructured":"A. Lobstein, \"On perfect binary arithmetic codes which can correct two errors or more,\" Ars Combinatoria, vol. 29, pp. 24\u201327, June 1990.","journal-title":"Ars Combinatoria"},{"key":"24_CR20","volume-title":"The theory of error-correcting codes","author":"F.J. MacWilliams","year":"1983","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The theory of error-correcting codes. Amsterdam-New York-Oxford: North-Holland, 1983."},{"key":"24_CR21","volume-title":"Advances in Information Systems Science. vol. 4, Chapter 5","author":"J.L. Massey","year":"1972","unstructured":"J.L. Massey and O.N. Garcia, \"Error-correcting codes in computer arithmetics,\" in Advances in Information Systems Science. vol. 4, Chapter 5, New York-London: Plenum Press, 1972."},{"key":"24_CR22","volume-title":"Error-correcting codes. Chapter 13","author":"W.W. Peterson","year":"1961","unstructured":"W.W. Peterson, Error-correcting codes. Chapter 13, New York-London: MIT Press, 1961."},{"key":"24_CR23","volume-title":"Error-correcting codes","author":"W.W. Peterson","year":"1972","unstructured":"W.W. Peterson and E.J. Weldon, Jr., Error-correcting codes. Cambridge: MIT Press, 1972."},{"key":"24_CR24","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1137\/0121067","volume":"21","author":"F.P. Preparata","year":"1971","unstructured":"F.P. Preparata, \"On the representation of integers in nonadjacent forms,\" SIAM J. Appl. Math., vol. 21, pp. 630\u2013635, December 1971.","journal-title":"SIAM J. Appl. Math."},{"key":"24_CR25","volume-title":"Error coding for arithmetic processors","author":"T.R.N. Rao","year":"1974","unstructured":"T.R.N. Rao, Error coding for arithmetic processors. New York-London: Academic Press, 1974."},{"key":"24_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TIT.1971.1054579","volume":"IT-17","author":"T.R.N. Rao","year":"1971","unstructured":"T.R.N. Rao and O.N. Garcia, \"Cyclic and multiresidue codes for arithmetic operations,\" IEEE Trans. on Inform. Theory, vol. IT-17, pp. 85\u201391, January 1971.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"24_CR27","unstructured":"P. Sol\u00e9, Covering radius and association schemes. (In French). Th\u00e8se de Docteur-Ing\u00e9nieur, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications, Paris, France, 66 p., 1987."},{"key":"24_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0195-6698(89)80048-4","volume":"10","author":"P. Sol\u00e9","year":"1989","unstructured":"P. Sol\u00e9, \"A Lloyd theorem in weakly metric association schemes,\" Europ. J. Combinatorics, vol. 10, pp. 189\u2013196, 1989.","journal-title":"Europ. J. Combinatorics"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"P. Sol\u00e9, \"On the parameters of codes for the Lee and modular distance\", Discr. Math., to appear.","DOI":"10.1016\/0012-365X(91)90366-A"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Data structures and networks algorithms. Chapter 7, CBMS Ser. 44, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54522-0_114.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:44Z","timestamp":1619572964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54522-0_114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545224","9783540384366"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-54522-0_114","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}