"The maximum number of minimal codewords in an [n, k][n, k]-code."

Adel Alahmadi et al. (2013)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2013.03.023

access: open

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/AlahmadiACST13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/AlahmadiACST13
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an [n, k][n, k]-code. Discret. Math. 313(15): 1569-1574 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.