메뉴 건너뛰기




Volumn 42, Issue 6 PART 2, 1996, Pages 2221-2228

A simple class of capacity-achieving strategies for discrete memoryless channels with feedback

Author keywords

Capacity; Constrained sequences; Discrete memoryless channel; Feedback; Repetition strategy

Indexed keywords


EID: 33747353124     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556610     Document Type: Article
Times cited : (3)

References (14)
  • 1
    • 0015066737 scopus 로고
    • A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback
    • May
    • J. P. M. Schalkwijk, "A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback," IEEE Trans. Inform. Theory, vol. IT-17, no. 3, pp. 283-287, May 1971.
    • (1971) IEEE Trans. Inform. Theory , vol.IT-17 , Issue.3 , pp. 283-287
    • Schalkwijk, J.P.M.1
  • 2
    • 0015650852 scopus 로고
    • On the error probability for a class of binary recursive feedback strategies
    • July
    • J. P. M. Schalkwijk and K. A. Post, "On the error probability for a class of binary recursive feedback strategies," IEEE Trans. Inform. Theory, vol. IT-19, no. 4, pp. 498-511, July 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , Issue.4 , pp. 498-511
    • Schalkwijk, J.P.M.1    Post, K.A.2
  • 3
    • 84939051589 scopus 로고
    • Sequential transmission using noiseless feedback
    • July
    • M. Horstein, "Sequential transmission using noiseless feedback," IEEE Trans. Inform. Theory, vol. IT-9, pp. 136-143, July 1963.
    • (1963) IEEE Trans. Inform. Theory , vol.IT-9 , pp. 136-143
    • Horstein, M.1
  • 4
    • 0015943124 scopus 로고
    • Convolutional codes II. Maximum-likelihood decoding
    • G. D. Forney, Jr., "Convolutional codes II. Maximum-likelihood decoding," Inform. Contr., vol. 25, pp. 222-266, 1974.
    • (1974) Inform. Contr. , vol.25 , pp. 222-266
    • Forney Jr., G.D.1
  • 5
    • 0015022927 scopus 로고
    • Lower bounds on reliability functions of variable-length nonsystematic convolutional codes for channels with noiseless feedback
    • Mar.
    • R. J. F. Fang, "Lower bounds on reliability functions of variable-length nonsystematic convolutional codes for channels with noiseless feedback," IEEE Trans. Inform. Theory, vol. IT-17, no. 2, pp. 161-171, Mar. 1971.
    • (1971) IEEE Trans. Inform. Theory , vol.IT-17 , Issue.2 , pp. 161-171
    • Fang, R.J.F.1
  • 6
    • 84894354977 scopus 로고
    • New exponential upper bounds to error and erasure probabilities
    • Trondheim, Norway, June
    • E. Telatar and R. G. Gallager, "New exponential upper bounds to error and erasure probabilities," in 1994 IEEE Int. Symp. on Information Theory Trondheim, Norway, June 1994), p. 379.
    • (1994) 1994 IEEE Int. Symp. on Information Theory , pp. 379
    • Telatar, E.1    Gallager, R.G.2
  • 7
    • 84934904905 scopus 로고
    • Exponential error bounds for erasure, list and decision feedback schemes
    • Mar.
    • G. D. Forney, Jr., "Exponential error bounds for erasure, list and decision feedback schemes," IEEE Trans. Inform. Theory, vol. IT-14, no. 2, pp. 206-220, Mar. 1968.
    • (1968) IEEE Trans. Inform. Theory , vol.IT-14 , Issue.2 , pp. 206-220
    • Forney Jr., G.D.1
  • 8
    • 0027663483 scopus 로고
    • Error probability for repeat request systems with convolutional codes
    • Sept.
    • B. D. Kudryashov, "Error probability for repeat request systems with convolutional codes," IEEE Trans. Inform. Theory, vol. 39, no. 5, pp. 1680-1684, Sept. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , Issue.5 , pp. 1680-1684
    • Kudryashov, B.D.1
  • 9
    • 0018542439 scopus 로고
    • Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback
    • Nov.
    • H. Yamamoto and K. Itoh, "Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback," IEEE Trans. Inform. Theory, vol. 25, no. 6, pp. 729-733, Nov. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.25 , Issue.6 , pp. 729-733
    • Yamamoto, H.1    Itoh, K.2
  • 11
    • 33747349130 scopus 로고
    • Some geometrical results in channel capacity
    • C. E. Shannon, "Some geometrical results in channel capacity," Nachrichtentech. Z., vol. 10, 1957.
    • (1957) Nachrichtentech. Z. , vol.10
    • Shannon, C.E.1
  • 12
    • 0015287895 scopus 로고
    • An algorithm for computing the capacity of arbitrary discrete memoryless channels
    • Jan.
    • S. Arimoto, "An algorithm for computing the capacity of arbitrary discrete memoryless channels," IEEE Trans. Inform. Theory, vol. IT-18, no. 1, pp. 14-20, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , Issue.1 , pp. 14-20
    • Arimoto, S.1
  • 13
    • 0015376113 scopus 로고
    • Computation of channel capacity and rate-distortion functions
    • July
    • R. E. Blahut, "Computation of channel capacity and rate-distortion functions," IEEE Trans. Inform. Theory, vol. IT-18, no. 4, pp. 460-473, July 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , Issue.4 , pp. 460-473
    • Blahut, R.E.1


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