New binary linear block codes
暂无分享，去创建一个
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a greater minimum distance than any previously known binary code of the same length and dimension [8]. A detailed description of one of the constructions is given.
[1] Tom Verhoeff,et al. An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.
[2] Wil J. van Gils,et al. Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes , 1983, IEEE Trans. Inf. Theory.
[3] Harold F. Mattson,et al. On weights in quadratic-residue codes , 1972, Discret. Math..