105,617 research outputs found

    Fourier-Reflexive Partitions and MacWilliams Identities for Additive Codes

    Full text link
    A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition coincides the primal partition. Such partitions permit MacWilliams identities for the partition enumerators of additive codes. It is shown that dualization commutes with taking products and symmetrized products of partitions on cartesian powers of the given group. After translating the results to Frobenius rings, which are identified with their character module, the approach is applied to partitions that arise from poset structures

    Quantum Error Correction via Codes over GF(4)

    Get PDF
    The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.Comment: Latex, 46 pages. To appear in IEEE Transactions on Information Theory. Replaced Sept. 24, 1996, to correct a number of minor errors. Replaced Sept. 10, 1997. The second section has been completely rewritten, and should hopefully be much clearer. We have also added a new section discussing the developments of the past year. Finally, we again corrected a number of minor error

    Cyclotomic Constructions of Skew Hadamard Difference Sets

    Get PDF
    We revisit the old idea of constructing difference sets from cyclotomic classes. Two constructions of skew Hadamard difference sets are given in the additive groups of finite fields using unions of cyclotomic classes of order N=2p1mN=2p_1^m, where p1p_1 is a prime and mm a positive integer. Our main tools are index 2 Gauss sums, instead of cyclotomic numbers.Comment: 15 pages; corrected a few typos; to appear in J. Combin. Theory (A

    On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers

    Get PDF
    We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is related to the evaluation of the Jones and Tutte polynomials. We consider the connection between the weight enumerator polynomial from coding theory and Z and exploit the fact that there exists a quantum algorithm for efficiently estimating Gauss sums in order to obtain the weight enumerator for a certain class of linear codes. In this way we demonstrate that for a certain class of sparse graphs, which we call Irreducible Cyclic Cocycle Code (ICCC_\epsilon) graphs, quantum computers provide a polynomial speed up in the difference between the number of edges and vertices of the graph, and an exponential speed up in q, over the best classical algorithms known to date
    • …
    corecore