The maximum number of minimal codewords in long codes

• المؤلفون الرئيسيون: Alahmadi, A., Aldred, R. E. L., de la Cruz, R., Solé, P., Thomassen, C.
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2013
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/99215; http://hdl.handle.net/10220/17374
• المؤسسة: Nanyang Technological University

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...