Search results for: SHANNON CODE

• Average Redundancy of the Shannon Code for Markov Sources

  Publication

  • N. Merhau
  • W. Szpankowski

  - IEEE TRANSACTIONS ON INFORMATION THEORY - Year 2013

  It is known that for memoryless sources, the average and maximal redundancy of fixed–to–variable length codes, such as the Shannon and Huffman codes, exhibit two modes of behavior for long blocks. It either converges to a limit or it has an oscillatory pattern, depending on the irrationality or rationality, respectively, of certain parameters that depend on the source. In this paper, we extend these findings, concerning the Shannon...

  Full text to download in external service

• Shannon Capacity and Ramsey Numbers

  Publication

  • M. Jurkiewicz
  • M. Kubale

  - Year 2011

  Ramsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.

• Kodikas/Code

  Journals

  ISSN: 0171-0834

• Single-Mode Quadruple-Core Optical Fibres

  Publication

  • R. Romaniuk
  • R. S. Romaniuk

  - Year 1990

  Full text to download in external service

• A survey on known values and bounds on the Shannon capacity

  Publication

  • M. Jurkiewicz

  - Year 2014

  In this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.

  Full text to download in external service

• A Note on Shannon Capacity for Invariant and Evolving Channels

  Publication

  • M. Jurkiewicz
  • M. Kubale

  - Journal of Applied Computer Science - Year 2011

  In the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.

  Full text to download in external service

• On practical application of Shannon theory to character recognition and more

  Publication

  • M. Jurkiewicz

  - Year 2014

  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?...

• Some Exact Values of Shannon Capacity for Evolving Systems

  Publication

  • M. Jurkiewicz

  - Year 2012

  We describe the notion of Shannon Capacity for evolving channels. Furthermore, using a computer search together with some theoretical results we establish some exact values of the measure.

  Full text available to download

• <title>Manufacturing and measurements of triple-core, double-core, and twin-core single-mode soft-glass optical fibers</title>

  Publication

  • J. Dorosz
  • R. Romaniuk
  • R. S. Romaniuk

  - Year 1999

  Full text to download in external service

• Source Code for Biology and Medicine

  Journals

  ISSN: 1751-0473