{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:56Z","timestamp":1725457016622},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540551301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0034352","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:19:19Z","timestamp":1134281959000},"page":"151-158","source":"Crossref","is-referenced-by-count":0,"title":["Decoding for multiple-access channels"],"prefix":"10.1007","author":[{"given":"Irina E.","family":"Bocharova","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"P.Mathys. \u201cA class of codes for a T active users out of N multiple-access communication system\u201d, IEEE, Trans. Inform. Theory, vol.36, no.6, Nov.1990.","DOI":"10.1109\/18.59923"},{"issue":"no.1","key":"19_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1109\/18.42183","volume":"35","author":"R. Lupas","year":"1989","unstructured":"R.Lupas and S.Verdu. \u201cLinear multiuser detectors for synchronous code-division multiple-access channels\u201d, IEEE, Trans. Inform. Theory., vol.35, no.1, pp. 123\u2013136, Jan. 1989.","journal-title":"IEEE, Trans. Inform. Theory."},{"issue":"no.1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TIT.1986.1057121","volume":"IT-32","author":"S. Verdu","year":"1986","unstructured":"S.Verdu. \u201cMinimum probability of error for asynchronous Gaussian multiple-access channels\u201d, IEEE Trans. Inform. Theory, vol.IT-32, no.1, pp.85\u201396, Jan.1986.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no.6","key":"19_CR4","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/TIT.1979.1056109","volume":"IT-25","author":"S.C. Chang","year":"1979","unstructured":"S.C.Chang, E.J.Weldon,Jr. \u201cCoding for T-user multiple-access channels\u201d, IEEE Trans. Inform. Theory, vol. IT-25, no.6, p.684\u2013691, Nov.1979.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no.2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/TIT.1984.1056862","volume":"IT-30","author":"S.C. Chang","year":"1984","unstructured":"S.C.Chang. \u201cFurther results on coding for T-user multiple-access channels\u201d, IEEE Trans. Inform. Theory, vol. IT-30, no.2, pp.411\u2013415, Mar. 1984.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no.2","key":"19_CR6","first-page":"38","volume":"26","author":"I.E. Bocharova","year":"1990","unstructured":"I.E.Bocharova, F.A.Taubin.\u201c Generalized correlation metric for decoding in a multiple-access channel\u201d, Problems Info. Trans., vol.26, no.2, pp.38\u201344, 1990.","journal-title":"Problems Info. Trans."},{"key":"19_CR7","unstructured":"I.E.Bocharova. \u201cGenerating functions for a class of high rate convolutional codes,\u201d II International Workshop \u201cAlgebraic and combinatorial coding theory,\u201d 16\u201322 September, 1990, pp.38\u201341."},{"key":"19_CR8","unstructured":"I.E.Bocharova. \u201cAlmost orthogonal codes for orthogonal signals,\u201d Fifth Joint Soviet-Swedish International Workshop on Information theory, \u201cConvolutional codes; multi-user communication,\u201d 13\u201319 January, 1991, pp.25\u201328."},{"key":"19_CR9","unstructured":"I.E.Bocharova, B.D.Kudryashov \u201cConvolutional codes for data transmission using orthogonal signals, \u201d Proc. International Symposium \u201cSatellite communication: Present and Future,\u201d October 1\u20135, 1990, pp.b.12.1\u2013b.12.10."},{"issue":"no.3","key":"19_CR10","first-page":"3","volume":"22","author":"A.N. Trofimov","year":"1986","unstructured":"A.N.Trofimov, F.A.Taubin \u201cBound on decoding error probability for channel with multiple access and interference,\u201d Problems Info. Trans., vol.22, no.3, pp.3\u201315, 1986.","journal-title":"Problems Info. Trans."},{"key":"19_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2174-1","volume-title":"Error-correction coding for digital communications","author":"G.C. Clark Jr.","year":"1981","unstructured":"G.C.Clark,Jr. and J.Cain \u201cError-correction coding for digital communications,\u201d Plenum Press, New York, 1981."},{"key":"19_CR12","volume-title":"Principles of digital communications and coding","author":"A.J. Viterbi","year":"1979","unstructured":"A.J.Viterbi, J.K. Omura \u201cPrinciples of digital communications and coding,\u201d New York McGraw-Hill Book company, 1979."},{"key":"19_CR13","first-page":"279","volume-title":"Advances in communication systems, vol.4","author":"A.J. Viterbi","year":"1975","unstructured":"A.J. Viterbi, I. M. Jacobs \u201cAdvances in coding and modulation for non-coherent channels affected by fading, partial band and multiple-access interference,\u201d Advances in communication systems, vol.4, New York: Academic, pp.279\u2013308, 1975."}],"container-title":["Lecture Notes in Computer Science","Algebraic Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0034352.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:10:32Z","timestamp":1607551832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0034352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540551301"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0034352","relation":{},"subject":[]}}