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:
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 |
Similar Items
-
The maximum number of minimal codewords in long codes
by: Alahmadi, A., et al.
Published: (2013) -
On the minimum pseudo-codewords of LDPC codes
by: Xia, S.-T., et al.
Published: (2014) -
Experimental implementation of a codeword-stabilized quantum code
by: Zhang, J., et al.
Published: (2014) -
Average width of balanced codewords
by: Song, Qiumin
Published: (2021) -
Semi-supervised clustering via learnt codeword distances
by: Batra D., et al.
Published: (2018)