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

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

We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.

Saved in:
Bibliographic Details
Main Authors: Alahmadi, A., Aldred, R. E. L., de la Cruz, R., Solé, P., Thomassen, C.
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2013
Online Access:https://hdl.handle.net/10356/99324
http://hdl.handle.net/10220/17375
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:We survey some upper and lower bounds on the function in the title, and make them explicit for n≤15 and 1≤k≤15. Exact values are given for cycle codes of graphs for 3≤n≤15 and 1≤k≤13.

Similar Items