New classes of binary codes constructed on the basis of concatenated codes and product codes
暂无分享,去创建一个
Masao Kasahara | Shigeichi Hirasawa | Yasuo Sugiyama | Toshihiko Namekawa | M. Kasahara | T. Namekawa | S. Hirasawa | Y. Sugiyama
[1] Masao Kasahara,et al. Further results on Goppa codes and their applications to constructing efficient binary codes , 1976, IEEE Trans. Inf. Theory.
[2] Harry T. Hsu. A Class of Binary Shortened Cyclic Codes for a Compound Channel , 1971, Inf. Control..
[3] Robert T. Chien,et al. Algebraic generalization of BCH-Goppa-Helgert codes , 1975, IEEE Trans. Inf. Theory.
[4] Sudhakar M. Reddy,et al. A (48, 31, 8) linear code (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[5] Hermann J. Helgert,et al. Minimum-distance bounds for binary linear codes , 1973, IEEE Trans. Inf. Theory.
[6] Masao Kasahara,et al. A new class of binary codes constructed on the basis of BCH codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[7] N. J. A. Sloane,et al. New binary codes , 1972, IEEE Trans. Inf. Theory.
[8] Masao Kasahara,et al. Some efficient binary codes constructed using Srivastava codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[9] Elwyn R. Berlekamp,et al. Some long cyclic linear binary codes are not so bad , 1974, IEEE Trans. Inf. Theory.
[10] Trieu-Kien Truong,et al. Convolutions over residue classes of quadratic integers , 1976, IEEE Trans. Inf. Theory.
[11] N. J. A. Sloane,et al. A survey of constructive coding theory, and a table of binary codes of highest known rate , 1972, Discret. Math..
[12] Tadao Kasami,et al. Error-correcting codes for a compound channel , 1968, IEEE Trans. Inf. Theory.
[13] Morris Goldberg,et al. Augmentation techniques for a class of product codes , 1973, IEEE Trans. Inf. Theory.
[14] Hermann J. Helgert,et al. Shortened BCH codes (Corresp.) , 1973, IEEE Trans. Inf. Theory.
[15] P. Pire. Good block codes derived from cyclic codes , 1974 .