Skip to main content

2019 | OriginalPaper | Buchkapitel

An Effective Algorithm for Testing of O–Codes

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

An extending approach to the concept of the product of context and ambiguous. In this article, we present the concept of overlap product, where contextual words are inserted among code words and strings reduced by the common overlapping context. Thus, the concept of code on the basis of overlap product is created, also called O–code. The initial results on the properties and conditions for decoding are the basis to establish an effective algorithm for testing of O–codes with the complexity of n3.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Schützenberger, M.P.: On a question concerning certain free submonoids. J. Comb. Theory 1(4), 437–442 (1966)MathSciNetCrossRef Schützenberger, M.P.: On a question concerning certain free submonoids. J. Comb. Theory 1(4), 437–442 (1966)MathSciNetCrossRef
2.
Zurück zum Zitat Weil, P.: Groups: codes and unambiguous automata. In: Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 182, pp. 351–362. Springer, Heidelberg (1985) Weil, P.: Groups: codes and unambiguous automata. In: Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 182, pp. 351–362. Springer, Heidelberg (1985)
3.
Zurück zum Zitat Huy, P.T., Van, D.L.: On non-ambiguous Büchi V-automata. In: Proceedings of the Third Asian Mathematical Conference, Philippines. World Scientific, 23–27 October 2000 Huy, P.T., Van, D.L.: On non-ambiguous Büchi V-automata. In: Proceedings of the Third Asian Mathematical Conference, Philippines. World Scientific, 23–27 October 2000
4.
Zurück zum Zitat Huy, P.T.: On ambiguities and unambiguities related with ω–Languages. Invited Report in International Conference “Combinatorics and Applications”, Hanoi, 3–5 December 2001 Huy, P.T.: On ambiguities and unambiguities related with ω–Languages. Invited Report in International Conference “Combinatorics and Applications”, Hanoi, 3–5 December 2001
5.
Zurück zum Zitat Vinh, H.N., Nam, V.T., Huy, P.T.: Codes base on unambiguous products. Lecture Notes in Artificial Intelligence, vol. 6423, pp. 252–262. Springer, Heidelberg (2010) Vinh, H.N., Nam, V.T., Huy, P.T.: Codes base on unambiguous products. Lecture Notes in Artificial Intelligence, vol. 6423, pp. 252–262. Springer, Heidelberg (2010)
6.
Zurück zum Zitat Vinh, H.N., Huy, P.T.: Codes of bounded words. In: Proceedings of the 3rd International Conference on Computer and Electrical Engineering (ICCEE 2010), Chengdu, China, vol. 2, pp. 89–95, 16–18 November 2010 Vinh, H.N., Huy, P.T.: Codes of bounded words. In: Proceedings of the 3rd International Conference on Computer and Electrical Engineering (ICCEE 2010), Chengdu, China, vol. 2, pp. 89–95, 16–18 November 2010
7.
Zurück zum Zitat Berstel, J., Perrin, D.: Theory of Codes. Academic Press Inc., New York (1985)MATH Berstel, J., Perrin, D.: Theory of Codes. Academic Press Inc., New York (1985)MATH
8.
9.
Zurück zum Zitat Nam, V.T.: Code on the basis of some new product types. Doctoral Dissertation, National Library, Hanoi University of Science and Technology (2007) Nam, V.T.: Code on the basis of some new product types. Doctoral Dissertation, National Library, Hanoi University of Science and Technology (2007)
10.
11.
Zurück zum Zitat Van, D.L., Saec, B.L., Littovsky, I.: On coding morphism for zigzag code. Theoret. Inform. Appl. 26(6), 565–580 (1992)MathSciNetCrossRef Van, D.L., Saec, B.L., Littovsky, I.: On coding morphism for zigzag code. Theoret. Inform. Appl. 26(6), 565–580 (1992)MathSciNetCrossRef
12.
Zurück zum Zitat Van, D.L., Saec, B.L., Littovsky, I.: Stability for the zigzag submonoids. Theory Comput. Sci. 108(2), 237–249 (1993)MathSciNetCrossRef Van, D.L., Saec, B.L., Littovsky, I.: Stability for the zigzag submonoids. Theory Comput. Sci. 108(2), 237–249 (1993)MathSciNetCrossRef
13.
Zurück zum Zitat Han, N.D., Vinh, H.N., Thang, D.Q., Huy, P.T.: Quadratic algorithms for testing of codes and ⃟-Codes. Fundam. Inform. 130, 1–15 (2014)MathSciNetMATH Han, N.D., Vinh, H.N., Thang, D.Q., Huy, P.T.: Quadratic algorithms for testing of codes and ⃟-Codes. Fundam. Inform. 130, 1–15 (2014)MathSciNetMATH
Metadaten
Titel
An Effective Algorithm for Testing of O–Codes
verfasst von
Ho Ngoc Vinh
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-319-99996-8_6