{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:27:20Z","timestamp":1761060440703,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T00:00:00Z","timestamp":1508371200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10623-017-0428-3","type":"journal-article","created":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T03:54:35Z","timestamp":1508385275000},"page":"1893-1904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Unweighted linear congruences with distinct coordinates and the Varshamov\u2013Tenengolts codes"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3301-0232","authenticated-orcid":false,"given":"Khodakhast","family":"Bibak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce M.","family":"Kapron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,19]]},"reference":[{"key":"428_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.2140\/involve.2010.3.341","volume":"3","author":"D Adams","year":"2010","unstructured":"Adams D., Ponomarenko V.: Distinct solution to a linear congruence. Involve 3, 341\u2013344 (2010).","journal-title":"Involve"},{"key":"428_CR2","first-page":"1","volume":"5","author":"K Archer","year":"2014","unstructured":"Archer K., Elizalde S.: Cyclic permutations realized by signed shifts. J. Comb. 5, 1\u201330 (2014).","journal-title":"J. Comb."},{"key":"428_CR3","first-page":"3830","volume":"2015","author":"F Ardila","year":"2015","unstructured":"Ardila F., Castillo F., Henley M.: The arithmetic Tutte polynomials of the classical root systems. Int. Math. Res. Not. 2015, 3830\u20133877 (2015).","journal-title":"Int. Math. Res. Not."},{"key":"428_CR4","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.nuclphysb.2016.07.028","volume":"910","author":"K Bibak","year":"2016","unstructured":"Bibak K., Kapron B.M., Srinivasan V.: Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT. Nucl. Phys. B 910, 712\u2013723 (2016).","journal-title":"Nucl. Phys. B"},{"key":"428_CR5","unstructured":"Bibak K., Kapron B.M., Srinivasan V.: A generalization of Sch\u00f6nemann\u2019s theorem via a graph theoretic method (submitted)."},{"key":"428_CR6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.jnt.2016.07.018","volume":"171","author":"K Bibak","year":"2017","unstructured":"Bibak K., Kapron B.M., Srinivasan V., Tauraso R., T\u00f3th L.: Restricted linear congruences. J. Number Theory 171, 128\u2013144 (2017).","journal-title":"J. Number Theory"},{"key":"428_CR7","doi-asserted-by":"crossref","unstructured":"Bibak K., Kapron B.M., Srinivasan V., T\u00f3th L.: On an almost-universal hash function family with applications to authentication and secrecy codes, Int. J. Found. Comput. Sci. (to appear).","DOI":"10.1142\/S0129054118500089"},{"key":"428_CR8","first-page":"92","volume":"35","author":"A Brauer","year":"1926","unstructured":"Brauer A.: L\u00f6sung der Aufgabe 30. Jber. Deutsch. Math.\u2013Verein 35, 92\u201394 (1926).","journal-title":"Jber. Deutsch. Math.\u2013Verein"},{"key":"428_CR9","doi-asserted-by":"crossref","first-page":"2120","DOI":"10.1137\/080730093","volume":"23","author":"L Dolecek","year":"2010","unstructured":"Dolecek L., Anantharam V.: Repetition error correcting sets: explicit constructions and prefixing methods. SIAM J. Discret. Math. 23, 2120\u20132146 (2010).","journal-title":"SIAM J. Discret. Math."},{"key":"428_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"IM Gessel","year":"1993","unstructured":"Gessel I.M., Reutenauer C.: Counting permutations with given cycle structure and descent set. J. Comb. Theory Ser. A 64, 189\u2013215 (1993).","journal-title":"J. Comb. Theory Ser. A"},{"key":"428_CR11","first-page":"393","volume":"28","author":"DM Gevorkyan","year":"1992","unstructured":"Gevorkyan D.M., Kabatiansky G.A.: On Varshamov\u2013Tenengolts codes and a conjecture of L.A. Bassalygo. Probl. Inf. Transm. 28, 393\u2013395 (1992).","journal-title":"Probl. Inf. Transm."},{"key":"428_CR12","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1215\/ijm\/1255631587","volume":"5","author":"EN Gilbert","year":"1961","unstructured":"Gilbert E.N., Riordan J.: Symmetry types of periodic sequences. Illinois J. Math. 5, 657\u2013665 (1961).","journal-title":"Illinois J. Math."},{"key":"428_CR13","first-page":"249","volume":"19","author":"BD Ginzburg","year":"1967","unstructured":"Ginzburg B.D.: A certain number-theoretic function which has an application in coding theory (Russian). Problemy Kibernet. 19, 249\u2013252 (1967).","journal-title":"Problemy Kibernet."},{"key":"428_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11856-012-0119-8","volume":"193","author":"DJ Grynkiewicz","year":"2013","unstructured":"Grynkiewicz D.J., Philipp A., Ponomarenko V.: Arithmetic-progression-weighted subsequence sums. Israel J. Math. 193, 359\u2013398 (2013).","journal-title":"Israel J. Math."},{"key":"428_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.6028\/jres.074B.001","volume":"74B","author":"H Gupta","year":"1970","unstructured":"Gupta H.: Partitions\u2013a survey. J. Res. Nat. Bur. Stand. B. Math. Sci. 74B, 1\u201329 (1970).","journal-title":"J. Res. Nat. Bur. Stand. B. Math. Sci."},{"key":"428_CR16","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1215\/S0012-7094-72-03959-2","volume":"39","author":"D Jacobson","year":"1972","unstructured":"Jacobson D., Williams K.S.: On the number of distinguished representations of a group element. Duke Math. J. 39, 521\u2013527 (1972).","journal-title":"Duke Math. J."},{"key":"428_CR17","first-page":"408","volume":"9","author":"JC Kluyver","year":"1906","unstructured":"Kluyver J.C.: Some formulae concerning the integers less than $$n$$ n and prime to $$n$$ n . Proc. R. Neth. Acad. Arts Sci. (KNAW) 9, 408\u2013414 (1906).","journal-title":"Proc. R. Neth. Acad. Arts Sci. (KNAW)"},{"key":"428_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1080\/00029890.1913.11997943","volume":"20","author":"DN Lehmer","year":"1913","unstructured":"Lehmer D.N.: Certain theorems in the theory of quadratic residues. Am. Math. Mon. 20, 151\u2013157 (1913).","journal-title":"Am. Math. Mon."},{"key":"428_CR19","unstructured":"Levenshtein V.I.: Binary codes capable of correcting deletions, insertions and reversals (in Russian). Doklady Akademii Nauk SSSR 163, 845\u2013848 (1965). English translation in Soviet Physics Dokl. 10, 707\u2013710 (1966)."},{"key":"428_CR20","unstructured":"Levenshtein V.I.: Binary codes capable of correcting spurious insertions and deletions of ones (in Russian). Problemy Peredachi Informatsii 1, 12\u201325 (1965). English translation in Problems of Information Transmission 1, 8\u201317 (1965)."},{"key":"428_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disc.2004.04.015","volume":"287","author":"G Maze","year":"2004","unstructured":"Maze G.: Partitions modulo $$n$$ n and circulant matrices. Discret. Math. 287, 77\u201384 (2004).","journal-title":"Discret. Math."},{"key":"428_CR22","doi-asserted-by":"crossref","unstructured":"Milnor J., Thurston W.: On iterated maps of the interval, dynamical systems. Lecture Notes in Mathematics, Vol. 1342, pp. 465\u2013563. Springer, Berlin (1988)","DOI":"10.1007\/BFb0082847"},{"key":"428_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511618314","volume-title":"Multiplicative Number Theory I: Classical Theory","author":"HL Montgomery","year":"2006","unstructured":"Montgomery H.L., Vaughan R.C.: Multiplicative Number Theory I: Classical Theory. Cambridge University Press, Cambridge (2006)."},{"key":"428_CR24","first-page":"158","volume":"34","author":"H Rademacher","year":"1925","unstructured":"Rademacher H.: Aufgabe 30. Jber. Deutsch. Math.\u2013Verein 34, 158 (1925).","journal-title":"Jber. Deutsch. Math.\u2013Verein"},{"key":"428_CR25","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0097-3165(79)90021-9","volume":"27","author":"R Razen","year":"1979","unstructured":"Razen R., Seberry J., Wehrhahn K.: Ordered partitions and codes generated by circulant matrices. J. Comb. Theory Ser. A 27, 333\u2013341 (1979).","journal-title":"J. Comb. Theory Ser. A"},{"key":"428_CR26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/S0097539798344112","volume":"29","author":"F Ruskey","year":"1999","unstructured":"Ruskey F., Sawada J.: An efficient algorithm for generating necklaces with fixed density. SIAM J. Comput. 29, 671\u2013684 (1999).","journal-title":"SIAM J. Comput."},{"key":"428_CR27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1515\/crll.1839.19.231","volume":"1839","author":"T Sch\u00f6nemann","year":"1839","unstructured":"Sch\u00f6nemann T.: Theorie der symmetrischen Functionen der Wurzeln einer Gleichung. Allgemeine S\u00e4tze \u00fcber Congruenzen nebst einigen Anwendungen derselben. J. Reine Angew. Math. 1839, 231\u2013243 (1839).","journal-title":"J. Reine Angew. Math."},{"key":"428_CR28","first-page":"273","volume-title":"Codes and Designs, Ohio State University, May 2000 (Ray-Chaudhuri Festschrift)","author":"NJA Sloane","year":"2002","unstructured":"Sloane N.J.A.: On single-deletion-correcting codes. In: Arasu K.T., Seress A. (eds.) Codes and Designs, Ohio State University, May 2000 (Ray-Chaudhuri Festschrift), pp. 273\u2013291. Walter de Gruyter, Berlin (2002)."},{"key":"428_CR29","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"2012","unstructured":"Stanley R.P.: Enumerative Combinatorics, vol. 1, 2nd edn. Cambridge University Press, Cambridge (2012).","edition":"2"},{"key":"428_CR30","unstructured":"Stanley R.P., Yoder M.F.: A study of Varshamov codes for asymmetric channels, Jet Propulsion Laboratory, Technical Report 32-1526, Vol. XIV, pp. 117\u2013123 (1973)."},{"key":"428_CR31","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s00026-001-8024-6","volume":"5","author":"J-Y Thibon","year":"2001","unstructured":"Thibon J.-Y.: The cycle enumerator of unimodal permutations. Ann. Comb. 5, 493\u2013500 (2001).","journal-title":"Ann. Comb."},{"key":"428_CR32","first-page":"540","volume":"161","author":"RR Varshamov","year":"1965","unstructured":"Varshamov R.R.: On an arithmetic function with an application in the theory of coding (in Russian). Dokl. Akad. Nauk SSSR 161, 540\u2013543 (1965).","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"428_CR33","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TIT.1973.1054954","volume":"19","author":"RR Varshamov","year":"1973","unstructured":"Varshamov R.R.: A class of codes for asymmetric channels and a problem from the additive theory of numbers. IEEE Trans. Inf. Theory 19, 92\u201395 (1973).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"428_CR34","unstructured":"Varshamov R.R., Tenengolts G.M.: Codes which correct single asymmetric errors (in Russian), Avtomatika i Telemekhanika 26, 288\u2013292 (1965). English translation in Automation and Remote Control 26, 286\u2013290 (1965)."},{"key":"428_CR35","unstructured":"von Sterneck R.D.: Ein Analogon zur additiven Zahlentheorie, Sitzber, Akad. Wiss. Wien, Math. Naturw. Klasse 111 (Abt. IIa), 1567\u20131601 (1902)."},{"key":"428_CR36","unstructured":"Weiss A., Rogers T.D.: The number of orientation-reversing cycles in the quadratic map. CMS Conference Proceedings on Oscillation, Bifurcation and Chaos 8, 703\u2013711 (1987)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-017-0428-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0428-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-017-0428-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T17:35:10Z","timestamp":1570210510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-017-0428-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,19]]},"references-count":36,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["428"],"URL":"https:\/\/doi.org\/10.1007\/s10623-017-0428-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2017,10,19]]}}}