The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes
暂无分享,去创建一个
[1] P. Camion,et al. Coset Weight Enumerators of the Extremal Self-Dual Binary Codes of Length 32 , 1993 .
[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[3] Torleiv Kløve,et al. The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N) , 1977, Discret. Math..
[4] John T. Coffey,et al. Trellis Structure and Higher Weights of Extremal Self-Dual Codes , 2001, Des. Codes Cryptogr..
[5] Nikolai L. Manev,et al. An improvement of the Griesmer bound for some small minimum distances , 1985, Discret. Appl. Math..
[6] G. David Forney,et al. Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.
[7] D. G. Hoffman. Linear codes and weights , 1993, Australas. J Comb..
[8] John H. Conway,et al. On the Enumeration of Self-Dual Codes , 1980, J. Comb. Theory, Ser. A.
[9] Torleiv Kløve,et al. Support weight distribution of linear codes , 1992, Discret. Math..
[10] Juriaan Simonis,et al. The effective length of subcodes , 1994, Applicable Algebra in Engineering, Communication and Computing.
[11] Helmut Koch. On self-dual, doubly even codes of length 32 , 1989, J. Comb. Theory, Ser. A.
[12] Victor K.-W. Wei,et al. Generalized Hamming weights for linear codes , 1991, IEEE Trans. Inf. Theory.