Related papers: Convolutional Codes Derived From Group Character C…
One central theme in quantum error-correction is to construct quantum codes that have a large minimum distance. In this paper, we first present a construction of classical codes based on certain class of polynomials. Through these classical…
In the recent paper entitled "Explicit constructions of MDS self-dual codes" accepted in { IEEE Transactions on Information Theory}, doi: 10.1109/TIT.2019.2954877, the author has constructed families of MDS self-dual codes from genus zero…
Lenstra and Guruswami described number field analogues of the algebraic geometry codes of Goppa. Recently, the first author and Oggier generalised these constructions to other arithmetic groups: unit groups in number fields and orders in…
Poulin, Tillich, and Ollivier discovered an important separation between the classical and quantum theories of convolutional coding, by proving that a quantum convolutional encoder cannot be both non-catastrophic and recursive.…
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…
A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Moreover, a construction of…
We introduce a unified ensemble for turbo-like codes (TCs) that contains the four main classes of TCs: parallel concatenated codes, serially concatenated codes, hybrid concatenated codes, and braided convolutional codes. We show that for…
In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…
This paper is devoted to the study of the construction of new quantum MDS codes. Based on constacyclic codes over Fq2 , we derive four new families of quantum MDS codes, one of which is an explicit generalization of the construction given…
In this paper, we construct new sequences of asymptotically good convolutional codes. These sequences are obtained from sequences of transitive, self-orthogonal and self-dual block codes that attain the Tsfasman-Vladut-Zink bound.…
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…
We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For codes of length $n$ with $r\approx n^\alpha, 0\le\alpha\le 1$ the code alphabet is of the order $n^{1+3\alpha},$ which improves upon the…
Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…
We present a comparison study between a cluster and factor graph representation of LDPC codes. In probabilistic graphical models, cluster graphs retain useful dependence between random variables during inference, which are advantageous in…
Neural codes appear efficient. Naturally, neuroscientists contend that an efficient process is responsible for generating efficient codes. They argue that natural selection is the efficient process that generates those codes. Although…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…
Generative models for source code are an interesting structured prediction problem, requiring to reason about both hard syntactic and semantic constraints as well as about natural, likely programs. We present a novel model for this problem…
Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…