Using combinatorial optimization to design good unit-memory convolutional codes
暂无分享,去创建一个
[1] E. Paaske,et al. Quasi-cyclic unit memory convolutional codes , 1990, IEEE Trans. Inf. Theory.
[2] John E. MacDonald,et al. Design Methods for Maximum Minimum-Distance Error-Correcting Codes , 1960, IBM J. Res. Dev..
[3] Kung Yao,et al. Systolic array processing of the Viterbi algorithm , 1989, IEEE Trans. Inf. Theory.
[4] Jørn Justesen,et al. Bounds on distances and error exponents of unit memory codes , 1983, IEEE Trans. Inf. Theory.
[5] Lin-nan Lee,et al. Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[6] Tom Verhoeff,et al. An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.