English
Related papers

Related papers: Enumeration of complementary-dual cyclic $\mathbb{…

200 papers

In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo…

Information Theory · Computer Science 2021-01-21 Shixin Zhu , Binbin Pang , Zhonghua Sun

The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as $\{0\}$. In this paper we will give rather alternative proof of Massey's…

Information Theory · Computer Science 2018-02-21 Nitin S. Darkunde , Arunkumar R. Patil

In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…

Information Theory · Computer Science 2023-04-19 Andrea Ferraguti , Dorian Goldfeld , Giacomo Micheli

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) =…

Combinatorics · Mathematics 2017-06-20 Giorgis Petridis

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

Number Theory · Mathematics 2025-08-07 Stephen D. Cohen

We prove that the number of right ideals of codimension $n$ in the algebra of noncommutative Laurent polynomials in two variables over the finite field $\mathbb F\_q$ is equal to $(q-1)^{n+1} q^{\frac{(n+1)(n-2)}{2}}\sum\_\theta…

Combinatorics · Mathematics 2015-11-03 Roland Bacher , Christophe Reutenauer

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{<…

Information Theory · Computer Science 2017-05-01 Zahra Sepasdar

Let $\mathbb{F}_q$ be a finite field of order $q$ and integer $n\ge 1$. Let $\ell$ be a prime such that $\ell^k|(q-1)$ for some integer $k\ge 1$ and $\mu$ be an element of order $\ell^k$ in $\mathbb{F}_q$. In this paper, we determine the…

Combinatorics · Mathematics 2018-06-29 Manjit Singh

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…

Information Theory · Computer Science 2012-02-07 Sunghyu Han , Jon-Lark Kim

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $\lambda$ and $k$ be integers satisfying $\lambda,k\geq 2$ and denote $R=\mathbb{F}_{2^m}[u]/\langle u^{2\lambda}\rangle$. Let $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$. For…

Information Theory · Computer Science 2019-05-10 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Songsak Sriboonchitta , Guidong Wang

Let $q$ be a power of a prime number $p$, $k=\mathbb{F}_{q}(t)$ be the rational function field over finite field $\mathbb{F}_{q}$ and $K/k$ be a multi-cyclic extension of prime degree. In this paper we will give an exact formula for the…

Number Theory · Mathematics 2013-10-08 Su Hu , Yan Li

Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…

Combinatorics · Mathematics 2014-10-28 Kai-Uwe Schmidt

Linear complementary dual (LCD) codes over finite fields are linear codes satisfying $C\cap C^{\perp}=\{0\}$. We generalize the LCD codes over finite fields to $\mathbb{Z}_2\mathbb{Z}_2[u]$-LCD codes over the ring…

Information Theory · Computer Science 2019-03-28 Hu Peng , Liu Xiusheng

A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…

Combinatorics · Mathematics 2015-10-26 J. Rifà , V. Zinoviev

In this paper, we investigate the structure and properties of additive complementary dual (ACD) codes over the mixed alphabet $\mathbb{F}_2\mathbb{F}_4$ relative to a certain inner product defined over $\mathbb{F}_2\mathbb{F}_4$. We…

Information Theory · Computer Science 2025-08-08 S. Ouagagui , N. Benbelkacem , A. Batoul , T. Abualrub

$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients…

Combinatorics · Mathematics 2021-05-18 Semin Yoo

Let q be a prime power and F_q be a finite field. In this paper, we study constacyclic codes over the ring F_q+ u F_q +v F_q+ u v F_q, where u^2=u, v^2=v and uv=vu. We characterized the generator polynomials of constacyclic codes and their…

Information Theory · Computer Science 2016-05-03 Joël Kaboré , Mohammed E. Charkani

Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ under a…

Combinatorics · Mathematics 2018-03-13 Kai-Uwe Schmidt

Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good…

Information Theory · Computer Science 2018-09-11 Minjia Shi , Rongsheng Wu , Patrick Sole

Let $\mathbf{A} = (A_1,\ldots, A_q)$ be a $q$-tuple of finite sets of integers. Associated to every $q$-tuple of nonnegative integers $\mathbf{h} = (h_1,\ldots, h_q)$ is the linear form $\mathbf{h}\cdot \mathbf{A} = h_1 A_1 + \cdots +…

Number Theory · Mathematics 2021-11-05 Melvyn B. Nathanson