메뉴 건너뛰기




Volumn , Issue , 2003, Pages 231-

Joint decoding and phase estimation: An exercise in factor graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); GRAPH THEORY; PROBABILITY DENSITY FUNCTION; SIGNAL FILTERING AND PREDICTION;

EID: 0141938930     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228245     Document Type: Conference Paper
Times cited : (30)

References (4)
  • 3
    • 0141982945 scopus 로고    scopus 로고
    • Least squares and Kalman filtering on Forney graphs
    • (festschrift in honour of David Forney on the occasion of his 60th birthday), R. R. Blahut and r. Koetter, eds., Kluwer
    • H.-A. Loeliger, "Least squares and Kalman filtering on Forney graphs," in Codes, Graphs, and Systems, (festschrift in honour of David Forney on the occasion of his 60th birthday), R. R. Blahut and R. Koetter, eds., Kluwer, 2002, pp. 113-135.
    • (2002) Codes, Graphs, and Systems , pp. 113-135
    • Loeliger, H.-A.1
  • 4
    • 0003846836 scopus 로고    scopus 로고
    • Codes and decoding on general graphs
    • Linköping Studies in Science and Technology, Ph.D. Thesis No. 440, Univ. Linköping, Sweden
    • N. Wiberg, Codes and Decoding on General Graphs. Linköping Studies in Science and Technology, Ph.D. Thesis No. 440, Univ. Linköping, Sweden, 1996.
    • (1996)
    • Wiberg, N.1


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