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...
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: | Journal Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/99215 http://hdl.handle.net/10220/17374 |
Similar Items
-
The maximum number of minimal codewords in an [n,k]-code
by: Alahmadi, A., et al.
Published: (2013) -
Average width of balanced codewords
by: Song, Qiumin
Published: (2021) -
Effect of pad codewords modification on JAKIM halal logo size
by: Rohani, Fuaad, et al.
Published: (2014) -
On the number of inductively minimal geometries
by: Cara, Philippe, et al.
Published: (2013) -
PAPR reduction using selected codeword shift (SCS) technique and SCS-SLM technique for space time coding MIMO-OFDM / Ezmin Abdullah
by: Abdullah, Ezmin
Published: (2017)