New linear codes with few weights derived from Kloosterman sums (Q2302568)

From MaRDI portal
scientific article
Language Label Description Also known as
English
New linear codes with few weights derived from Kloosterman sums
scientific article

    Statements

    New linear codes with few weights derived from Kloosterman sums (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2020
    0 references
    The authors, through some detailed calculations on certain exponential sums, obtain a class of optimal 1-weight binary linear codes, new classes of 2-weight and 3-weight \(p\)-ary linear codes and a class of 4-weight binary linear codes. The lengths and weight distributions of the obtained \(t\)-weight linear codes, with \(t = 1, 2, 3\), are expressed in terms of Kloosterman sums over finite prime fields. They are completely determined when \(p = 2\) and \(p = 3\).
    0 references
    Kloosterman sums
    0 references
    linear codes
    0 references
    Niho exponent
    0 references
    Plotkin bound
    0 references
    weight distribution
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers