Mathematics – Combinatorics
Scientific paper
2009-02-23
Des. Codes Cryptogr. 59, pp. 119-130, 2011
Mathematics
Combinatorics
Presented at International Workshop on Coding and Cryptography (WCC 2009), 10-15 May 2009, Ullensvang, Norway. (14 pages, 2 fi
Scientific paper
10.1007/s10623-010-9469-6
We show that (n,2^n) 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 reduces the complexity of code classification, and enables us to classify additive (n,2^n) codes over GF(4) of length up to 7. From this we also derive classifications of isodual and formally self-dual codes. We introduce new constructions of circulant and bordered circulant directed graph codes, and show that these codes will always be isodual. A computer search of all such codes of length up to 26 reveals that these constructions produce many codes of high minimum distance. In particular, we find new near-extremal formally self-dual codes of length 11 and 13, and isodual codes of length 24, 25, and 26 with better minimum distance than the best known self-dual codes.
Danielsen Lars Eirik
Parker Matthew G.
No associations
LandOfFree
Directed Graph Representation of Half-Rate Additive Codes over GF(4) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Directed Graph Representation of Half-Rate Additive Codes over GF(4), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed Graph Representation of Half-Rate Additive Codes over GF(4) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-584550