{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:27:42Z","timestamp":1758637662693},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1007\/bf01388409","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T08:31:01Z","timestamp":1112430661000},"page":"105-116","source":"Crossref","is-referenced-by-count":7,"title":["Incomplete sums, DC-constrained codes, and codes that maintain synchronization"],"prefix":"10.1007","volume":"3","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0019-9958(61)80046-6","volume":"4","author":"R.P. Bambah","year":"1961","unstructured":"Bambah, R.P., Joshi, D.D., and Luthar, I.S. 1961. Some lower bounds on the number of code points in a minimum distance binary codes I,II.Inform. and Contr., 4:313?323.","journal-title":"Inform. and Contr."},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/18.79949","volume":"37","author":"A.M. Barg","year":"1991","unstructured":"Barg, A.M., and Litsyn, S.N. 1991. DC-constrained codes from Hadamard matrices.IEEE Trans. Inform. Theory, IT-37, 3, Pt. 2:801?807.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"key":"CR3","first-page":"78","volume":"2","author":"L.A. Bassalygo","year":"1966","unstructured":"Bassalygo, L.A. 1966. On separable comma-free codes.Problemy Peredachi Inform., 2:78?79, andProbl. Inform. Trans. 2:52?53.","journal-title":"Problemy Peredachi Inform."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.5486\/PMD.1950.1.2-4.19","volume":"1","author":"P.T. Bateman","year":"1950","unstructured":"Bateman, P.T., Chowla, S., and Erd\u00f6s, P. 1950. Remarks on the size ofL(1, ?).Publ. Mat. Debrecen, 1:165?182.","journal-title":"Publ. Mat. Debrecen"},{"key":"CR5","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R. 1968.Algebraic Coding Theory. New York: McGraw Hill."},{"issue":"5","key":"CR6","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/18.42227","volume":"35","author":"M. Blaum","year":"1989","unstructured":"Blaum, M., and van Tilborg, H.C.A., 1989. On error-correcting balanced codes.IEEE Trans. Inform. Theory, IT-35, 5:1091?1093.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/18.30980","volume":"35","author":"A.R. Calderbank","year":"1989","unstructured":"Calderbank, A.R., Herro, M., and Telang, V. 1989. A multilevel approach to the design of dc-free codes.IEEE Trans. Inform. Theory, IT-35, 3:579?583.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"issue":"2","key":"CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02843959","volume":"12","author":"H. Davenport","year":"1963","unstructured":"Davenport, H., and Lewis, D.J. 1963. Character sums and primitive roots in finite fields.Rend. Circ. Mat. Palermo (2), 12, Fasc. 2:129?136.","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.4153\/CJM-1958-023-9","volume":"10","author":"S. Golomb","year":"1958","unstructured":"Golomb, S., Gordon W., and Welch, L. 1958. Comma-free codes.Canad. J. Math., 10: 202?209.","journal-title":"Canad. J. Math."},{"key":"CR10","volume-title":"Coding Techniques for Digital Recorders","author":"K.A.S. Immink","year":"1991","unstructured":"Immink, K.A.S. 1991.Coding Techniques for Digital Recorders. Englewood Cliffs, NJ: Prentice Hall."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1109\/TIT.1982.1056516","volume":"28","author":"J. Justesen","year":"1982","unstructured":"Justesen, J. 1982. Information rates and power spectra of digital codes.IEEE Trans. Inform. Theory, IT-28:457?472.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"issue":"1","key":"CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.1986.1057136","volume":"32","author":"D. Knuth","year":"1986","unstructured":"Knuth, D. 1986. Efficient balanced codes.IEEE Trans. Inform. Theory, IT-32, 1:51?53.","journal-title":"IEEE Trans. Inform. Theory, IT"},{"key":"CR13","first-page":"3","volume":"5","author":"V.I. Levenshtein","year":"1969","unstructured":"Levenshtein, V.I. 1969. Bounds for codes that provide error correction and synchronization.Problemy Peradachi Inform., 5:3?13, andProb. Inform. Trans. 5.","journal-title":"Problemy Peradachi Inform."},{"key":"CR14","first-page":"30","volume":"7","author":"V.I. Levenshtein","year":"1971","unstructured":"Levenshtein, V.I. 1971. One method of constructing quasilinear codes providing synchronization in the presence of errors.Problemy Peredachi Inform., 7:30?40, andProbl. Inform. Trans. 7:215?222.","journal-title":"Problemy Peredachi Inform."},{"key":"CR15","first-page":"1303","volume":"263","author":"V.I. Levenshtein","year":"1982","unstructured":"Levenshtein, V.I. 1982. Bounds on the maximum cardinality of a code with bounded modules of the inner product.Doklady AN SSSR, 263:1303?1308, andSoviet Math. Dokl., 25:526?531.","journal-title":"Doklady AN SSSR"},{"key":"CR16","first-page":"47","volume":"40","author":"V.I. Levenshtein","year":"1983","unstructured":"Levenshtein, V.I. 1983. Bounds for packings of metric spaces and certain applications.Problemy Kybernetiki, 40:47?110 (in Russian).","journal-title":"Problemy Kybernetiki"},{"key":"CR17","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., and Sloane, N.J.A. 1977.The Theory of Error-Correcting Codes. Amsterdam: North-Holland."},{"key":"CR18","unstructured":"Moriuchi, T., and Imamura, K. 1991. Balanced polyphase sequences with good periodic correlation properties obtained from modified Kumar-Moreno sequences.Proc. 1991 IEEE Intern. Symp. Inform. Theory, Budapest, Hungary, p. 382."},{"key":"CR19","unstructured":"Niederreiter, H. 1976. Some new exponential sums with applications to pseudo-random sequences. In P. Tur\u00e1n (ed.,),Topics in Number Theory, Colloq. Math. Soc. Janos Bolyai, Debrecen, Hungary, 13, pp. 209?232."},{"key":"CR20","series-title":"Lect. Notes. Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0080437","volume-title":"Equations over Finite Fields. An Elementary Approach","author":"W. Schmidt","year":"1976","unstructured":"Schmidt, W. 1976.Equations over Finite Fields. An Elementary Approach. Lect. Notes. Math., 536, Springer-Verlag, Berlin."},{"key":"CR21","first-page":"16","volume":"5","author":"V.M. Sidel'nikov","year":"1969","unstructured":"Sidel'nikov, V.M. 1969. Somek-valued pseudo-random sequences and nearly equidistant codes.Problemy Peredachi Inform. 5:16?22, andProbl. Inform. Trans., 5:12?16.","journal-title":"Problemy Peredachi Inform."},{"key":"CR22","first-page":"15","volume":"24","author":"V.M. Sidel'nikov","year":"1971","unstructured":"Sidel'nikov, V.M. 1971. On mutual correlation of sequences.Problemy Kybernetiki, 24:15?42 (in Russian).","journal-title":"Problemy Kybernetiki"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TMAG.1985.1063972","volume":"21","author":"P. Siegel","year":"1985","unstructured":"Siegel, P. 1985. Recording codes for digital magnetic storage.IEEE Trans. Magn., MAG-21:1344?1349.","journal-title":"IEEE Trans. Magn., MAG"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1112\/blms\/18.2.140","volume":"18","author":"H. Tarnanen","year":"1986","unstructured":"Tarnanen, H. 1986. An asymptotic lower bound for the character sums induced by the Legendre symbols.Bull. London Math. Soc., 18:140?146.","journal-title":"Bull. London Math. Soc."},{"issue":"2","key":"CR25","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1112\/jlms\/s2-29.2.204","volume":"29","author":"A. Tiet\u00e4v\u00e4inen","year":"1984","unstructured":"Tiet\u00e4v\u00e4inen, A. 1984. Lower bounds for the maximum moduli of certain character sums.J. London Math. Soc. (2), 29:204?210.","journal-title":"J. London Math. Soc."},{"key":"CR26","volume-title":"Elements of Number Theory","author":"I.M. Vinogradov","year":"1981","unstructured":"Vinogradov, I.M. 1981.Elements of Number Theory. 9th ed., Moscow: Nauka (in Russian).","edition":"9th ed."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388409\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388409\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:13:54Z","timestamp":1683058434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF01388409"],"URL":"https:\/\/doi.org\/10.1007\/bf01388409","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}