218 research outputs found

    Directed Graph Representation of Half-Rate Additive Codes over GF(4)

    Get PDF
    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.Comment: Presented at International Workshop on Coding and Cryptography (WCC 2009), 10-15 May 2009, Ullensvang, Norway. (14 pages, 2 figures

    New self-dual additive F4\mathbb{F}_4-codes constructed from circulant graphs

    Full text link
    In order to construct quantum [[n,0,d]][[n,0,d]] codes for (n,d)=(56,15)(n,d)=(56,15), (57,15)(57,15), (58,16)(58,16), (63,16)(63,16), (67,17)(67,17), (70,18)(70,18), (71,18)(71,18), (79,19)(79,19), (83,20)(83,20), (87,20)(87,20), (89,21)(89,21), (95,20)(95,20), we construct self-dual additive F4\mathbb{F}_4-codes of length nn and minimum weight dd from circulant graphs. The quantum codes with these parameters are constructed for the first time.Comment: 11 page

    Graph-Based Classification of Self-Dual Additive Codes over Finite Fields

    Full text link
    Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over GF(4). In this paper we classify self-dual additive codes over GF(9), GF(16), and GF(25). Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over GF(9) by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations.Comment: 20 pages, 13 figure

    Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform

    Full text link
    We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity and structure of some graphs that correspond to codes with high distance. The codes can also be interpreted as quadratic Boolean functions, where inequivalence takes on a spectral meaning. In this context we define PAR_IHN, peak-to-average power ratio with respect to the {I,H,N}^n transform set. We prove that PAR_IHN of a Boolean function is equivalent to the the size of the maximum independent set over the associated orbit of graphs. Finally we propose a construction technique to generate Boolean functions with low PAR_IHN and algebraic degree higher than 2.Comment: Presented at Sequences and Their Applications, SETA'04, Seoul, South Korea, October 2004. 17 pages, 10 figure

    New Qubit Codes from Multidimensional Circulant Graphs

    Full text link
    Two new qubit stabilizer codes with parameters [77,0,19]2[77, 0, 19]_2 and [90,0,22]2[90, 0, 22]_2 are constructed for the first time by employing additive symplectic self-dual \F_4 codes from multidimensional circulant (MDC) graphs. We completely classify MDC graph codes for lengths 4≤n≤404\le n \le 40 and show that many optimal \dsb{\ell, 0, d} qubit codes can be obtained from the MDC construction. Moreover, we prove that adjacency matrices of MDC graphs have nested block circulant structure and determine isomorphism properties of MDC graphs
    • …
    corecore