English
Related papers

Related papers: New few weight codes from trace codes over a local…

200 papers

In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…

Information Theory · Computer Science 2026-05-15 Ankit Yadav , Nilay Kumar Mondal , Ritumoni Sarma

Let $F_2$ be the binary field and $Z_{2^r}$ the residue class ring of integers modulo $2^r$, where $r$ is a positive integer. For the finite $16$-element commutative local Frobenius non-chain ring $Z_4+uZ_4$, where $u$ is nilpotent of index…

Information Theory · Computer Science 2017-11-22 Virgilio P. Sison , Monica N. Remillion

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

Information Theory · Computer Science 2015-02-23 Bryan Hernandez , Virgilio Sison

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their…

Information Theory · Computer Science 2015-08-21 Gerardo Vega

In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…

Combinatorics · Mathematics 2020-05-07 Vito Napolitano , Ferdinando Zullo

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…

Information Theory · Computer Science 2016-11-26 Abidin Kaya , Bahattin Yildiz

Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction…

Information Theory · Computer Science 2015-10-20 Ziling Heng , Qin Yue

We construct trace codes over $\Z_4$ by using Boolean functions and skew sets, respectively. Their Lee weight distribution is studied by using a Galois ring version of the Walsh-Hadamard transform and exponential sums. We obtain a new…

Information Theory · Computer Science 2017-07-04 Minjia Shi , Yan Liu , Randriam Hugues , Lin Sok , Patrick Sole

We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in the rank metric. Our motivation for constructing such codes…

Information Theory · Computer Science 2019-05-07 Swanand Kadhe , Salim El Rouayheb , Iwan Duursma , Alex Sprintson

This paper provides new and improved Singleton-like bounds for Lee metric codes over integer residue rings. We derive the bounds using various novel definitions of generalized Lee weights based on different notions of a support of a linear…

Information Theory · Computer Science 2023-07-13 Jessica Bariffi , Violetta Weger

The $p$-ary code associated with the incidence structure of points and $t$-spaces in a projective space $\mathrm{PG}(m,q)$, where $q=p^h$, is the $\mathbb{F}_p$-subspace generated by the incidence vectors of the blocks of this design. The…

Combinatorics · Mathematics 2025-10-07 Bence Csajbók , Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti

Minimal codes are a class of linear codes which gained interest in the last years, thanks to their connections to secret sharing schemes. In this paper we provide the weight distribution and the parameters of families of minimal codes…

Combinatorics · Mathematics 2020-04-30 Daniele Bartoli , Matteo Bonini , Marco Timpanella

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been…

Information Theory · Computer Science 2019-06-07 Matthias Grezet , Ragnar Freij-Hollanti , Thomas Westerbäck , Camilla Hollanti

In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…

Information Theory · Computer Science 2021-07-07 Canze Zhu , Qunying Liao

The weight hierarchy of one-point algebraic geometry codes can be estimated by means of the generalized order bounds, which are described in terms of a certain Weierstrass semigroup. The asymptotical behaviour of such bounds for r > 1…

Combinatorics · Mathematics 2019-02-12 M. Delgado , J. I. Farrán , P. A. García-Sánchez , D. Llena

In this paper, we mainly study the theory of linear codes over the ring $R =\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$. By the Chinese Remainder Theorem, we have $R$ is isomorphic to the direct sum of four rings…

Information Theory · Computer Science 2016-01-19 Ping Li , Xuemei Guo , Shixin Zhu

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Keqing Cao

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…

Combinatorics · Mathematics 2022-09-07 Daniele Bartoli , Giuseppe Marino , Alessandro Neri
‹ Prev 1 3 4 5 6 7 10 Next ›