Skip to main content
SpringerLink
Log in

Some combinatorial properties of solid codes

  • Original Research
  • Published:
Indian Journal of Pure and Applied Mathematics Aims and scope Submit manuscript

Abstract

Solid codes can be used in information transmission over a noisy channel because they have remarkable synchronization and error-detecting capabilities in the presence of noise. In this paper, we focus on combinatoric properties of solid codes. We begin by characterizing solid codes by means of infix codes and unbordered words. Then, we discuss the decomposition of solid codes (in particular, the maximal solid codes). And finally, we investigate several properties of the products of the solid codes and some other kinds of codes. Our results given in this paper significantly enrich the theory of solid codes.

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

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. J. Berstel, D. Perrin and C. Reutenauer, Codes and automata, Cambridge University Press, Cambridge (2010).

    MATH  Google Scholar 

  2. S. C. Hsu and H. J. Shyr, Some properties of overlapping order and related languages, Soochow J. Math. 15 (1989), 29-45.

    MathSciNet  MATH  Google Scholar 

  3. M. Ito, H. Jürgensen, H. J. Shyr and G. Thierrin, Outfix and infix codes and related classes of languages, J. Comput. Syst. Sci. 43 (1991), 484-508. 

  4. H. Jürgensen and S. S. Yu, Solid Codes, J. Inform. Process. Cybernet. EIK. 26 (1990), 563-574.

  5. H. Jürgensen, M. Katsura, Maixmal solid codes, Jornal of Automata, Languages and Combinatorics. 6(2001), 25-50.  

  6. H. Jürgensen and S. Konstantinidis, Codes, in Word, Language,Grammar, volum 1 of Handbook of Formal Languages (Rozenberg, G., Salomaa, A. Eds.), pp.511-607, Springer-Verlag, Berlin (1997).

  7. V. I. Levenshtein, Maximal number of words in codes without overlaps, Problemy Peredachi Informatsii. 6 (1970), 88-90, in Russion. English translation:Prolems Inform. Transmission. 6 (1973), 355-357.

  8. Y. Liu, Y. Q. Guo and Y. S. Tsai, Solid codes and the uniform density of fd-domains, Sci. China Ser. A. 50 (2007), 1026-1034.

    Article  MathSciNet  Google Scholar 

  9. C. M. Reis, f-Disjunctive congruences and a generalization of monoids with length, Semigroup Forum. 41 (1990), 291–306.

    Article  MathSciNet  Google Scholar 

  10. O. T. Romanov, Invariant decoding automata without look-ahead, Problemy Kibernetiki. 17 (1966), 233-236 (in Russian).

    MATH  Google Scholar 

  11. H. J. Shyr and S. S. Yu, Solid codes and disjunctive domains, Semigroup Forum. 41 (1990), 23-37.

    Article  MathSciNet  Google Scholar 

  12. H. J. Shyr, Free Monoids and Languages, 3rd Edition, Hon Min Book Company, Taichung, Taiwan (2001).

    MATH  Google Scholar 

  13. S. S. Yu, d-Minimal languages, Discrete Appl. Math. 89 (1989), 243-262.

    Article  MathSciNet  Google Scholar 

  14. D. Zhang, Y. Q. Guo and K. P. Shum, On some decompositions of r-disjunctive languages, Bull. Malays. Math. Sci. Soc. 37 (2014), 727-746.

    MathSciNet  MATH  Google Scholar 

  15. D. Zhang, Y. Q. Guo and K. P. Shum, Some results in r-Disjunctive languages and related topics, Soft. Comput. 21 (2016), 2477-2483.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, China

    Haiyan Liu

  2. School of Mathematics and Statistics, Lanzhou University, Lanzhou, China

    Haiyan Liu & Yuqi Guo

  3. School of Mathematics and Statistics, Southwest University, Chongqing, China

    K. P. Shum

Authors
  1. Haiyan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuqi Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. P. Shum
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haiyan Liu.

Additional information

Communicated by K Sandeep.

This work is supported by National Natural Science Foundation of China #11861051.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, H., Guo, Y. & Shum, K.P. Some combinatorial properties of solid codes. Indian J Pure Appl Math 52, 932–944 (2021). https://doi.org/10.1007/s13226-021-00093-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13226-021-00093-w

Keywords

Mathematics Subject Classification

Search

Navigation