English
Related papers

Related papers: Cyclic codes from the first class two-prime Whitem…

200 papers

Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…

Information Theory · Computer Science 2022-10-12 Ziling Heng , Xinran Wang , Xiaoru Li

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 are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…

Information Theory · Computer Science 2021-07-02 Nuh Aydin , R. Oliver VandenBerg

In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal…

Information Theory · Computer Science 2016-02-12 Giuliano G. La Guardia

Sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. Among the known sequences, cyclotomic families have the optimal autocorrelation property. In this paper, we…

Information Theory · Computer Science 2009-09-28 Kai Cai , Rongquan Feng , Zhiming Zheng

A weakly consecutive sequence (WCS) is a permutation $\sigma$ of $\{1, \ldots, k\}$ such that if an integer $d$ divides $\sigma(i)$, then $d$ also divides $\sigma(i \pm d)$ insofar as these are defined. The structure of weakly consecutive…

Combinatorics · Mathematics 2024-01-19 Thomas Garrison , Chris Seiler , Andrew Knowles

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

Let $m$, $k$ be positive integers such that $\frac{m}{\gcd(m,k)}\geq 3$, $p$ be an odd prime and $\pi $ be a primitive element of $\mathbb{F}_{p^m}$. Let $h_1(x)$ and $h_2(x)$ be the minimal polynomials of $-\pi^{-1}$ and…

Information Theory · Computer Science 2014-07-09 Long Yu , Hongwei Liu

The Coleman-Weinberg (CW) renormalization scheme for renormalization-group improvement of the effective potential is particularly valuable for CW symmetry-breaking mechanisms (including the challenging case of models with multiple scalar…

High Energy Physics - Phenomenology · Physics 2020-11-04 F. A. Chishtie , Zhuo-Ran Huang , M. Reimer , T. G. Steele , Zhi-Wei Wang

In this paper, a family of cyclic codes over $\mathbb{F}_{p}$ whose duals have five zeros is presented, where $p$ is an odd prime. Furthermore, the weight distributions of these cyclic codes are determined.

Information Theory · Computer Science 2015-02-10 Yan Liu , Chunlei Liu

For any positive integers $m$ and $k$, existing literature only determines the number of all Euclidean self-dual cyclic codes of length $2^k$ over the Galois ring ${\rm GR}(4,m)$, such as in [Des. Codes Cryptogr. (2012) 63:105--112]. Using…

Information Theory · Computer Science 2020-07-21 Yuan Cao , Yonglin Cao , San ling , Guidong Wang

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

Information Theory · Computer Science 2025-01-22 Zhao Hu , Mingxiu Qiu , Nian Li , Xiaohu Tang , Liwei Wu

We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field $\mathbb F_{q^m}$, $q$ a prime power, $m \geq 2$. We establish the rank weight hierarchy for $[n,n-1]$ cyclic codes and…

Information Theory · Computer Science 2014-07-16 Jérôme Ducoat , Frédérique Oggier

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Information Theory · Computer Science 2023-06-28 Minjia Shi , Denis Krotov , Patrick Solé

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Information Theory · Computer Science 2017-04-03 Maosheng Xiong

Almost difference sets have emerged as a fascinating and important area of research as they can produce functions with optimal nonlinearity, cyclic codes, and binary sequences with optimal autocorrelation. This study aims to investigate the…

Group Theory · Mathematics 2024-02-01 Benedict Estrella

In this paper, we construct a new family of distance-optimal binary cyclic codes with the minimum distance $6$ and a new family of distance-optimal quaternary cyclic codes with the minimum distance $4$. We also construct several families of…

Information Theory · Computer Science 2024-02-15 Hao Chen , Yanan Wu

In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by…

Information Theory · Computer Science 2017-05-17 Alexandre Zhdanov

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

Information Theory · Computer Science 2026-05-28 Cristina Flaut , Bianca Liana Bercea-Straton

We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\sigma$ distance measure ($1 \leq \sigma \leq \infty$). Our main result is an exact characterization of the probability that a particular labeled cycle…

Combinatorics · Mathematics 2010-10-01 Madhav P. Desai