On the weight distribution of the cosets of MDS codes

DOI10.3934/AMC.2021042MaRDI QIDQ6163789zbMATH OpenOpenAlexFDO

Authors Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco

Publication date 30 June 2023

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.12722

zbMATH Keywords

MDS codesmultiple coveringsdeep holesarcs in the projective planecosets weight distribution

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Abstract: 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 known numbers of vectors of weights $led-2$ in this coset. In this paper, the Bonneau formula is transformed into a more structured and convenient form. The new version of the formula allows to consider effectively cosets of distinct weights $W$. (The weight $W$ of a coset is the smallest Hamming weight of any vector in the coset.) For each of the considered $W$ or regions of $W$, special relations more simple than the general ones are obtained. For the MDS code cosets of weight $W=1$ and weight $W=d-1$ we obtain formulas of the weight distributions depending only on the code parameters. This proves that all the cosets of weight $W=1$ (as well as $W=d-1$) have the same weight distribution. The cosets of weight $W=2$ or $W=d-2$ may have different weight distributions; in this case, we proved that the distributions are symmetrical in some sense. The weight distributions of the cosets of MDS codes corresponding to arcs in the projective plane $mathrmPG(2,q)$ are also considered. For MDS codes of covering radius $R=d-1$ we obtain the number of the weight $W=d-1$ cosets and their weight distribution that gives rise to a certain classification of the so-called deep holes. We show that any MDS code of covering radius $R=d-1$ is an almost perfect multiple covering of the farthest-off points (deep holes); moreover, it corresponds to an optimal multiple saturating set in the projective space $mathrmPG(N,q)$.

Recommendations

• Weight distribution of translates of MDS codes
• On the weight distribution of linear codes having dual distance d'<or=k
• On the Weight Distributions of Cosets of a Linear Code
• scientific article; zbMATH DE number 554072
• On the weight distributions of optimal cosets of the first-order Reed-Muller codes

Cites work

• scientific article; zbMATH DE number 3910296 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Algebraic Codes on Lines, Planes, and Curves
• Arcs in finite projective spaces
• Association schemes and coding theory
• Bounds on list decoding of MDS codes
• Codes for error detection.
• Completeness of normal rational curves
• Deep Holes and MDS Extensions of Reed–Solomon Codes
• Deep Holes of Projective Reed-Solomon Codes
• Finite geometry and combinatorial applications
• Four fundamental parameters of a code and their combinatorial significance
• Fundamentals of Error-Correcting Codes
• Further results on multiple coverings of the farthest-off points
• Galois geometries and coding theory
• Galois geometries and coding theory
• Identities and approximations for the weight distribution of q-ary codes
• Introduction to Coding Theory
• More on the decoder error probability for Reed-Solomon codes
• Multiple coverings of the farthest-off points with small density from projective geometry
• On Cosets Weight Distribution of Doubly-Extended Reed-Solomon Codes of Codimension 4
• On deep holes of generalized Reed-Solomon codes
• On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes
• On the Covering Radius of MDS Codes
• On the Probability of Undetected Error for the Maximum Distance Separable Codes
• On the Weight Distributions of Cosets of a Linear Code
• On the decoder error probability of block codes
• On the smallest size of an almost complete subset of a conic in \(\mathrm{PG}(2, q)\) and extendability of Reed-Solomon codes
• Open problems in finite projective spaces
• Some results on deep holes of generalized projective Reed-Solomon codes
• The Weights in MDS Codes
• The coset distribution of triple-error-correcting binary primitive BCH codes
• The coset leader and list weight enumerator
• The extended coset leader weight enumerator of a twisted cubic code
• The weight distribution of the coset leaders for some classes of codes with related parity-check matrices
• The weight-distribution of a coset of a linear code (Corresp.)
• Weight distribution of translates of MDS codes

Cited in

(4)

• On the Weights of General MDS Codes
• The Weights in MDS Codes
• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• Weight distributions of the cosets of the (32,6) Reed-Muller code

This page was built for publication: On the weight distribution of the cosets of MDS codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163789)