66 research outputs found

    Linear Codes from Some 2-Designs

    Full text link
    A classical method of constructing a linear code over \gf(q) with a tt-design is to use the incidence matrix of the tt-design as a generator matrix over \gf(q) of the code. This approach has been extensively investigated in the literature. In this paper, a different method of constructing linear codes using specific classes of 22-designs is studied, and linear codes with a few weights are obtained from almost difference sets, difference sets, and a type of 22-designs associated to semibent functions. Two families of the codes obtained in this paper are optimal. The linear codes presented in this paper have applications in secret sharing and authentication schemes, in addition to their applications in consumer electronics, communication and data storage systems. A coding-theory approach to the characterisation of highly nonlinear Boolean functions is presented

    Weight hierarchies of a family of linear codes associated with degenerate quadratic forms

    Full text link
    We restrict a degenerate quadratic form ff over a finite field of odd characteristic to subspaces. Thus, a quotient space related to ff is introduced. Then we get a non-degenerate quadratic form induced by ff over the quotient space. Some related results on the subspaces and quotient space are obtained. Based on this, we solve the weight hierarchies of a family of linear codes related to f.f.Comment: 12 page
    • …
    corecore