139,215 research outputs found

    The lengths of Hermitian Self-Dual Extended Duadic Codes

    Get PDF
    Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic code of length n having an Hermitian self-dual parity-check extension. We derive using analytic number theory asymptotic estimates for the number of such n as well as for the number of lengths for which duadic codes exist.Comment: To appear in the Journal of Pure and Applied Algebra. 21 pages and 1 Table. Corollary 4.9 and Theorem 5.8 have been added. Some small changes have been mad

    Cyclic unequal error protection codes constructed from cyclic codes of composite length

    Get PDF
    The distance structure of cyclic codes of composite length was investigated. A lower bound on the minimum distance for this class of codes is derived. In many cases, the lower bound gives the true minimum distance of a code. Then the distance structure of the direct sum of two cyclic codes of composite length were investigated. It was shown that, under certain conditions, the direct-sum code provides two levels of error correcting capability, and hence is a two-level unequal error protection (UEP) code. Finally, a class of two-level UEP cyclic direct-sum codes and a decoding algorithm for a subclass of these codes are presented

    Exploring pure quantum states with maximally mixed reductions

    Full text link
    We investigate multipartite entanglement for composite quantum systems in a pure state. Using the generalized Bloch representation for n-qubit states, we express the condition that all k-qubit reductions of the whole system are maximally mixed, reflecting maximum bipartite entanglement across all k vs. n-k bipartitions. As a special case, we examine the class of balanced pure states, which are constructed from a subset of the Pauli group P_n that is isomorphic to Z_2^n. This makes a connection with the theory of quantum error-correcting codes and provides bounds on the largest allowed k for fixed n. In particular, the ratio k/n can be lower and upper bounded in the asymptotic regime, implying that there must exist multipartite entangled states with at least k=0.189 n when n→∞n\to \infty. We also analyze symmetric states as another natural class of states with high multipartite entanglement and prove that, surprisingly, they cannot have all maximally mixed k-qubit reductions with k>1. Thus, measured through bipartite entanglement across all bipartitions, symmetric states cannot exhibit large entanglement. However, we show that the permutation symmetry only constrains some components of the generalized Bloch vector, so that very specific patterns in this vector may be allowed even though k>1 is forbidden. This is illustrated numerically for a few symmetric states that maximize geometric entanglement, revealing some interesting structures.Comment: 10 pages, 2 figure

    Quantum error-correcting output codes

    Get PDF
    Quantum machine learning is the aspect of quantum computing concerned with the design of algorithms capable of generalized learning from labeled training data by effectively exploiting quantum effects. Error-correcting output codes (ECOC) are a standard setting in machine learning for efficiently rendering the collective outputs of a binary classifier, such as the support vector machine, as a multi-class decision procedure. Appropriate choice of error-correcting codes further enables incorrect individual classification decisions to be effectively corrected in the composite output. In this paper, we propose an appropriate quantization of the ECOC process, based on the quantum support vector machine. We will show that, in addition to the usual benefits of quantizing machine learning, this technique leads to an exponential reduction in the number of logic gates required for effective correction of classification error

    Preliminary Clinical Evaluation of Short Fiber-Reinforced Composite Resin in Posterior Teeth: 12-Months Report

    Get PDF
    This preliminary clinical trial evaluated 12 month clinical performance of novel filling composite resin system which combines short fiber-reinforced composite resin and conventional particulate filler composite resin in high stress bearing applications. A total of 37 class I and II restorations (compound and complex type) were placed in 6 premolars and 31 molars. The restorations were reviewed clinically at 6 months (baseline) and 12 months using modified USPHS codes change criteria for marginal adaptation, post-operative sensitivity, pulpal pain and secondary caries criteria. Photographs and x-rays were obtained for restorative analysis. Results of 12 months evaluation showed 5 restorations having little marginal leakage (B score) and 1 patient had minor pulpal symptom and post-operative sensitivity (B score). No secondary caries or bulk fracture was detected. The majority of restorations exhibited A scores of the evaluated criteria. After 12 months, restorations combining base of short fiber reinforced composite resin as substructure and surface layer of hybrid composite resin displayed promising performance in high load bearing areas
    • …
    corecore