• 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
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • 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
  • Trellis complexity and pseudoredundancy of relative two-weight codes

    Author(s)
    Liu, Z
    Wu, XW
    Griffith University Author(s)
    Wu, Xin-Wen
    Year published
    2016
    Metadata
    Show full item record
    Abstract
    Relative two-weight codes have been studied due to their applications to wiretap channel and secret sharing. It has been shown that these codes form a large family, which includes dual Hamming codes and subcodes of punctured Reed-Muller codes as special instances. This work studies the properties of relative two-weight codes with regard to efficient decoding. More specifically, the trellis complexity, which determines the complexity of Viterbi algorithm based decoding and pseudoredundancy that measures the performance and complexity of linear programming decoding are studied for relative two-weight codes. Separating properties ...
    View more >
    Relative two-weight codes have been studied due to their applications to wiretap channel and secret sharing. It has been shown that these codes form a large family, which includes dual Hamming codes and subcodes of punctured Reed-Muller codes as special instances. This work studies the properties of relative two-weight codes with regard to efficient decoding. More specifically, the trellis complexity, which determines the complexity of Viterbi algorithm based decoding and pseudoredundancy that measures the performance and complexity of linear programming decoding are studied for relative two-weight codes. Separating properties of these codes have been identified and proved first. Based on the results of separating properties, the trellis complexity of binary relative two-weight codes is fully determined. An upper bound on the pseudoredundancy of binary relative two-weight codes is derived.
    View less >
    Journal Title
    Applicable Algebra in Engineering, Communication and Computing
    DOI
    https://doi.org/10.1007/s00200-015-0276-1
    Note
    This publication has been entered into Griffith Research Online as an Advanced Online Version.
    Subject
    Mathematical sciences
    Information and computing sciences
    Other information and computing sciences not elsewhere classified
    Publication URI
    http://hdl.handle.net/10072/141359
    Collection
    • Journal articles

    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