Minimal trellis design for linear codes based on the Shannon product
暂无分享,去创建一个
[1] John Cocke,et al. Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[2] Jack K. Wolf,et al. Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.
[3] P. Farrell,et al. Generalised array codes and their trellis structure , 1993 .
[4] Rolf Johannesson,et al. A linear algebra approach to minimal convolutional encoders , 1993, IEEE Trans. Inf. Theory.
[5] Douglas J. Muder. Minimal trellises for block codes , 1988, IEEE Trans. Inf. Theory.
[6] Gregory S. Lauer. Some optimal partial-unit-memory codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[7] Robert J. McEliece,et al. The trellis complexity of convolutional codes , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[8] Robert J. McEliece,et al. On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.
[9] Garik Markarian,et al. Low-complexity trellis decoding of linear block codes , 1995 .
[10] Kumar N. Sivarajan,et al. Performance limits for channelized cellular telephone systems , 1994, IEEE Trans. Inf. Theory.
[11] Garik Markarian,et al. Code Trellises and the Shannon Product , 1995 .
[12] G. David Forney,et al. Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.
[13] Frank R. Kschischang,et al. On the trellis structure of block codes , 1994, IEEE Trans. Inf. Theory.
[14] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[15] Vladimir Sidorenko,et al. Decoding of convolutional codes using a syndrome trellis , 1994, IEEE Trans. Inf. Theory.