Skip to main content
SpringerLink
Log in

Strongly Conflict-Avoiding Codes with Weight Three

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Strongly conflict-avoiding codes are used in the asynchronous multiple-access collision channel without feedback. The number of codewords in a strongly conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, an improved upper bound on the size of strongly conflict-avoiding codes of length \(n\) and weight three is obtained. This bound is further shown to be tight for some cases by direct constructions.

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. Fu, H.-L., Lin, Y.-H., & Mishima, M. (2010). Optimal conflict-avoiding codes of even length and weight 3. IEEE Transactions on Information Theory, 56, 5747–5756.

    Article  MathSciNet  Google Scholar 

  2. Fu, H.-L., Lo, Y.-H., & Shum, K. W. (2014). Optimal conflict-avoiding codes of odd length and weight three. Designs, Codes and Cryptography, 72, 289–309.

    Article  MathSciNet  Google Scholar 

  3. Fuji-Hara, R., & Miao, Y. (2000). Optical orthgonal codes: Their bounds and new optimal construction. IEEE Transactions on Information Theory, 46, 2396–2406.

    Article  MathSciNet  MATH  Google Scholar 

  4. Jimbo, M., Mishima, M., Janiszewski, S., Teymorian, A. Y., & Tonchev, V. D. (2007). On conflict-avoiding codes of length \(n=4m\) for three active users. IEEE Transactions on Information Theory, 53, 2732–2742.

    Article  MathSciNet  Google Scholar 

  5. Levenshtein, V. I. (2007). Conflict-avoiding codes for three active users and cyclic triple systems. Problems of Information Transmission, 43, 199–212.

    Article  MathSciNet  MATH  Google Scholar 

  6. Levenshtein, V. I., & Tonchev, V. D. (2005). Optimal conflict-avoiding codes for three active users. In Proceedings IEEE International Symposium Information Theory, Adelaide, Australia (pp. 535–537)

  7. Massey, J. L., & Mathys, P. (1985). The collision channel without feedback. IEEE Transactions on Information Theory, 31, 192–204.

    Article  MathSciNet  Google Scholar 

  8. Mathys, P. (1990). A class of codes for a \(T\) active users out of \(N\) mulitiple-access communication system. IEEE Transactions on Information Theory, 36, 1206–1219.

    Article  MathSciNet  Google Scholar 

  9. Mishima, M., Fu, H.-L., & Uruno, S. (2009). Optimal conflict-avoiding codes of length \(n \equiv 0\quad (\hbox{mod}\,16)\) and weight 3. Designs, Codes and Cryptography, 52(3), 275–291.

    Article  MathSciNet  MATH  Google Scholar 

  10. Momihara, K. (2007). Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three. Designs, Codes and Cryptography, 45, 379–390.

    Article  MathSciNet  MATH  Google Scholar 

  11. Momihara, K. (2009). On cyclic \(2(k - 1)\)-support \((n, k)_{k-1}\) difference families. Finite Fields and Their Applications, 15, 415–427.

    Article  MathSciNet  Google Scholar 

  12. Momihara, K., & Buratti, M. (2009). Bounds and constructions of optimal \((n,4,2,1)\) optical orthogonal codes. IEEE Transactions on Information Theory, 55, 514–523.

    Article  MathSciNet  Google Scholar 

  13. Momihara, K., Müller, M., Satoh, J., & Jimbo, M. (2007). Constant weight conflict-avoiding codes. SIAM Journal on Discrete Mathematics, 21, 959–979.

    Article  MathSciNet  MATH  Google Scholar 

  14. Shum, K. W., & Wong, W. S. (2010). A tight asymptotic bound on the size of constant-weight conflict avoiding codes. Designs, Codes and Cryptography, 57(1), 1–14.

    Article  MathSciNet  MATH  Google Scholar 

  15. Shum, K. W., Wong, W. S., & Chen, C. S. (2010). A general upper bound on the size of constant-weight conflict avoiding codes. IEEE Transactions on Information Theory, 56(7), 3265–3276.

    Article  MathSciNet  Google Scholar 

  16. Tsybakov, B.S., & Likhanov, N.B. (1983). Packet communication on a channel without feedback. Problemy peredachi informatsii, 19, 69–84. [Problem of Inform. Trans. (English Transl.) pp. 147–161].

  17. Wu, S. L., & Fu, H.-L. (2013). Optimal tight equi-difference conflict-avoiding codes of length \(n=2^k\pm 1\) and weight 3. Journal of Combinatorial Designs, 21(6), 223–231.

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhang, Y., Shum, K. W., & Wong, W. S. (2011). Strongly conflict-avoiding codes. SIAM Journal on Discrete Mathematics, 25, 1035–1053.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

Research supported by the National Natural Science Foundation of China under Grant No. 11371207 and the Application Research Plan Project of Nantong under Grant No. BK2014060. The authors are grateful to the referees for their careful reading of the original version of this paper, their detailed comments and the suggestions that much improved the quality of this paper.

Author information

Authors and Affiliations

  1. School of Science, Nantong University, Nantong, 226007, China

    Zhihua Yu & Jinhua Wang

Authors
  1. Zhihua Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinhua Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinhua Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, Z., Wang, J. Strongly Conflict-Avoiding Codes with Weight Three. Wireless Pers Commun 84, 153–165 (2015). https://doi.org/10.1007/s11277-015-2599-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2599-4

Keywords

Search

Navigation