메뉴 건너뛰기




Volumn 55, Issue 1, 2009, Pages 93-98

Recursive constructions of detecting matrices for multiuser coding: A unifying approach

Author keywords

Binary adder channels; Coin weighing; Detecting matrices; Multiuser codes; Unique decodability

Indexed keywords

ADDERS; DECODING; EQUIVALENCE CLASSES; WEIGHING;

EID: 58249134834     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2008139     Document Type: Article
Times cited : (22)

References (16)
  • 1
    • 4243496236 scopus 로고
    • A combinatory detection problem
    • S. Söderberg and H. S. Shapiro, "A combinatory detection problem," Amer. Math. Monthly, vol. 70, pp. 1066-1070, 1963.
    • (1963) Amer. Math. Monthly , vol.70 , pp. 1066-1070
    • Söderberg, S.1    Shapiro, H.S.2
  • 2
    • 0001272046 scopus 로고
    • On two problems of information theory
    • R. Erdös and A. Rényi, "On two problems of information theory," Publ. Hung. Acad. Sci., vol. 8, pp. 241-254, 1963.
    • (1963) Publ. Hung. Acad. Sci , vol.8 , pp. 241-254
    • Erdös, R.1    Rényi, A.2
  • 3
    • 0000550880 scopus 로고
    • On a combinatory detection problem
    • B. Lindström, "On a combinatory detection problem," Publ. Hung. Acad. Sci., vol. 9, pp. 195-207, 1964.
    • (1964) Publ. Hung. Acad. Sci , vol.9 , pp. 195-207
    • Lindström, B.1
  • 4
    • 0039675332 scopus 로고
    • Determining a subset from certain combinatorial properties
    • D. G. Cantor and W. H. Mills, "Determining a subset from certain combinatorial properties," Can. J. Math., vol. 18, pp. 42-48, 1966.
    • (1966) Can. J. Math , vol.18 , pp. 42-48
    • Cantor, D.G.1    Mills, W.H.2
  • 5
    • 0001153866 scopus 로고
    • Determining subsets by unramified experiments
    • B. Lindström, J. N. Srivastava, Ed, New York: North-Holland
    • B. Lindström, J. N. Srivastava, Ed., "Determining subsets by unramified experiments," in A Survey of Statistical Design and Linear Models. New York: North-Holland, 1975.
    • (1975) A Survey of Statistical Design and Linear Models
  • 6
    • 0018543746 scopus 로고
    • Coding for T-user multiple-access channels
    • Nov
    • S.-C. Chang and E. J. Weldon Jr., "Coding for T-user multiple-access channels," IEEE Trans. Inf. Theory, vol. IT-25, no. 6, pp. 684-691, Nov. 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.IT-25 , Issue.6 , pp. 684-691
    • Chang, S.-C.1    Weldon Jr., E.J.2
  • 7
    • 0020180453 scopus 로고
    • Generalized T-user codes for multiple-access channels
    • Sep
    • T. J. Ferguson, "Generalized T-user codes for multiple-access channels," IEEE Trans. Inf. Theory, vol. IT-28, no. 5, pp. 775-778, Sep. 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.IT-28 , Issue.5 , pp. 775-778
    • Ferguson, T.J.1
  • 8
    • 0021389462 scopus 로고
    • Further results on coding for T-user multiple-access channels
    • Mar
    • S.-C. Chang, "Further results on coding for T-user multiple-access channels," IEEE Trans. Inf. Theory, vol. IT-30, no. 2, pp. 411-415, Mar. 1984.
    • (1984) IEEE Trans. Inf. Theory , vol.IT-30 , Issue.2 , pp. 411-415
    • Chang, S.-C.1
  • 9
    • 0025415689 scopus 로고
    • Construction of signature codes and the coin weighing problem
    • Oct.-Dec
    • S. S. Martirossian and G. H. Khachatrian, "Construction of signature codes and the coin weighing problem," Probl. Inf. Trans., vol. 25, pp. 334-335, Oct.-Dec. 1989.
    • (1989) Probl. Inf. Trans , vol.25 , pp. 334-335
    • Martirossian, S.S.1    Khachatrian, G.H.2
  • 11
    • 8844224513 scopus 로고
    • On Möbius functions and a problem in combinatorial number theory
    • B. Lindström, "On Möbius functions and a problem in combinatorial number theory," Can. Math. Bull., vol. 14, pp. 513-516, 1971.
    • (1971) Can. Math. Bull , vol.14 , pp. 513-516
    • Lindström, B.1
  • 12
    • 0030106755 scopus 로고    scopus 로고
    • Nearly optimal multiuser codes for the binary adder channel
    • Mar
    • B. L. Hughes and A. B. Cooper III, "Nearly optimal multiuser codes for the binary adder channel," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 387-398, Mar. 1996.
    • (1996) IEEE Trans. Inf. Theory , vol.42 , Issue.2 , pp. 387-398
    • Hughes, B.L.1    Cooper III, A.B.2
  • 13
    • 0029376084 scopus 로고
    • A new approach to the design of codes for synchronous-CDMA systems
    • Sep
    • G. H. Khachatrian and S. S. Martirossian, "A new approach to the design of codes for synchronous-CDMA systems," IEEE Trans. Inf. Theory, vol. 41, no. 5, pp. 1503-1506, Sep. 1995.
    • (1995) IEEE Trans. Inf. Theory , vol.41 , Issue.5 , pp. 1503-1506
    • Khachatrian, G.H.1    Martirossian, S.S.2
  • 14
    • 0031145160 scopus 로고    scopus 로고
    • Coding scheme for synchronous-CDMA systems
    • May
    • Y. W. Wu and S. C. Chang, "Coding scheme for synchronous-CDMA systems," IEEE Trans. Inf. Theory, vol. 43, no. 3, pp. 1064-1067, May 1997.
    • (1997) IEEE Trans. Inf. Theory , vol.43 , Issue.3 , pp. 1064-1067
    • Wu, Y.W.1    Chang, S.C.2
  • 15
    • 45249113746 scopus 로고    scopus 로고
    • Multiuser coding based on detecting matrices for synchronous-CDMA systems
    • M. Darnell, Ed. Berlin, Germany: Springer-Verlag
    • W. H. Mow, "Multiuser coding based on detecting matrices for synchronous-CDMA systems," in Lecture Notes in Computer Science, M. Darnell, Ed. Berlin, Germany: Springer-Verlag, 1997, vol. 1355, pp. 251-257.
    • (1997) Lecture Notes in Computer Science , vol.1355 , pp. 251-257
    • Mow, W.H.1
  • 16
    • 0030735104 scopus 로고    scopus 로고
    • How an Erdös-Rényi type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
    • Jan
    • M. Ruszinkó and P. Vanroose, "How an Erdös-Rényi type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback," IEEE Trans. Inf. Theory, vol. 43, no. 1, pp. 368-373, Jan. 1997.
    • (1997) IEEE Trans. Inf. Theory , vol.43 , Issue.1 , pp. 368-373
    • Ruszinkó, M.1    Vanroose, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.