Fault tolerance in computing, compressing, and transmitting FFT data. (English)
IEEE Trans. Commun. 49, No.12, 2095-2105 (2001).
1
Performance limits of compound codes with symbol-based iterative decoding. (English)
Augot, Daniel (ed.) et al., WCC2001 international workshop on coding and cryptography. Paris, France, January 8-12, 2001. Amsterdam: Elsevier, Electron. Notes Discrete Math. 6, no pag., electronic only (2001).
2
A truncated best-path algorithm. (English)
IEEE Trans. Commun. 46, No.5, 568-572 (1998).
3
nd-convolutional codes. II: Structural analysis. (English)
IEEE Trans. Inf. Theory 43, No.2, 576-589 (1997).
4
Two classes of convolutional codes over GF(q) for q-ary orthogonal signaling. (English)
IEEE Trans. Commun. 39, No.1, 30-40 (1991).
5
Asymptotic bit error probability for convolutional codes. (English)
Probl. Inf. Transm. 27, No.3, 261-265 (1991); translation from Probl. Peredachi Inf. 27, No.3, 89-94 (1991).
6
Convolutional codes. An algebraic approach. (English)
Cambridge, MA: MIT Press. xvi, 339 p. \$ 52.95; \sterling 36.95/hbk (1988).
7
Replication decoding. (English)
IEEE Trans. Inf. Theory 25, 332-345 (1979).
8
Symbol synchronization in convolutionally coded systems. (English)
IEEE Trans. Inf. Theory 25, 362-365 (1979).
9
Start
Contact
Print
General Help
