Skip to main content
SpringerLink
Log in

Trellis complexity and pseudoredundancy of relative two-weight codes

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inform. Theory 44, 2010–2017 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, W.D., Kløve, T.: The weight hierarchies of q-ary codes of dimension 4. IEEE Trans. Inform. Theory 42, 2265–2272 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cohen, G., Encheva, S., Litsyn, S., Schaathun, H.G.: Intersecting codes and separating codes. Discrete Appl. Math. 128, 75–83 (2003)

    Article  MathSciNet  Google Scholar 

  4. Cohen, G., Encheva, S., Schaathun, H.G.: More on (2,2)-separating systems. IEEE Trans. Inform. Theory 48, 2606–2609 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cohen, G., Zémor, G.: Intersecting codes and independent families. IEEE Trans. Inform. Theory 40, 1872–1881 (1994)

    Article  MATH  Google Scholar 

  6. Encheva, S., Cohen, G.: Constructions of intersecting codes. IEEE Trans. Inform. Theory 45, 1234–1237 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feldman, J., Wainwright, M.J., Karger, D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inform. Theory 51, 954–972 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Forney, G.D.: Coset codes II: binary lattices and related codes. IEEE Trans. Inform. Theory 34, 1152–1187 (1988)

    Article  MathSciNet  Google Scholar 

  9. Liu, Z.H., Chen, W.D.: Notes on the value function. Des. Codes Cryptogr. 54, 11–19 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Liu, Z.H., Zeng, X.Y.: On a kind of two-weight code. Eur. J. Comb. 33, 1265–1272 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu, Z.H., Wu, X.W.: On relative constant-weight codes. Des. Codes Cryptogr. 75, 127–144 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Pellikaan, R., Wu, X.W., Bulygin, S., Jurrius, R.: Error-correcting codes and cryptology, to be published by Cambridge University Press, Cambridge, UK

  13. Vardy, A., Be’ery, Y.: Maximum-likelihood soft decision decoding of BCH codes. IEEE Trans. Inform. Theory 40, 546–554 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Vontobel, P. O., Koetter, R.: Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, CoRR Dec. (2005). arXiv:cs/0512078

  15. Ytrehus, Ø.: On the trellis complexity of certain binary linear block codes. IEEE Trans. Inform. Theory 41, 559–560 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inform. Theory 52, 206–212 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Zumbrägel, J., Skachek, V., Flanagan, M.: On the pseudocodeword redundancy of binary linear codes. IEEE Trans. Inform. Theory 58, 4848–4861 (2012)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by The National Science Foundation of China (No. 11171366 and No. 61170257).

Author information

Authors and Affiliations

  1. Department of Mathematics, Beijing Institute of Technology, Beijing, 100081, China

    Zihui Liu

  2. School of Information and Communication Technology, Griffith University, Gold Coast, QLD, 4222, Australia

    Xin-Wen Wu

Authors
  1. Zihui Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin-Wen Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zihui Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Z., Wu, XW. Trellis complexity and pseudoredundancy of relative two-weight codes. AAECC 27, 139–158 (2016). https://doi.org/10.1007/s00200-015-0276-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-015-0276-1

Keywords

Search

Navigation