Carsten Thomassen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Romar dela Cruz

> Home > Persons > Carsten Thomassen

Publications

2015
[j150]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/AlahmadiACOST15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AlahmadiACOST15
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Seongmin Ok, Patrick Solé, Carsten Thomassen:
The minimum number of minimal codewords in an [n, k]-code and in graphic codes. Discret. Appl. Math. 184: 32-39 (2015)
2013
[j142]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/AlahmadiACST13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AlahmadiACST13
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in long codes. Discret. Appl. Math. 161(3): 424-429 (2013)
[j141]
- view
  - electronic edition via DOI (open access)
  - references & citations
  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)
2012
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1201-6043
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1201-6043
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in long codes. CoRR abs/1201.6043 (2012)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1203-0728
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1203-0728
Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an $[n,k]-$code. CoRR abs/1203.0728 (2012)

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.