Sciweavers

Share
26 search results - page 1 / 6
» Capacity of General Discrete Noiseless Channels
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
8 years 3 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 discre...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
CORR
2008
Springer
107views Education» more  CORR 2008»
8 years 3 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
IMA
2003
Springer
125views Cryptology» more  IMA 2003»
8 years 8 months ago
Commitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
Andreas Winter, Anderson C. A. Nascimento, Hideki ...
JSAC
2016
89views more  JSAC 2016»
2 years 11 months ago
Alignment of Polarized Sets
—Arıkan’s polar coding technique is based on the idea of synthesizing n channels from the n instances of the physical channel by a simple linear encoding transformation. Each ...
Joseph M. Renes, David Sutter, Seyed Hamed Hassani
TIT
1998
81views more  TIT 1998»
8 years 3 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
books