加载中…
A new generalization of the Gray map is introduced. The new generalization is connected with the known generalized Gray map in the following way: if we take two dual linear -codes and construct binary codes from them using the generalizations and of the Gray map, then the weight enumerators of the binary codes obtained will satisfy the MacWilliams identity. The classes of -linear Hadamard codes and co--linear extended 1-perfect codes are described, where co--linearity means that the code can be obtained from a linear -code with the help of the new generalized Gray map. Keywords: Gray map, Hadamard codes, MacWilliams identity, perfect codes, -linearity

生成讲解博客的中文版本

生成AI智能校验的中文版本