메뉴 건너뛰기




Volumn 31, Issue 2, 1985, Pages 255-263

Analytic Properties of Multiple-Access Trees

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY - COMMUNICATION CHANNELS; RADIO TRANSMISSION - MULTIPLEX SYSTEMS;

EID: 0022034212     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1057015     Document Type: Article
Times cited : (27)

References (10)
  • 2
    • 0018522043 scopus 로고
    • Tree algorithms for packet broadcast channels
    • Sept
    • J. I. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 505–515, Sept. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 505-515
    • Capetanakis, J.I.1
  • 3
    • 0018532079 scopus 로고
    • Generalized TDMA: The multi-accessing tree protocol
    • Oct
    • J. I. Capetanakis, “Generalized TDMA: The multi-accessing tree protocol,” IEEE Trans. Commun., vol. COM-27, pp. 1476–1484, Oct. 1979.
    • (1979) IEEE Trans. Commun. , vol.COM-27 , pp. 1476-1484
    • Capetanakis, J.I.1
  • 4
    • 84939047559 scopus 로고    scopus 로고
    • Collision-based multiple access when the multiplicities of the conflicts are known
    • M.A. thesis, McGill Univ., Montreal, PQ, Canada, May
    • E. Gulko, “Collision-based multiple access when the multiplicities of the conflicts are known,” M.A. thesis, McGill Univ., Montreal, PQ, Canada, May 1982.
    • Gulko, E.1
  • 5
    • 2342549341 scopus 로고
    • An adaptive technique for local distribution
    • Aug
    • J. F. Hayes, “An adaptive technique for local distribution,” IEEE Trans. Commun., vol. COM-26, pp. 1178–1186, Aug. 1978.
    • (1978) IEEE Trans. Commun. , vol.COM-26 , pp. 1178-1186
    • Hayes, J.F.1
  • 7
    • 0003767994 scopus 로고
    • Collision-resolution algorithms and random-access communications
    • Los Angeles, Apr
    • J. L. Massey, “Collision-resolution algorithms and random-access communications,” Tech. Rep. UCLA-ENG-8016, Univ. of California, Los Angeles, Apr. 1980.
    • (1980) Tech. Rep. UCLA-ENG-8016, Univ. of California
    • Massey, J.L.1
  • 8
    • 84939703761 scopus 로고
    • A comparison of Q-ary tree algorithms for collision resolution
    • Les Arcs, France, June
    • P. Mathys, “A comparison of Q-ary tree algorithms for collision resolution,” Abstracts of Papers, Int. Symp. Information Theory, Les Arcs, France, June 1982, p. 138.
    • (1982) Abstracts of Papers, Int. Symp. Information Theory , pp. 138
    • Mathys, P.1
  • 9
    • 0018022007 scopus 로고
    • Free synchronous packet access in a broadcast channel with feedback
    • Oct.—Dec
    • B. S. Tsybakov and V. A. Mikhailov, “Free synchronous packet access in a broadcast channel with feedback,” Probl. Inform. Trans., vol. 14, pp. 259–280, Oct.—Dec. 1978.
    • (1978) Probl. Inform. Trans. , vol.14 , pp. 259-280
    • Tsybakov, B.S.1    Mikhailov, V.A.2
  • 10
    • 0018812347 scopus 로고
    • Multiple access with reservation
    • Jan.—Mar
    • B. S. Tsybakov and M. A. Burkovskii, “Multiple access with reservation,” Probl. Inform. Trans., vol. 16, pp. 35–54, Jan.—Mar. 1980.
    • (1980) Probl. Inform. Trans. , vol.16 , pp. 35-54
    • Tsybakov, B.S.1    Burkovskii, M.A.2


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