The complete weight distribution of a subclass of optimal three-weight cyclic codes (Q6159443): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q114849075, #quickstatements; #temporary_batch_1714689923223
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114849075 / rank
 
Normal rank

Latest revision as of 00:51, 3 May 2024

scientific article; zbMATH DE number 7699108
Language Label Description Also known as
English
The complete weight distribution of a subclass of optimal three-weight cyclic codes
scientific article; zbMATH DE number 7699108

    Statements

    The complete weight distribution of a subclass of optimal three-weight cyclic codes (English)
    0 references
    0 references
    0 references
    20 June 2023
    0 references
    The weight distribution of a linear code is determined on the basis of Hamming weight, under which all the nonzero components of a codeword are regarded as identical. The complete weight distribution of a linear code enumerates the codewords by the number of symbols of each kind contained in each codeword. For this reason, determining the complete weight distribution is more involved problem than obtaining the ordinary weight distribution. In this paper, authors determine the complete weight distribution for the subclass of optimal three-weight cyclic codes. Using exponential sums, they also enlarge the family of optimal five-weight cyclic codes that was studied in [\textit{Z. Heng} et al., IEEE Trans. Inf. Theory 66, No. 11, 6872--6883 (2020; Zbl 1453.94152)].
    0 references
    0 references
    0 references
    complete weight enumerator of a code
    0 references
    weight distribution
    0 references
    optimal three-weight cyclic codes
    0 references
    0 references