메뉴 건너뛰기




Volumn 24, Issue 1, 1978, Pages 76-80

Efficient Maximum Likelihood Decoding of Linear Block Codes Using a Trellis

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0017922440     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1978.1055821     Document Type: Article
Times cited : (438)

References (11)
  • 1
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • Apr.
    • A. J. Viterbi “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, Apr. 1967.
    • (1967) IEEE Trans. Inform. Theory , vol.IT-13 , pp. 260-269
    • Viterbi, A.J.1
  • 2
    • 0037840788 scopus 로고
    • Coding for a constant data rate source
    • Jan.
    • R. A. Silverman and M. Baiser “Coding for a constant data rate source,” IRE Trans. Inform. Theory, vol. PGIT-4, pp. 50–63, Jan. 1954.
    • (1954) IRE Trans. Inform. Theory , vol.PGIT-4 , pp. 50-63
    • Silverman, R.A.1    Baiser, M.2
  • 3
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar.
    • L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, Mar. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 4
    • 0016998516 scopus 로고
    • On optimum symbol-by-symbol decoding rule for linear codes
    • Sept.
    • C. R. P. Hartmann and L. E. Rudolph “On optimum symbol-by-symbol decoding rule for linear codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 514–517, Sept. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 514-517
    • Hartmann, C.R.P.1    Rudolph, L.E.2
  • 5
    • 0016410298 scopus 로고
    • Decoding algorithm for error-correcting codes by use of analog weights
    • H. Miyakawa and T. Kaneko “Decoding algorithm for error-correcting codes by use of analog weights,” Electron. Commun. Japan, vol. 58-A, pp. 18–27, 1975.
    • (1975) Electron. Commun. Japan , vol.58-A , pp. 18-27
    • Miyakawa, H.1    Kaneko, T.2
  • 6
    • 84941515481 scopus 로고
    • A class of algorithms for decoding block codes with channel measurement information
    • Jan.
    • D. Chase “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 170–182, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 170-182
    • Chase, D.1
  • 7
    • 0015161123 scopus 로고
    • Decoding block codes on Q-ary output channels
    • Nov.
    • E. J. Weldon, Jr. “Decoding block codes on Q-ary output channels,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 713–718, Nov. 1971.
    • (1971) IEEE Trans. Inform. Theory , vol.IT-17 , pp. 713-718
    • Weldon, E.J.1
  • 8
    • 0015614462 scopus 로고
    • Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q > q
    • Apr.
    • S. Wamberg and J. K. Wolf “Algebraic decoding of block codes over a q-ary input, Q-ary output channel, Q > q,” Informat. Contr., vol. 22, pp. 23–247, Apr. 1973.
    • (1973) Informat. Contr. , vol.22 , pp. 23-247
    • Wamberg, S.1    Wolf, J.K.2
  • 9
    • 84942217758 scopus 로고
    • Maximum likelihood decoding of binary group codes for the Gaussian channel
    • presented at IEEE Int. Symp. on Inform. Theory, Noordwijk, The Netherlands
    • B. Dorsch, “Maximum likelihood decoding of binary group codes for the Gaussian channel,” presented at IEEE Int. Symp. on Inform. Theory, Noordwijk, The Netherlands, 1970.
    • (1970)
    • Dorsch, B.1
  • 10
    • 33746350704 scopus 로고
    • Generalized minimum distance decoding
    • Apr.
    • G. D. Forney, Jr. “Generalized minimum distance decoding,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 125–131, Apr. 1966.
    • (1966) IEEE Trans. Inform. Theory , vol.IT-12 , pp. 125-131
    • Forney, G.D.1
  • 11
    • 84943459784 scopus 로고    scopus 로고
    • Maximum likelihood decoding of concatenated constant weight block codes over a Ray-leigh fading channel
    • in preparation
    • P. Pieper, J. Proakis, R. Reed, and J. K. Wolf, “Maximum likelihood decoding of concatenated constant weight block codes over a Ray-leigh fading channel,” in preparation.
    • Pieper, P.1    Proakis, J.2    Reed, R.3    Wolf, J.K.4


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