Isodual and self-dual codes from graphs
Binary linear codes are constructed from graphs, in particular, by the generator matrix \([I_n | A]\) where \(A\) is the adjacency matrix of a graph on \(n\) vertices. A combinatorial interpretation of the minimum distance of such codes is given. We also present graph theoretic conditions for such l...
Gespeichert in:
| Datum: | 2021 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Lugansk National Taras Shevchenko University
2021
|
| Schlagworte: | |
| Online Zugang: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1645 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Algebra and Discrete Mathematics |