English
Related papers

Related papers: Triple cyclic codes over $\mathbb{Z}_2$

200 papers

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\mathbb{F}_{p^m}[u]/\langle u^2\rangle=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is an odd prime and $m$ is a positive integer. For any $\alpha,\beta\in…

Information Theory · Computer Science 2015-11-11 Yuan Cao , Qingguo Li

Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…

Information Theory · Computer Science 2013-01-25 Zhengchun Zhou , Aixian Zhang , Cunsheng Ding , Maosheng Xiong

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

Combinatorics · Mathematics 2019-04-10 Xiaoni Du , Rong Wang , Cuiling Fan

We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…

Information Theory · Computer Science 2023-01-03 Reza Dastbasteh , Khalil Shivji

Z2Z4-additive codes have been defined as a subgroup of Z2^{r} x Z4^{s} in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set…

Information Theory · Computer Science 2017-11-07 Ismail Aydogdu , Fatmanur Gursoy

Cyclic orbit codes are constant dimension subspace codes that arise as the orbit of a cyclic subgroup of the general linear group acting on subspaces in the given ambient space. With the aid of the largest subfield over which the given…

Information Theory · Computer Science 2014-03-06 Heide Gluesing-Luerssen , Katherine Morrison , Carolyn Troha

Let $\mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k$ is an integer satisfying $k\geq 2$. For any odd…

Information Theory · Computer Science 2019-10-08 Yonglin Cao , Yuan Cao , Fang-Wei Fu

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…

Information Theory · Computer Science 2017-07-17 Bocong Chen , Hongwei Liu

We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data symbols using bitwise XOR and cyclic shift operations. The…

Information Theory · Computer Science 2016-05-04 Christian Schindelhauer , Andreas Jakoby , Sven Köhler

In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.

Information Theory · Computer Science 2014-04-09 Yan Liu

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

Information Theory · Computer Science 2024-12-03 Cunsheng Ding

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

A coding lattice $\Lambda_c$ and a shaping lattice $\Lambda_s$ forms a nested lattice code $\mathcal{C}$ if $\Lambda_s \subseteq \Lambda_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This…

Information Theory · Computer Science 2024-05-10 Chengpin Luo , Brian M. Kurkoski

In this work, a unique set of generators for a cyclic code over a finite chain ring has been established. The minimal spanning set and rank of the code have also been determined. Further, sufficient as well as necessary conditions for a…

Information Theory · Computer Science 2023-03-29 Monika Dalal , Sucheta Dutt , Ranjeet Sehmi

Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s).$ In this paper, the trace representation of any free cyclic $\texttt{R}$-linear code of length $\ell,$ is presented, via the $q$-cyclotomic cosets modulo $\ell,$ when…

Information Theory · Computer Science 2017-02-06 Alexandre Fotue Tabue , Christophe Mouaha

LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…

Information Theory · Computer Science 2016-08-08 Cem Güneri , Buket Özkaya , Patrick Solé

Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages…

Information Theory · Computer Science 2017-04-25 Ismail Aydogdu

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…

Information Theory · Computer Science 2026-01-21 Kanat Abdukhalikov , Askar S. Dzhumadil'daev , San Ling

We construct a class of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes generated by pairs of polynomials, study their algebraic structures, and obtain the generator matrix of any code in the class. Using a probabilistic method, we prove…

Information Theory · Computer Science 2019-11-22 Yun Fan , Hualu Liu

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…

Information Theory · Computer Science 2013-07-09 Jian Gao , Fang-Wei Fu , Linzhi Shen