2000 character limit reached
How many weights can a linear code have ? (1802.00148v2)
Published 1 Feb 2018 in cs.IT and math.IT
Abstract: We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general case when both $k$ and $q$ are $\ge 3.$ A refinement $L(n,k,q),$ as well as nonlinear analogues $N(M,q)$ and $N(n,M,q),$ are also introduced and studied.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
