Related papers: Cumulative-Separable Codes
In this paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…
Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…
Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…
We obtain an upper bound on the number of extended irreducible q-ary Goppa codes of degree $r$ and length $q^n+1$, where $q=p^t$ and $n$ and $r>2$ are prime numbers.
Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…
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…
Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al \cite{DLX} introduced cyclic codes $\mho(q,m,h)$ and $\bar\mho(q,m,h)$ over $\mathbb{F}_q$ as new generalization and version of the punctured…
For $q=p^m$ with $p$ prime and $k\mid q-1$, we consider the generalized Paley graph $\Gamma(k,q) = Cay(\mathbb{F}_q, R_k)$, with $R_k=\{ x^k : x \in \mathbb{F}_q^* \}$, and the irreducible $p$-ary cyclic code $\mathcal{C}(k,q) =…
Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C nor its…
In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
Let $n (>3)$ be a prime number and $\Bbb F_{2^n}$ a finite field of $2^n$ elements. Let $L =\Bbb F_{2^n}\cup \{\infty\}$ be the support set and $g(x)$ an irreducible polynomial of degree $6$ over $\Bbb F_{2^n}$. In this paper, we obtain an…
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…
Given any linear code $C$ over a finite field $GF(q)$ we show how $C$ can be described in a transparent and geometrical way by using the associated Bruen-Silverman code. Then, specializing to the case of MDS codes we use our new approach to…
For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…
We consider codes over the alphabet Q={0,1,..,q-1}intended for the control of unidirectional errors of level l. That is, the transmission channel is such that the received word cannot contain both a component larger than the transmitted one…
The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two…