共 21 条
[1]
Berrou C., Glavieux A., Thitimajshima P., pp. 1064-1070, (1993)
[2]
Gallager R.G., Low‐density parity‐check codes, IEEE Transactions on Information Theory, 8, pp. 21-28, (1962)
[3]
Zyablov V.V., Pinsker M.S., Estimation of the error‐correction complexity of Gallager low‐density codes, Probl. Peredach. Inform., 11, pp. 23-36, (1975)
[4]
Tanner R.M., A recursive approach to low complexity codes, IEEE Transactions on Information Theory, 27 IT, pp. 533-547, (1981)
[5]
Forney G.D., The Viterbi algorithm, Proc. IEEE, 61, pp. 268-278, (1973)
[6]
Bahl L.R., Cocke J., Jelinek F., Raviv J., Optimal decoding of linear codes for minimizing symbol error rate, IEEE Transactions on Information Theory, 20 IT, pp. 284-287, (1974)
[7]
Hagenauer J., Papke L., (1994)
[8]
Peterson W.W., Weldon E.J., Error‐correcting codes, (1972)
[9]
Willems J.C., Models for dynamics, Dynamics Reported, 2, pp. 171-269, (1989)
[10]
Loeliger H.-A., Forney G.D., Mittelholier T., Trott M.D., Minimality and observability of group svstems, Linear Algebra & Appl., 205-206, pp. 937-963, (1994)