ON THE WEIGHT DISTRIBUTION OF THE COSETS OF MDS CODES

被引:0
作者
Davydov, Alexander A. [1 ]
Marcugini, Stefano [2 ]
Pambianco, Fernanda [2 ]
机构
[1] Russian Acad Sci Moscow, Inst Informat Transmiss Problems, Kharkevich Inst, Moscow 127051, Russia
[2] Univ Perugia, Dept Math & Comp Sci, I-06123 Perugia, Italy
关键词
Cosets weight distribution; MDS codes; arcs in the projective plane; deep holes; multiple coverings; DECODER ERROR-PROBABILITY; DEEP HOLES; ASSOCIATION SCHEMES; MULTIPLE COVERINGS;
D O I
10.3934/amc.2021042
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The weight distribution of the cosets of maximum distance sepa-rable (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 <= d- 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 Ham-ming 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 distribu-tions are symmetrical in some sense. The weight distributions of the cosets of MDS codes corresponding to arcs in the projective plane PG(2, q) are also considered. For MDS codes of covering radius R = d - 1 we obtain the num-ber 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 PG(N, q).
引用
收藏
页码:1115 / 1138
页数:24
相关论文
共 45 条
[1]  
Davydov AA, 2020, Arxiv, DOI arXiv:2007.02405
[2]  
[Anonymous], 1983, Theory and Practice of Error Control Codes
[3]  
[Anonymous], 1981, The Theory of Error-Correcting Codes
[4]   WEIGHT-DISTRIBUTION OF A COSET OF A LINEAR CODE [J].
ASSMUS, EF ;
MATTSON, HF .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (04) :497-497
[5]  
Ball S, 2015, FINITE GEOMETRY COMB, V82
[6]   Arcs in finite projective spaces [J].
Ball, Simeon ;
Lavrauw, Michel .
EMS SURVEYS IN MATHEMATICAL SCIENCES, 2019, 6 (1-2) :133-172
[7]   On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes [J].
Bartoli, D. ;
Davydov, A. A. ;
Marcugini, S. ;
Pambianco, F. .
PROBLEMS OF INFORMATION TRANSMISSION, 2018, 54 (02) :101-115
[8]  
Bartoli D., 2020, Finite Fields Appl, V67
[9]   FURTHER RESULTS ON MULTIPLE COVERINGS OF THE FARTHEST-OFF POINTS [J].
Bartoli, Daniele ;
Davydov, Alexander A. ;
Giulietti, Massimo ;
Marcugini, Stefano ;
Pambianco, Fernanda .
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2016, 10 (03) :613-632
[10]   MULTIPLE COVERINGS OF THE FARTHEST-OFF POINTS WITH SMALL DENSITY FROM PROJECTIVE GEOMETRY [J].
Bartoli, Daniele ;
Davydov, Alexander A. ;
Giulietti, Massimo ;
Marcugini, Stefano ;
Pambianco, Fernanda .
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2015, 9 (01) :63-85