Skip to main content
Log in

The existence and synchronization properties of symmetric fix-free codes

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Fix-free codes are a type of variable length codes with both prefix-free and suffix-free properties, and there are two types of fix-free codes: symmetric fix-free codes and asymmetric fix-free codes. In this paper, we mainly discuss symmetric fix-free codes. First, the existence of symmetric fix-free codes is studied in detail, and some necessary and sufficient conditions are proposed. We also discuss the problem of achieving synchronization of symmetric fix-free codes, which is important in application. We then establish a scheme with synchronizing codewords to resolve this problem.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ahlswede R, Balkewhol B, Khachatrian. Some properties of fix-free code. In: Proceedings of 1st Intas Seminar on Coding Theory and Combinatoics. Thahkadzor, 1996. 20–33

  2. Kukorelly Z, Zeger K. Sufficient conditions for existence of binary fix-free codes. IEEE Trans Inform Theory, 2005, 51: 3433–3444

    Article  MathSciNet  Google Scholar 

  3. Takishima Y, Wada M, Murakami H. Reversible variable length code. IEEE Trans Commun, 1995, 43: 158–162

    Article  MATH  Google Scholar 

  4. Ye C X, Yeung R W. Some basic properties of fix-free codes. IEEE Trans Inform Theory, 2001, 47: 72–87

    Article  MathSciNet  MATH  Google Scholar 

  5. Harada K, Kobayashi K. A note on the fix-free property. IEICE Trans Fund Electr, 1999, E82-A: 2121–2128

    Google Scholar 

  6. Yekhanin S. Sufficient conditions of existence of fix-free codes. In: Proceedings of IEEE International Symposium on Information Theory. Washington D.C.: IEEE, 2001. 284

    Google Scholar 

  7. Yekhanin S. Improved upper bound for the redundancy of fix-free codes. IEEE Trans Inform Theory, 2004, 50: 2815–1818

    Article  MathSciNet  Google Scholar 

  8. Schnettler H. On the ¾-conjecture for fix-free codes-a survey. Math CO, 2007. Online. Available at: http://arxiv.org/abs/0709.2598

    Google Scholar 

  9. Khosravifard M, Halabian H, Gulliver T A. A kraft-type sufficient condition for the existence of D-Ary fix-free aodes. IEEE Trans Inform Theory, 2010, 56: 2920–2927

    Article  MathSciNet  Google Scholar 

  10. Jeong W-H, Yoon Y-S, Ho Y-S. Design of reversible variable length codes using properties of the Huffman code and average length function. In: 2004 International Conference on Image Processing (ICIP). Singapore: IEEE, 2004. 817–820

    Google Scholar 

  11. Lin C-W, Chuang Y-J, Wu J-L. Generic construction algorithms for symmetric and asymmetric RVLCs. In: International Conference on Computational Science 2002(ICCS 2002). 2002. 968–972

    Google Scholar 

  12. Morita H, Sun D Z. Self-synchronizing reversible variable length codes. In: Proceeding of 2006 International Symposium on Information Theory and its Applications (ISITA2006). Seoul: IEEE, 2006. 1–5

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to FangWei Fu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guang, X., Fu, F. & Chen, L. The existence and synchronization properties of symmetric fix-free codes. Sci. China Inf. Sci. 56, 1–9 (2013). https://doi.org/10.1007/s11432-012-4675-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-012-4675-7

Keywords

Navigation