English
Related papers

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

200 papers

Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…

Information Theory · Computer Science 2017-10-27 Yuan Cao , Yonglin Cao

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

Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code {\it optimal} if it achieves the Singleton-type bound). In the breakthrough work of \cite{TB14}, several classes of…

Information Theory · Computer Science 2018-01-12 Yuan Luo , Chaoping Xing , Chen Yuan

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary sequences by using cyclotomic numbers of order four, "Gauss periods" and "quadratic Gauss sum" on finite field $\mathbb{F}_q$ and valued in $\mathbb{Z}_{2^N-1}$…

Information Theory · Computer Science 2019-04-12 Lulu Zhang , Jun Zhang , Minghui Yang , Keqin Feng

In this paper we analyze possible actions of an automorphism of order six on a $2$-$(70, 24, 8)$ design, and give a complete classification for the action of the cyclic automorphism group of order six $G= \langle \rho \rangle \cong Z_6…

Combinatorics · Mathematics 2024-03-07 Sanja Rukavina , Vladimir D. Tonchev

Double negacirculant (DN) codes are the analogues in odd characteristic of double circulant codes. Self-dual DN codes of odd dimension are shown to be consta-dihedral. Exact counting formulae are derived for DN codes. The special class of…

Information Theory · Computer Science 2016-06-03 Adel Alahmadi , Hatoon Shohaib , Patrick Solé

Let $\mathbb{F}_{2^m}$ be a finite field of characteristic $2$ 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\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For…

Information Theory · Computer Science 2015-11-18 Yonglin Cao , Yuan Cao , Fang-Wei Fu

Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two…

Information Theory · Computer Science 2022-06-17 Fei Li

This paper shows that the six classes of PPTs can be put into two groups. Autocorrelation and cross-correlation functions of the six classes derived from the gaps between each class type have been computed. It is shown that Classes A and D…

Cryptography and Security · Computer Science 2012-11-13 Monisha Prabhu , Subhash Kak

The dodecacode is a nonlinear additive quaternary code of length $12$. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance $5$. In particular, this latter code is completely regular but not…

Combinatorics · Mathematics 2019-10-15 Minjia Shi , Denis Krotov , Patrick Solé

The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a…

Combinatorics · Mathematics 2024-09-17 Laurence Kluge

Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first…

Information Theory · Computer Science 2013-09-06 Nian Li , Chunlei Li , Tor Helleseth , Cunsheng Ding , Xiaohu Tang

In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear…

Number Theory · Mathematics 2017-12-13 Vladimir Edemskiy

Surprisingly, the class numbers of cyclotomic fields have only been determined for fields of small conductor, e.g. for prime conductors up to 67, due to the problem of finding the "plus part," i.e. the class number of the maximal real…

Number Theory · Mathematics 2014-07-10 John C. Miller

An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight…

Information Theory · Computer Science 2010-08-11 Yeow Meng Chee , Son Hoang Dau , Alan C. H. Ling , San Ling

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over $\mathbb{F}_4$ with period $2p^mq^n$ is constructed using generalized cyclotomic classes. Results show…

Information Theory · Computer Science 2020-01-30 Qiuyan Wang , Chenhuang Wu , Minghui Yang , Yang Yan

Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…

Information Theory · Computer Science 2022-04-19 Vidya Sagar , Ritumoni Sarma

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma

Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period…

Information Theory · Computer Science 2018-12-26 Kazuyoshi Tsuchiya , Chiaki Ogawa , Yasuyuki Nogami , Satoshi Uehara
‹ Prev 1 3 4 5 6 7 10 Next ›