Abstract
Let us consider an optical character recognition system, which in particular can be used for identifying objects that were assigned strings of some length. The system is not perfect, for example, it sometimes recognizes wrongly the characters "Y" and "V". What is the largest set of strings of given length for the system under consideration, which can be mutually correctly recognized, and the corresponding objects correctly identified? It is not the only interesting question that can be asked. In 1956, Shannon posed a problem of determining the capacity named after him [S56]. It is interesting that the formalism, which he introduced, can be used for describing the aforementioned problem. Moreover, many important problems can be represented using the formalism of Shannon.
Author (1)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Monographic publication
- Type:
- rozdział, artykuł w książce - dziele zbiorowym /podręczniku w języku o zasięgu międzynarodowym
- Title of issue:
- Social Aspects of Business Informatics, Concepts and Applications strony 53 - 62
- Language:
- English
- Publication year:
- 2014
- Bibliographic description:
- Jurkiewicz M.: On practical application of Shannon theory to character recognition and more// Social Aspects of Business Informatics, Concepts and Applications/ ed. Andrzej Marciniak, Mikołaj Morzy Poznań: NAKOM Publishers, 2014, s.53-62
- Verified by:
- Gdańsk University of Technology
seen 127 times
Recommended for you
Characterizing the Performance of <span class="sc">xor</span> Games and the Shannon Capacity of Graphs
- R. Ramanathan,
- A. Kay,
- G. Murta
- + 1 authors