메뉴 건너뛰기




Volumn 45, Issue 1, 1999, Pages 326-330

Construction of uniquely decodable codes for the two-user binary adder channel

Author keywords

Adder channel; Coding; Decoding; Multiple access channel

Indexed keywords

ADDERS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ENCODING (SYMBOLS); PERFORMANCE;

EID: 0032634686     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.746834     Document Type: Article
Times cited : (36)

References (9)
  • 1
    • 0002195239 scopus 로고    scopus 로고
    • "Multi-way communication channels," in 2nd
    • (Tsahkadzor, Armenian SSR, 1971). Budapest, Hungary: Publishing House of the Hungarian Academy of Sciences, 1973, pp. 23-52.
    • R. Ahlswede, "Multi-way communication channels," in 2nd Int. Symp. Information Theory (Tsahkadzor, Armenian SSR, 1971). Budapest, Hungary: Publishing House of the Hungarian Academy of Sciences, 1973, pp. 23-52.
    • Int. Symp. Information Theory
    • Ahlswede, R.1
  • 2
    • 33747285741 scopus 로고    scopus 로고
    • "The capacity region of a channel with two senders and two receivers,"
    • vol. 2, no. 5, pp. 805-814, 1974.
    • "The capacity region of a channel with two senders and two receivers," Ann. Probab., vol. 2, no. 5, pp. 805-814, 1974.
    • Ann. Probab.
  • 3
    • 0020587839 scopus 로고    scopus 로고
    • S. Lin, V. K. Wei, and S. Yamamura, "Graph theoretic approaches to the code construction for the two-user multiple-access binary adder channel,"
    • 29, pp. 114-130, Jan. 1983.
    • T. Kasami, S. Lin, V. K. Wei, and S. Yamamura, "Graph theoretic approaches to the code construction for the two-user multiple-access binary adder channel," IEEE Trans. Inform. Theory, vol. IT29, pp. 114-130, Jan. 1983.
    • IEEE Trans. Inform. Theory, Vol. IT
    • Kasami, T.1
  • 4
    • 0017946185 scopus 로고    scopus 로고
    • "Coding for a multiple-access channel,"
    • vol. 36, pp. 256-274, Mar. 1978.
    • E. J. Weldon, "Coding for a multiple-access channel," Inform. Contr., vol. 36, pp. 256-274, Mar. 1978.
    • Inform. Contr.
    • Weldon, E.J.1
  • 5
    • 0020277977 scopus 로고    scopus 로고
    • "On the construction of codes for noiseless synchronized 2-user channel,"
    • vol. 11, no. 4, pp. 319-324, 1982.
    • G. G. Khachatrian, "On the construction of codes for noiseless synchronized 2-user channel," Probl. Contr. Inform. Theory, vol. 11, no. 4, pp. 319-324, 1982.
    • Probl. Contr. Inform. Theory
    • Khachatrian, G.G.1
  • 6
    • 0021875180 scopus 로고    scopus 로고
    • "A family of good uniquely decodable code pairs for the two-access binary adder channel,"
    • 31, pp. 3-9, Jan. 1985.
    • P. A. B. M. Coebergh van den Braak and H. C. A. van Tilborg, "A family of good uniquely decodable code pairs for the two-access binary adder channel," IEEE Trans. Inform. Theory, vol. IT31, pp. 3-9, Jan. 1985.
    • IEEE Trans. Inform. Theory, Vol. IT
    • Braak, P.A.B.1    Van Tilborg, H.C.A.2
  • 7
    • 33747246221 scopus 로고    scopus 로고
    • "A universal encoding method with nonexponential work expediture for a source of independent messages,"
    • vol. 7, no. 4, pp. 13-21, Oct.-Dec. 1971. English translation: Probl. Inform. Transm., pp. 288-294.
    • V. F. Babkin, "A universal encoding method with nonexponential work expediture for a source of independent messages," Probl. Pered. Inform., vol. 7, no. 4, pp. 13-21, Oct.-Dec. 1971. English translation: Probl. Inform. Transm., pp. 288-294.
    • Probl. Pered. Inform.
    • Babkin, V.F.1
  • 8
    • 0015346058 scopus 로고    scopus 로고
    • "An algorithm for source coding,"
    • vol. IT18, pp. 395-399, May 1972.
    • J. P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inform. Theory, vol. IT18, pp. 395-399, May 1972.
    • IEEE Trans. Inform. Theory
    • Schalkwijk, J.P.M.1
  • 9
    • 0015565580 scopus 로고    scopus 로고
    • "Enumerative source coding,"
    • vol. IT19, pp. 73-77, Jan. 1973.
    • T. M. Cover, "Enumerative source coding," IEEE Trans. Inform. Theory, vol. IT19, pp. 73-77, Jan. 1973.
    • IEEE Trans. Inform. Theory
    • Cover, T.M.1


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