Related papers: Concatenated Conjugate Codes
The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…
Networks of chaotic coupled maps are considered as string and language generators. It is shown that such networks can be used as encrypting systems where the ciphertext contains information about the evolution of the network and also about…
In this paper, we highlight the class of spatially coupled codes and discuss their applicability to long-haul and submarine optical communication systems. We first demonstrate how to optimize irregular spatially coupled LDPC codes for their…
As in classical coding theory, quantum analogues of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the Calderbank-Shor-Steane (CSS) construction. However,…
We present several quantum public-key encryption (QPKE) protocols designed with conjugate coding single-photon string, thus may be realized in laboratory with nowadays techniques. Two of these schemes are orienting one-bit message, and are…
This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…
A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.
We show that, for $N$ parallel input states, an anti-linear map with respect to a specific basis is essentially a classical operator. We also consider the information contained in phase-conjugate pairs $|\phi > |\phi^*>$, and prove that…
Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECC). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and…
The relation between stabilizer codes and binary codes provided by Gottesman and Calderbank et al. is a celebrated result, as it allows the lifting of classical codes to quantum codes. An equivalent way to state this result is that the work…
We introduce the concept of a Girard couple, which consists of two (not necessarily unital) quantales linked by a strong form of duality. The two basic examples of Girard couples arise in the study of endomorphism quantales and of the…
Symbol-pair codes are block codes with symbol-pair metrics designed to protect against pair-errors that may occur in high-density data storage systems. MDS symbol-pair codes are optimal in the sense that it can attain the highest pair-error…
Computing the closed convex envelope or biconjugate is the core operation that bridges the domain of nonconvex with convex analysis. We focus here on computing the conjugate of a bivariate piecewise quadratic function defined over a…
Following the successful prediction of an exact value for the fine structure constant later confirmed to differ numerically from the centre value of the latest experimental recommended CODATA range by 10^{-12}, further analysis and…
A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets…