Efficient Systematic Encoding of Non-binary VT Codes

Varshamov-Tenengolts (VT) codes are a class of codes which can correct a single deletion or insertion with a linear-time decoder. This paper addresses the problem of efficient encoding of non-binary VT codes, defined over an alphabet of size $q >2$. We propose a simple linear-time encoding method to systematically map binary message sequences onto VT codewords. The method provides a new lower bound on the size of $q$-ary VT codes of length $n$.Comment: This paper will appear in the proceedings of ISIT 201

Who Do You Trust?: An Analysis of Public Perception Towards Government

This paper will discuss how the American people’s trust in their government can vary depending on different sociopolitical factors, and how the government could take advantage of this information. Through extensive research of literature reviews on previous findings as well as analysis of 2012 ANES data, I discover that the American public responds negatively to their government with an increased perception of corruption and overall disregard to the needs of the people. I will also add to the common literature by utilizing other scholarly works that demonstrate how these explanations behind distrust in government can be used to potentially improve its standing. Such factors frequently discussed by scholars on the subject include, but are not limited to, controversial political events throughout U.S. history that affect trust in government to varying degrees, race, gender, level of education, and age. Gathering data from these sources will explain how the previously mentioned factors influence levels of trust in the government. I hypothesize that the data and literature reviews will show a negative correlation between these factors and how likely the public is to trust the government. Thus, this research will give a more cohesive account on public opinion of the federal government and how correctly understanding and using such information could potentially change the public’s views

A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.Comment: 22 pages, 4 figures. This work has been accepted for IEEE Transactions on Information Theory and has been presented in part at the 2007 IEEE International Symposium on Information Theory, Nice, France, June 200