English
Related papers

Related papers: Subfield codes of linear codes from perfect nonlin…

200 papers

By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…

Information Theory · Computer Science 2024-02-13 Stefano Lia , Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti

Let $p$ be an odd prime number, $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over $\mathbb{F}_p$…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

Because of efficient encoding and decoding algorithms, cyclic codes are an important family of linear block codes, and have applications in communica- tion and storage systems. However, their weight distributions are known only for a few…

Information Theory · Computer Science 2013-02-05 Xiaogang Liu , Yuan Luo

In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…

Information Theory · Computer Science 2021-06-08 Fei Li

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

Combinatorics · Mathematics 2025-06-06 Vladimir Chubenko , Sascha Kurz

Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the…

Information Theory · Computer Science 2013-09-03 Xiaogang Liu , Yuan Luo

Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…

Information Theory · Computer Science 2024-07-16 Bing Chen , Yunge Xu , Zhao Hu , Nian Li , Xiangyong Zeng

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

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

For a linear code $\mathcal{C} \subseteq \mathbb{F}_2^n$ and $\alpha \in [0,1]$, call a set $S \subseteq [n]$ an (unweighted) one-sided $\alpha$-sparsifier of $\mathcal{C}$ if for all $c \in \mathcal{C}$, $\mathrm{wt}(c_S)\geq \alpha \cdot…

Combinatorics · Mathematics 2025-09-09 Shayan Oveis Gharan , Arvin Sahami

For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…

Information Theory · Computer Science 2024-05-31 Chiara Castello , Olga Polverino , Ferdinando Zullo

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Number Theory · Mathematics 2014-07-29 Oliver Roche-Newton , Igor Shparlinski

In this paper we consider completely regular codes, obtained from perfect (Hamming) codes by lifting the ground field. More exactly, for a given perfect code C of length n=(q^m-1)/(q-1) over F_q with a parity check matrix H_m, we define a…

Information Theory · Computer Science 2015-10-25 Josep Rifà , Victor Zinoviev

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring $\mathbb{F}_p+u\mathbb{F}_p.$ They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss…

Information Theory · Computer Science 2017-01-05 Minjia Shi , Yan Liu , Patrick Solé

We propose a geometric formulation of effective field theories via nonlinear supersymmetry. Non-supersymmetric particles are embedded in constrained superfields governed by a nonlinear sigma model, and operators are collected into…

High Energy Physics - Theory · Physics 2025-05-13 Yu-Tse Lee

Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…

Information Theory · Computer Science 2025-12-29 Leijo Jose , Lavanya G. , Anuradha Sharma

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

In this manuscript, we work over the non-chain ring $\mathcal{R} = \mathbb{F}_2[u]/\langle u^3 - u\rangle $. Let $m\in \mathbb{N}$ and let $L, M, N \subseteq [m]:=\{1, 2, \dots, m\}$. For $X\subseteq [m]$, define $\Delta_X:=\{v \in…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Information Theory · Computer Science 2016-02-03 Fei Li , Yang Yan , Qiuyan Wang , Tongjiang Yan
‹ Prev 1 4 5 6 7 8 10 Next ›