Graphical codes revisited
暂无分享,去创建一个
[1] S. Vanstone,et al. An application of difference sets to a problem concerning graphical codes , 1997 .
[2] Tom Verhoeff,et al. An updated table of minimum-distance bounds for binary linear codes , 1987, IEEE Trans. Inf. Theory.
[3] Patrick Solé,et al. Maximality of the cycle code of a graph , 1994, Discret. Math..
[4] S. Louis Hakimi,et al. Decoding of graph theoretic codes (Corresp.) , 1967, IEEE Trans. Inf. Theory.
[5] S. Louis Hakimi,et al. Cut-set matrices and linear codes (Corresp.) , 1965, IEEE Transactions on Information Theory.
[6] S. Vanstone,et al. Codes based on complete graphs , 1996 .
[7] Kevin T. Phelps,et al. The existence of simple S3(3, 4, v) , 1989, Discret. Math..
[8] S. Vanstone,et al. An application of coding theory to a problem in graphical enumeration , 1995 .
[9] Haluk Oral. Constructing self-dual codes using graphs , 1991, J. Comb. Theory, Ser. B.
[10] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[11] Scott A. Vanstone,et al. On resolvable designs S3(3; 4, v) , 1986, J. Comb. Theory, Ser. A.
[12] Patrick Solé,et al. The Covering Radius of the Cycle Code of a Graph , 1993, Discret. Appl. Math..
[13] S. Louis Hakimi,et al. Graph theoretic q -ary codes (Corresp.) , 1971, IEEE Trans. Inf. Theory.
[14] S. Louis Hakimi,et al. Graph theoretic error-correcting codes , 1968, IEEE Trans. Inf. Theory.
[15] L. S. Bobrow,et al. Decoding augmented cutset codes (Corresp.) , 1971, IEEE Trans. Inf. Theory.
[16] Thomas Zaslavsky,et al. A Coding Approach to Signed Graphs , 1994, SIAM J. Discret. Math..
[17] S. Louis Hakimi,et al. Ternary graph theoretic error-correcting codes (Corresp.) , 1969, IEEE Trans. Inf. Theory.
[18] S. Louis Hakimi,et al. On the complexity of some coding problems , 1981, IEEE Trans. Inf. Theory.