English
Related papers

Related papers: A Generalization of the Tang-Ding Binary Cyclic Co…

200 papers

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Keqing Cao

In this paper, we introduce $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes for $r\leq s$. These codes can be identified as $\mathbb{Z}_{p^s}[x]$-submodules of $\mathbb{Z}_{p^r}[x]/\langle x^{\alpha}-1\rangle \times…

Information Theory · Computer Science 2022-02-24 Cristina Fernández-Córdoba , Sachin Pathak , Ashish Kumar Upadhyay

LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality…

Information Theory · Computer Science 2019-11-25 Carlos Galindo , Olav Geil , Fernando Hernando , Diego Ruano

Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Mengjie Yang , Yang Ming

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

Rings and Algebras · Mathematics 2016-08-16 Delphine Boucher , Willi Geiselmann , Félix Ulmer

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

We construct two new infinite families of trace codes of dimension $2m$, over the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by…

Information Theory · Computer Science 2017-09-18 Minjia Shi , Yue Guan , Patrick Sole

Very recently, Heng et al. studied a family of extended primitive cyclic codes. It was shown that the supports of all codewords with any fixed nonzero Hamming weight of this code supporting 2-designs. In this paper, we study this family of…

Information Theory · Computer Science 2023-06-16 Haode Yan , Yanan Yin

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

Combinatorics · Mathematics 2012-01-11 Hugues Randriambololona

In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta…

Information Theory · Computer Science 2017-12-22 Reza Dastbasteh , Seyyed Hamed Mousavi , Taher Abualrub , Nuh Aydin , Javad Haghighat

In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…

Rings and Algebras · Mathematics 2025-09-22 Seema Antil , Gurleen Kaur , Manju Khan

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of…

Information Theory · Computer Science 2019-11-21 Sihem Mesnager , Yanfeng Qi , Hongming Ru , Chunming Tang

Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…

Information Theory · Computer Science 2015-08-17 Chunming Tang , Nian Li , Yanfeng Qi , Zhengchun Zhou , Tor Helleseth

The first linear code supporting a $4$-design was the $[11, 6, 5]$ ternary Golay code discovered in 1949 by Golay. In the past 71 years, sporadic linear codes holding $4$-designs or $5$-designs were discovered and many infinite families of…

Information Theory · Computer Science 2020-01-03 Chunming Tang , Cunsheng Ding

An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low…

Information Theory · Computer Science 2016-11-17 Alex Bazarsky , Noam Presman , Simon Litsyn

Let $p$ be a prime number. In this paper, we study cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes.…

Information Theory · Computer Science 2014-06-05 Pramod Kumar Kewat , Bappaditya Ghosh , Sukhamoy Pattanayak

Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…

Information Theory · Computer Science 2026-05-11 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

Information Theory · Computer Science 2018-07-23 José Gómez-Torrecillas , Gabriel Navarro , F. J. Lobillo , Alessandro Neri

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

Combinatorics · Mathematics 2007-07-16 A. R. Calderbank , N. J. A. Sloane

This paper gives a unified algebraic solution to seven open problems of Wang, Tang and Ding on cyclic, negacyclic and constacyclic codes supporting designs. For the cyclic code \[ C\left(\frac{p^s-1}{2},\frac{p^s+1}{2}\right), \] a Cayley…

Information Theory · Computer Science 2026-05-28 Yutong Zhang , Yaoran Yang
‹ Prev 1 8 9 10 Next ›