The maximum number of minimal codewords in long codes

The maximum number of minimal codewords in long codes

Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provides lower bounds. In this paper, we compare these bounds with analogous bounds for the cycle code of graphs. This problem (in the graphic case) was considered in 1981 by En...

Full description

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/99215
http://hdl.handle.net/10220/17374
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English

Internet

https://hdl.handle.net/10356/99215
http://hdl.handle.net/10220/17374

Similar Items