Browsing Department of Informatics by Subject "Circulant codes"
Now showing items 1-1 of 1
(Springer, 2010)We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation ...Peer reviewedJournal article