The maximum number of minimal codewords in an [n,k]-code
Abstract
Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of n and k. An application to graphs with many cycles is given.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.