On two-weight $$\mathbb {Z}_{2^k}$$-codes

Designs, Codes and Cryptography(2018)

引用 25|浏览91
暂无评分
摘要
We determine the possible homogeneous weights of regular projective two-weight codes over \(\mathbb {Z}_{2^k}\) of length \(n>3\), with dual Krotov distance \(d^{\lozenge }\) at least four. The determination of the weights is based on parameter restrictions for strongly regular graphs applied to the coset graph of the dual code. When \(k=2\), we characterize the parameters of such codes as those of the inverse Gray images of \(\mathbb {Z}_4\)-linear Hadamard codes, which have been characterized by their types by several authors.
更多
查看译文
关键词
Two-weight code,Generalized Gray map,Strongly regular graph,94B05,05C50,05E30,11T71
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要