Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1957.Includes bibliographical references (leaves 68-69).by Richard S. Marcus.M.S

Accepted _ _

Richard S. Marcus

This paper considers the problem of efficient coding (in the information theory sense) for finite, discrete, memoryless message sources and finite, discrete, memoryless, noiseless channels.,i- It describes important known results and methods and includes some!, ntnew results. Various classes of the coding problem are clearly distinguished. Emphasis is placed on the classes in which the number of message blocks is restricted either to the number of a:?i original messages or to the number of hannel symbols, whichever is larger. However, rocedures for larger numbers of message blocks, which lead to perfect efficiency, are also discussed. Various bounds on the efficiency are described for different:.9 ~/procedures. The case of cost-weighted channel symbols is discussed in parallel with the equal-cost case which has received the most attention in the literature so far. Cost-weighted symbols in-elude those which ave, for instance, unequal time durations. &apos;&quot;- % An extension of the Shannon procedure and bounds to this cost-weighted case is described. An interesting question as to the admissibility of proper signal sets in the cost-weighted case is raised but not solved

CiteSeerX

Discrete noiseless coding

Marcus, Richard S

DSpace@MIT

http://dspace.mit.edu/bitstream/handle/1721.1/35438/32145246-MIT.pdf%3Bjsessionid%3D4329A85C99CA86C5B78317E4ECFEB063?sequence%3D2

Discrete noiseless coding

Abstract

Similar works

Full text

Available Versions

CiteSeerX

DSpace@MIT