Sciweavers

Share
CORR
2008
Springer

Capacity of General Discrete Noiseless Channels

8 years 2 months ago
Capacity of General Discrete Noiseless Channels
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol weights, it is shown that the capacity--if well-defined--can be determined from the radius of convergence of its generating function, from the smallest positive pole of its generating function, or from the rightmost real singularity of its complex generating function. A generalisation is given for Pringsheim's Theorem and for the Exponential Growth Formula to generating functions of combinatorial structures with non-integer valued symbol weights.
Georg Böcherer, Valdemar Cardoso da Rocha Jr.
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Georg Böcherer, Valdemar Cardoso da Rocha Jr., Cecilio Pimentel
Comments (0)
books