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

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

2012-03-04

arxiv.org/abs/1203.0728v1

Computer Science

Information Theory

6 pp. Submitted

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The maximum number of minimal codewords in an $[n,k]-$code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The maximum number of minimal codewords in an $[n,k]-$code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The maximum number of minimal codewords in an $[n,k]-$code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-331528