English
Related papers

Related papers: On cosets weight distributions of the doubly-exten…

200 papers

We consider the weight distributions of the cosets of weight 2 of the generalized $[q+1,q+2-d,d]_q$ doubly extended Reed-Solomon codes (GDRS) of minimum distance $d\ge5$, over the finite field $\mathbb{F}_q$ with $q$ elements. For a GDRS…

Information Theory · Computer Science 2026-05-12 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

The extended coset leader weight enumerator of the generalized Reed-Solomon $[q + 1, q - 3, 5]_q$ code is computed. The computation is considered as a question in finite geometry. For this we need the classification of the points, lines and…

Combinatorics · Mathematics 2021-04-13 Aart Blokhuis , Ruud Pellikaan , Tamás Szőnyi

The weight distribution of the cosets of maximum distance separable (MDS) codes is considered. In 1990, P.G. Bonneau proposed a relation to obtain the full weight distribution of a coset of an MDS code with minimum distance $d$ using the…

Information Theory · Computer Science 2021-07-01 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

The weight of a coset of a code is the smallest Hamming weight of any vector in the coset. For a linear code of length $n$, we call integral weight spectrum the overall numbers of weight $w$ vectors, $0\le w\le n$, in all the cosets of a…

Information Theory · Computer Science 2020-07-16 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We study $q$-ary codes with distance defined by a partial order of the coordinates of the codewords. Maximum Distance Separable (MDS) codes in the poset metric have been studied in a number of earlier works. We consider codes that are close…

Information Theory · Computer Science 2010-05-03 Alexander Barg , Punarbasu Purkayastha

In this note, we reveal a relation between the weight distribution of a concatenated code ensemble based on the Plotkin construction and those of its component codes. The relation may find applications in the calculation of the ensemble…

Information Theory · Computer Science 2025-09-01 Xiao Ma

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

The bilateral minimum distance of a binary linear code is the maximum $d$ such that all nonzero codewords have weights between $d$ and $n-d$. Let $Q\subset \{0,1\}^n$ be a binary linear code whose dual has bilateral minimum distance at…

Information Theory · Computer Science 2017-07-12 Louay Bazzi

We study the distribution of the number of rational points in a family of curves over a finite field of characteristic 2. This distribution determines the coset weight distribution of a certain BCH code.

Algebraic Geometry · Mathematics 2007-07-13 Gerard van der Geer , Marcel van der Vlugt

We study the quadratic residue weight enumerators of the dual projective Reed-Solomon codes of dimensions $5$ and $q-4$ over the finite field $\mathbb{F}_q$. Our main results are formulas for the coefficients of the the quadratic residue…

Number Theory · Mathematics 2018-07-16 Nathan Kaplan , Ian Petrow

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…

Combinatorics · Mathematics 2021-05-24 Alessandro Neri

The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…

Information Theory · Computer Science 2017-03-21 Shuxing Li , Sihuang Hu , Tao Feng , Gennian Ge

Determining the weight distributions of the projective Reed-Muller codes is a very hard problem and has been studied extensively in the literature. In this article, we provide an alternative proof of the second weight of the projective…

Algebraic Geometry · Mathematics 2025-02-20 Mrinmoy Datta

Linearized Reed-Solomon codes are defined. Higher weight distribution of those codes are determined.

Information Theory · Computer Science 2015-05-28 Haode Yan , Yan Liu , Chunlei Liu

Determining the weight distribution of a code is an old and fundamental topic in coding theory that has been thoroughly studied. In 1977, Helleseth, Kl{\o}ve, and Mykkeltveit presented a weight enumerator polynomial of the lifted code over…

Information Theory · Computer Science 2023-10-20 Minjia Shi , Shitao Li , Tor Helleseth

In this paper, we determine the complete weight distribution of the space $ \mathbb{F}_q^N $ endowed by the weighted coordinates poset block metric ($(P,w,\pi)$-metric), also known as the $(P,w,\pi)$-space, thereby obtaining it for…

Information Theory · Computer Science 2025-01-22 Atul Kumar Shriwastva , R. S. Selvaraj

We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the…

Information Theory · Computer Science 2025-03-17 Rodrigo San-José

It is well-known that Reed-Solomon codes and extended Reed-Solomon codes are two special classes of MDS codes with wide applications in practice. The complete weight enumerators of these codes are very important for determining the…

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

In this paper we consider two pointsets in $\mathrm{PG}(2,q^n)$ arising from a linear set $L$ of rank $n$ contained in a line of $\mathrm{PG}(2,q^n)$: the first one is a linear blocking set of R\'edei type, the second one extends the…

Combinatorics · Mathematics 2021-12-23 Vito Napolitano , Olga Polverino , Paolo Santonastaso , Ferdinando Zullo
‹ Prev 1 2 3 10 Next ›