• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    • Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • On a Class of Three-Weight Codes with Cryptographic Applications

    Author(s)
    Liu, Z
    Wu, XW
    Griffith University Author(s)
    Wu, Xin-Wen
    Year published
    2012
    Metadata
    Show full item record
    Abstract
    Linear codes with good algebraic structures have been used in a number of cryptographic or information-security applications, such as wire-tap channels of type II and secret sharing schemes. For a code-based secret sharing scheme, the problem of determining the minimal access sets is reduced to finding the minimal codewords of the dual code. It is well known that the latter problem is a hard problem for an arbitrary linear code. Constant weight codes and two-weight codes have been studied in the literature, for their applications to secret sharing schemes. In this paper, we study a class of three-weight codes. Making use of ...
    View more >
    Linear codes with good algebraic structures have been used in a number of cryptographic or information-security applications, such as wire-tap channels of type II and secret sharing schemes. For a code-based secret sharing scheme, the problem of determining the minimal access sets is reduced to finding the minimal codewords of the dual code. It is well known that the latter problem is a hard problem for an arbitrary linear code. Constant weight codes and two-weight codes have been studied in the literature, for their applications to secret sharing schemes. In this paper, we study a class of three-weight codes. Making use of the finite projective geometry, we will give a sufficient and necessary condition for a linear code to be a three-weight code. The geometric approach that we will establish also provides a convenient method to construct three-weight codes. More importantly, we will determine the minimal codewords of a three-weight code, making use of the geometric approach.
    View less >
    Conference Title
    IEEE International Symposium on Information Theory - Proceedings
    DOI
    https://doi.org/10.1109/ISIT.2012.6283978
    Subject
    Data engineering and data science
    Publication URI
    http://hdl.handle.net/10072/52312
    Collection
    • Conference outputs

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander