Non-projective two-weight codes
Combinatorics
2024-02-29 v2 Information Theory
math.IT
Abstract
It has been known since the 1970's that the difference of the non-zero weights of a projective -linear two-weight has to be a power of the characteristic of the underlying field. Here we study non-projective two-weight codes and e.g.\ show the same result under mild extra conditions. For small dimensions we give exhaustive enumerations of the feasible parameters in the binary case.
Keywords
Cite
@article{arxiv.2402.16643,
title = {Non-projective two-weight codes},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:2402.16643},
year = {2024}
}
Comments
27 pages, 14 tables, appendix on parameters of projective two-weight codes added