English
Related papers

Related papers: Linear complexity of quaternary sequences over Z4 …

200 papers

We determine the structure of the cyclotomic Hecke algebra corresponding to the complex reflection group $G_{25}$ also when it is not semisimple, as long as the generators are diagonalizable. In particular, we classify all simple…

Representation Theory · Mathematics 2025-10-14 Lilit Martirosyan , Hans Wenzl

We derive B\'ezout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel's conjecture and…

Information Theory · Computer Science 2011-08-24 Graham H. Norton

Sequences with good randomness properties are quite important for stream ciphers. In this paper, a new class of quaternary sequences is constructed by using generalized cyclotomic classes of $\mathbb{Z}_{2p^m}$ $(m\geq1)$. The exact values…

Information Theory · Computer Science 2023-09-11 Qiuyan Wang , Weigang Kong , Yang Yan , Chenhuang Wu , Minghui Yang

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree , Robert Wilms

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…

Information Theory · Computer Science 2020-07-31 Minghui Yang , Keqin Feng

We study linear divisibility sequences of order 4, providing a characterization by means of their characteristic polynomials and finding their factorization as a product of linear divisibility sequences of order 2. Moreover, we show a new…

Number Theory · Mathematics 2017-09-08 Marco Abrate , Stefano Barbero , Umberto Cerruti , Nadir Murru

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

Information Theory · Computer Science 2012-07-12 Cunsheng Ding

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Number Theory · Mathematics 2022-06-22 Sergiy Koshkin

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…

Information Theory · Computer Science 2021-05-31 Qiuyue Liu , Shiyuan Qiang , Minghui Yang , Keqin Feng

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for a prime $p$, we determine the explicit complete weight enumerators of a family of linear codes over $\mathbb{F}_p$ with defining set…

Information Theory · Computer Science 2015-07-22 Shudi Yang , Zhang-An Yao , Chang-An Zhao

The linear complexity of a periodic sequence over $GF(p^m)$ plays an important role in cryptography and communication [12]. In this correspondence, we prove a result which reduces the computation of the linear complexity and minimal…

Cryptography and Security · Computer Science 2016-08-31 Hao Chen

Let $G$ be a finite group and let $cd(G)$ be the set of all irreducible complex character degrees of $G$. It was conjectured by Huppert in Illinois J. Math. 44 (2000) that, for every non-abelian finite simple group $H$, if $cd(G)=cd(H)$…

Group Theory · Mathematics 2015-02-02 Hung Ngoc Nguyen , Hung P. Tong-Viet , Thomas P. Wakefield

We prove a two-parameter family of $q$-hypergeometric congruences modulo the fourth power of a cyclotomic polynomial. Crucial ingredients in our proof are George Andrews' multiseries extension of the Watson transformation, and a…

Number Theory · Mathematics 2019-09-24 Victor J. W. Guo , Michael J. Schlosser

Let $p_{1}, p_{2}$ be two distinct prime integers, let $n$ be a positive integer, $n$$\geq 3$ and let $\xi_{n} $ be a primitive root of order $n$ of the unity. In this paper we obtain a complete characterization for a quaternion algebra…

Number Theory · Mathematics 2024-02-13 Diana Savin

A quadratic line complex is a three-parameter family of lines in projective space P^3 specified by a single quadratic relation in the Plucker coordinates. Fixing a point p in P^3 and taking all lines of the complex passing through p we…

Differential Geometry · Mathematics 2012-04-13 E. V. Ferapontov , J. Moss

V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…

Number Theory · Mathematics 2012-07-10 E. Yu Lerner

In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences of period $pq$ is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, we derive…

Information Theory · Computer Science 2021-02-25 Chun-e Zhao , Yuhua Sun , Tongjiang Yan

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

A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…

Numerical Analysis · Mathematics 2008-03-19 Salem Said , Nicolas Le Bihan , Stephen J. Sangwine