-
1
-
-
34648871269
-
-
1992. pp. 3.4.3.1-3.4.3.7.
-
T. Berman, J. Freedman, and T. Kaplan, ́An analytic analysis of a concatenated Reed-Solomon (RS)/Viterbi coding system both with and without RS interleaving,́ in Proc. IPCCC'92. Scottsdale, AZ, 1992. pp. 3.4.3.1-3.4.3.7.
-
J. Freedman, and T. Kaplan, ́An Analytic Analysis of a Concatenated Reed-Solomon (RS)/Viterbi Coding System both with and without RS Interleaving,́ in Proc. IPCCC'92. Scottsdale, AZ
-
-
Berman, T.1
-
2
-
-
34648842657
-
-
26, no. 4, pp. 3-15, 1990.
-
M. V. Burnashev, and D. L. Cohn, ́Symbol error probability for convolutional codes,́ Probl. Peredaci Inform., vol. 26, no. 4, pp. 3-15, 1990.
-
And D. L. Cohn, ́Symbol Error Probability for Convolutional Codes,́ Probl. Peredaci Inform., Vol.
-
-
Burnashev, M.V.1
-
3
-
-
0024925529
-
-
16 PSK,́ in Proc. GLOBECOM'89, Dallas, TX, pp. 1528-1533.
-
K. Fazel, ́Application of error modeling at the output of maximum likelihood decoder to concatenated coded 16 PSK,́ in Proc. GLOBECOM'89, Dallas, TX, pp. 1528-1533.
-
́Application of Error Modeling at the Output of Maximum Likelihood Decoder to Concatenated Coded
-
-
Fazel, K.1
-
4
-
-
84915005479
-
-
368-372, July 1970.
-
M. E. Hellman, and J. Raviv, ́Probability of error, equivocation, and the Chernoff bound,́ IEEE Trans. Inform. Theory, vol. IT-16, pp. 368-372, July 1970.
-
And J. Raviv, ́Probability of Error, Equivocation, and the Chernoff Bound,́ IEEE Trans. Inform. Theory, Vol. IT-16, Pp.
-
-
Hellman, M.E.1
-
5
-
-
0016534174
-
-
464-4168, July 1975.
-
R. Johannesson, ́Robust optimal rate one-half binary convolutional codes,́ IEEE Trans. Inform. Theory, vol. IT-21, pp. 464-4168, July 1975.
-
́Robust Optimal Rate One-half Binary Convolutional Codes,́ IEEE Trans. Inform. Theory, Vol. IT-21, Pp.
-
-
Johannesson, R.1
-
6
-
-
0028515621
-
-
40, pp. 1459-1473, Nov. 1994.
-
A. Lapidoth, ́The performance of convolutional codes on the block erasure channel using various finite interleaving techniques,́ IEEE Trans. Inform. Theory, vol. 40, pp. 1459-1473, Nov. 1994.
-
́The Performance of Convolutional Codes on the Block Erasure Channel Using Various Finite Interleaving Techniques,́ IEEE Trans. Inform. Theory, Vol.
-
-
Lapidoth, A.1
-
7
-
-
38349109190
-
-
1994/95, ETH, Zurich, Switzerland.
-
J. Massey, Applied Digital Information Theory, course notes for the Winter semester 1994/95, ETH, Zurich, Switzerland.
-
Applied Digital Information Theory, Course Notes for the Winter Semester
-
-
Massey, J.1
-
8
-
-
0024719046
-
-
7, pp. 929-940, Aug. 1989.
-
M. Rouanne and D. J. Costello, ́An algorithm for computing the distance spectrum of trellis codes,́ IEEE J. Select. Areas Commun., vol. 7, pp. 929-940, Aug. 1989.
-
́An Algorithm for Computing the Distance Spectrum of Trellis Codes,́ IEEE J. Select. Areas Commun., Vol.
-
-
Rouanne, M.1
Costello, D.J.2
-
10
-
-
0023314931
-
-
196-202, Mar. 1987.
-
E. Zehavi and J. K. Wolf, ́On the performance evaluation of trellis codes,́ IEEE Trans. Inform. Theory, vol. IT-33, pp. 196-202, Mar. 1987.
-
́On the Performance Evaluation of Trellis Codes,́ IEEE Trans. Inform. Theory, Vol. IT-33, Pp.
-
-
Zehavi, E.1
Wolf, J.K.2
|