The maximum number of minimal codewords in an [n,k]−[n,k]-code

preprint2012arXivOpen access

Abstract

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of nn and k.k. An application to graphs with many cycles is given.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.