2000 character limit reached
On the maximum number of minimal codewords (2010.10762v1)
Published 21 Oct 2020 in cs.IT, math.CO, and math.IT
Abstract: Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number are presented. We determine the exact values for the case of linear codes of dimension $k$ and length $k+2$ and for small values of the length and dimension. We also give a formula for the number of minimal codewords of linear codes of dimension $k$ and length $k+3$.
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.