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) -
Comparing minimum codeword distances and error performance for index modulation and maximum distance separable coded modulation
by: Yarkin, F, et al.
Published: (2022) -
On concentric spherical codes and permutation codes with multiple initial codewords
by: Nguyen, Ha Quy, et al.
Published: (2010) -
Average width of balanced codewords
by: Song, Qiumin
Published: (2021) -
ℓp-norms of codewords from capacity- and dispersion-achieveing Gaussian codes
by: Polyanskiy, Yury
Published: (2013)