Filters








42,767 Hits in 3.5 sec

Mutual information for a deletion channel

Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan
2012 2012 IEEE International Symposium on Information Theory Proceedings  
This yields a new characterization of the mutual information between the input and output of the deletion channel.  ...  We study the binary deletion channel where each input bit is independently deleted according to a fixed probability.  ...  1 ; Y (X n 1 )) is the mutual information between the input and output of the deletion channel.  ... 
doi:10.1109/isit.2012.6283980 dblp:conf/isit/DrmotaSV12 fatcat:y2wi2pmfcvc57o67celmfizn54

An upper bound on the capacity of non-binary deletion channels

Mojtaba Rahmati, Tolga M. Duman
2013 2013 IEEE International Symposium on Information Theory  
The state of the art is the following: as a trivial upper bound, capacity of an erasure channel with the same input alphabet as the deletion channel can be used, and as a lower bound the results by Diggavi  ...  To derive the results we first prove an inequality between the capacity of a 2K-ary deletion channel with deletion probability d, denoted by C_2K(d), and the capacity of the binary deletion channel with  ...  Furthermore, as shown in [9] , for a finite length transmission over the deletion channel, the mutual information rate between the transmitted and received sequences can be upper bounded in terms of the  ... 
doi:10.1109/isit.2013.6620764 dblp:conf/isit/RahmatiD13 fatcat:q77lzt2bgbeqrk7v3ko7kpxf2q

Bounds on the Capacity of Random Insertion and Deletion-Additive Noise Channels

Mojtaba Rahmati, Tolga M. Duman
2013 IEEE Transactions on Information Theory  
Furthermore, the approach yields a useful lower bound on the capacity for a wide range of deletion probabilities for the deletion channels, while it provides a beneficial bound only for small insertion  ...  For the deletion channel, we consider two different models: independent and identically distributed (i.i.d.) deletion-substitution channel and i.i.d. deletion channel with additive white Gaussian noise  ...  As proved in [11] for a channel with deletion errors, such a finite length transmission in fact results in an upper bound on the mutual information supported by the insertion/deletion channels; however  ... 
doi:10.1109/tit.2013.2262019 fatcat:ebvygtvfunen3lygs5q7j3vgfi

On information transmission over a finite buffer channel

S. Diggavi, M. Grossglauser
2006 IEEE Transactions on Information Theory  
We also examine the noisy deletion channel where a deletion channel is cascaded with a symmetric discrete memoryless channel (DMC).  ...  In deletion channels, unlike erasure channels, there is no side-information about which symbols are dropped.  ...  We also thank the reviewers for detailed and constructive inputs. Their comments also encouraged us to obtain additional results on the noisy deletion channel.  ... 
doi:10.1109/tit.2005.864445 fatcat:pxcbk6tei5g4flnh4yn7ewqazq

A Security Enhanced Encryption Scheme and Evaluation of Its Cryptographic Security

Miodrag J. Mihaljević
2019 Entropy  
The security enhancement is analyzed in terms of the related probabilities, equivocation, mutual information and channel capacity.  ...  The approach is based on certain results of coding and information theory regarding communication channels with erasures and deletion errors.  ...  Acknowledgments: The Author thanks to the Anonymous Reviewers for the comments and suggestions resulting in improvement of the presentation.  ... 
doi:10.3390/e21070701 pmid:33267415 fatcat:jmsf22yh4zcjhgef7izla4u6gm

An Approach for Security Enhancement of Certain Encryption Schemes Employing Error Correction Coding and Simulated Synchronization Errors

Miodrag J. Mihaljević, Lianhai Wang, Shujiang Xu
2022 Entropy  
On the other hand, from the perspective of an attacker the degradation appears as a transmission of the ciphertext over a binary deletion channel.  ...  From the perspective of the legitimate parties that share a secret key, the degradation appears as a transmission of the ciphertext through a binary erasure channel.  ...  binary deletion channels; and (ii) its cryptographic security evaluation, based on mutual information between input and output of certain channel with bits deletion, employing the adversarial indistinguishably  ... 
doi:10.3390/e24030406 pmid:35327917 pmcid:PMC8947027 fatcat:bzgx3dl2tng6lnmumjupevk23a

Mutual Information Bounds via Adjacency Events

Yanjun Han, Or Ordentlich, Ofer Shayevitz
2016 IEEE Transactions on Information Theory  
outperform the best known bounds for the mutual information.  ...  As an example, we apply our bounds to the binary deletion channel and show that for the special case of an i.i.d. input distribution and a range of deletion probabilities, our lower and upper bounds both  ...  We then consider the binary deletion channel for which the value of the mutual information is currently unknown for any nontrivial input process.  ... 
doi:10.1109/tit.2016.2609390 fatcat:3as7o3hrh5fopgwkh4qpgr46la

Achievable Rates for Channels With Deletions and Insertions

Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran
2013 IEEE Transactions on Information Theory  
The main idea is a mutual information decomposition in terms of the rate achieved by a sub-optimal decoder that determines the positions of the deleted and inserted runs in addition to decoding the transmitted  ...  For the special case of the deletion channel, the proposed bound improves on the previous best lower bound for deletion probabilities up to 0.3.  ...  ACKNOWLEDGMENT We thank the Associate Editor and the anonymous reviewers for their comments which helped us strengthen our initial results and improve the paper.  ... 
doi:10.1109/tit.2013.2278181 fatcat:bhjpijmxazhqfnkbo6e5ot3iqu

Achievable rates for channels with deletions and insertions

Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran
2011 2011 IEEE International Symposium on Information Theory Proceedings  
The main idea is a mutual information decomposition in terms of the rate achieved by a suboptimal decoder that determines the positions of the deleted and inserted runs in addition to decoding the transmitted  ...  For the special case of the deletion channel, the proposed bound improves on the previous best lower bound for deletion probabilities up to 0.3.  ...  ACKNOWLEDGMENT We thank the Associate Editor and the anonymous reviewers for their comments which helped us strengthen our initial results and improve the paper.  ... 
doi:10.1109/isit.2011.6034143 dblp:conf/isit/VenkataramananTR11 fatcat:hlan4lylvjacxcj45wwhverzv4

An Exploration of a New Group of Channel Symmetries [article]

Francisco Pernice
2022 arXiv   pre-print
In a general setting, we show that the distribution over the inputs that maximizes the mutual information between the input and output of a given channel is a "fixed point" of the action of the channel's  ...  This serves as some formal justification for why the analysis of the binary deletion channel has proved much more difficult than its memoryless counterparts.  ...  ACKNOWLEDGEMENTS The author would like thank Ray Li, Mary Wootters and Marco Mondelli for illuminating discussions and invaluable feedback on early versions of the ideas presented in this paper.  ... 
arXiv:2202.03633v1 fatcat:ckvntyamibazlei764sipls5uu

Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation

Mojtaba Rahmati, Tolga M. Duman
2015 IEEE Transactions on Information Theory  
With two specific applications of this idea, a random fragmentation applied to a binary deletion channel and a deterministic fragmentation process applied to a nonbinary deletion channel, we prove certain  ...  Some extensions of these results, for instance, to the case of deletion/substitution channels are also explored.  ...  ACKNOWLEDGMENTS The authors would like to thank Marco Dalai for his insightful comments on the paper.  ... 
doi:10.1109/tit.2014.2368553 fatcat:pnl73xncrnbobgymtiqucxxst4

Improved capacity lower bounds for channels with deletions and insertions

Ramji Venkataramanan, Sekhar Tatikonda
2013 2013 IEEE Information Theory Workshop (ITW)  
New lower bounds are obtained for the capacity of a binary channel with deletions and insertions.  ...  The mutual information between the channel input and output sequences is expressed as the sum of the rate achieved by this decoder and the rate loss due to its suboptimality.  ...  The second challenge is to optimize the mutual information over all input distributions.  ... 
doi:10.1109/itw.2013.6691342 dblp:conf/itw/VenkataramananT13a fatcat:vmgeyiez7nethfpeos66clqiau

Information analysis of single photon emission computed tomography with count losses

A.O. Hero, L. Shao
1990 IEEE Transactions on Medical Imaging  
This likelihood function is the average of a set of ideal-detection likelihood functions each matched to a particular set of possible deleted y-ray paths.  ...  Numerical evaluations of the mutual information, with and without side information, associated with information optimal apertures and uniform parallel-hole collimators are then presented.  ...  NUMERICAL EXAMPLES To illustrate the sensitivity of the mutual information criterion to the effect of random deletions we numerically computed the mutual information for ideal detection, I , -PF] A ) is  ... 
doi:10.1109/42.56336 pmid:18222756 fatcat:tdd2hukfnfd7dpkyymmhqtkqxu

On the Achievable Rate of Bandlimited Continuous-Time AWGN Channels with 1-Bit Output Quantization [article]

Sandra Bender, Meik Dörpinghaus, Gerhard Fettweis
2017 arXiv   pre-print
The ratio between the lower bound on the mutual information rate and the capacity of the additive white Gaussian noise channel without quantization is a constant independent of the channel bandwidth for  ...  We derive a lower bound on the capacity by lower-bounding the mutual information rate for a given set of waveforms with exponentially distributed zero-crossing distances, where we focus on the behavior  ...  Given that the latter can only cause a degradation of the mutual information rate as mutual information is always non-negative, for the purpose of an upper bound on the mutual information rate I (A; D)  ... 
arXiv:1612.08176v3 fatcat:xspxiuzqeffgnp77liwcyrinrq

Fast algorithms for antenna selection in MIMO systems

Yang-Seok Choi, A.F. Molisch, M.Z. Win, J.H. Winters
2003 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484)  
In this paper, we suggest a class of fast antenna selection algorithm that are based on the correlation or mutual information between the signals at the different antenna elements.  ...  Its performance is very close to the optimum selection procedure: the capacity penalty is less than 1bit/s/Hz for the analyzed examples.  ...  On the other hand when the mutual information between y k and y l has maximum value, y k and y l carry the same information so that we can delete one of them.  ... 
doi:10.1109/vetecf.2003.1285322 fatcat:pmibxdo3sndkdkd7j4uqsrmbmm
« Previous Showing results 1 — 15 out of 42,767 results