Skip to main content.

Introduction

This is a database of half-rate additive codes over GF(4). We have shown that all such codes (except a few degenerate cases) can be represented as directed graphs. For more details, see the paper [1].

^ TOP

Tables

Total number of (non-degenerate [1] and non-decomposable) half-rate additive codes over GF(4) of length n and minimum distance d:

d\n123456
114273228509686,531
2132126296531,279,641
319644253,635
413
All274959318,8072,219,810

Number of circulant and bordered circulant directed graph codes with highest minimum distance:

nMax d# Codes
2 21
3 22
4 31
5 33
6 41
7 42
8 411
9 422
1054
11521
1262
1362
14654
156325
1671
1779
1881
1971366
2084
21842
2281328
2388027
2491
25925
2691877
^ TOP

Files

Codes are stored as directed graphs. See the paper [1] for how to convert graphs to codes. Each line in the file is of the format "Graph [tab] Minimum distance". Graphs are stored on the format "#Vertices #Edges (List of directed edges)". For instance, the line "3 3 0 2 2 0 1 2     2" is a directed graph corresponding to a half-rate additive code over GF(4) of length 3 with minimum distance 2. The directed graph has 3 vertices and the 3 directed edges 0->2, 2->0, and 1->2.

All codes of length 2 to 7 are collected in one file.

Download
allcodes.txt

All circulant and bordered circulant codes of length 2 to 26 with highest minimum distance are also collected in one file. (This file does not contain the minimum distance of codes, as these are given in the above table.)

Download
circulant.txt

^ TOP

References

[1] Lars Eirik Danielsen and Matthew G. Parker: Directed graph representation of half-rate additive codes over GF(4). Submitted for publication, Feb. 2009. (arXiv:0902.3883)