{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:33:36Z","timestamp":1753889616467},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551300"},{"type":"electronic","value":"9783540467397"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0034336","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:19:19Z","timestamp":1134281959000},"page":"16-22","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exponential sums and constrained error-correcting codes"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,22]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0019-9958(61)80046-6","volume":"4","author":"R.P. Bambah","year":"1961","unstructured":"R.P.Bambah,D.D.Joshi, and I.S.Luthar. Some lower bounds on the number of code points in a minimum distance binary codes I,II. Inform. and Contr., 4,4 (December 1961), 313\u2013323.","journal-title":"Inform. and Contr."},{"issue":"4","key":"3_CR2","first-page":"78","volume":"2","author":"L.A. Bassalygo","year":"1966","unstructured":"L.A.Bassalygo. On separable comma-free codes. Problemy Peredachi Inform., 2,4 (1966), 78\u201379, and Probl. Inform. Trans.\n2 (1966), 52\u201353.","journal-title":"Problemy Peredachi Inform."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/18.79949","volume":"37","author":"A.M. Barg","year":"1991","unstructured":"A.M.Barg and S.N.Litsyn DC-constrained codes from Hadamard matrices. IEEE Trans. Inform. Theory, 37, 3, Pt.2 (May 1991), 801\u2013807.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR4","volume-title":"Algebraic Coding Theory.","author":"E.R. Berlecamp","year":"1968","unstructured":"E.R.Berlecamp. Algebraic Coding Theory. McGraw Hill, N.Y. et al., 1968."},{"issue":"2","key":"3_CR5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.4153\/CJM-1958-023-9","volume":"10","author":"S. Golomb","year":"1958","unstructured":"S.Golomb, W.Gordon, and L.Welch. Comma-free codes. Canad. J. Math., 10, 2 (1958), 202\u2013209.","journal-title":"Canad. J. Math."},{"issue":"2","key":"3_CR6","first-page":"3","volume":"5","author":"V.I. Levenstein","year":"1969","unstructured":"V.I.Levenstein. Bounds for codes that provide error correction and synchronization. Problemy Peredachi Inform.,5,2 (1969), 3\u201313, and Probl. Inform. Trans. 5 (1969).","journal-title":"Problemy Peredachi Inform"},{"issue":"3","key":"3_CR7","first-page":"30","volume":"7","author":"V.I. Levenstein","year":"1971","unstructured":"V.I.Levenstein. One method of constructing quasilinear codes providing synchronization in the presence of errors. Problemy Peredachi Inform., 7,3 (1971), 30\u201340, and Probl. Inform. Trans, 7 (1971), 215\u2013227.","journal-title":"Problemy Peredachi Inform."},{"key":"3_CR8","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J.MacWilliams and N.J.A.Sloane. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1977."},{"issue":"1","key":"3_CR9","first-page":"16","volume":"5","author":"V.M. Sidel'nikov","year":"1967","unstructured":"V.M.Sidel'nikov. Some k-valued pseudo-random sequences and nearly equidistant codes. Problemy Peredachi Inform., 5,1 (1967),16\u201322, and Probl. Inform. Trans., 5 (1969), 12\u201316.","journal-title":"Problemy Peredachi Inform."},{"key":"3_CR10","unstructured":"I.M.Vinogradov. Elements of Number Theory. 9th ed., Moscow, 1981, in Russian."}],"container-title":["Lecture Notes in Computer Science","Algebraic Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0034336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:04:17Z","timestamp":1558271057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0034336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551300","9783540467397"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0034336","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"22 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}