CaltechTHESIS
  A Caltech Library Service

Binary Coding Using Standard Run Lengths

Citation

Molinder, John Irving (1969) Binary Coding Using Standard Run Lengths. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:03282017-150849634

Abstract

Run length coding using standard run lengths has been proposed by Cherry et al [7]. Their analysis has been mostly experimental for specific types of data.

In this thesis the globally optimum single standard run length has been derived for the binary independent source and globally optimum single standard run lengths of zeros and ones have been derived for the binary first order Markov source. It is assumed that the output symbols are subsequently block coded in each case. A recursion relationship between standard run lengths is derived for two specific coding algorithms. A simple single standard run length scheme using a non-block code on the output symbols has also been derived for the binary independent source.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:Electrical Engineering
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Thesis Availability:Restricted to Caltech community only
Research Advisor(s):
  • Grettenberg, Thomas L.
Thesis Committee:
  • Unknown, Unknown
Defense Date:12 May 1969
Funders:
Funding AgencyGrant Number
Ford FoundationUNSPECIFIED
Record Number:CaltechTHESIS:03282017-150849634
Persistent URL:http://resolver.caltech.edu/CaltechTHESIS:03282017-150849634
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:10113
Collection:CaltechTHESIS
Deposited By: Benjamin Perez
Deposited On:29 Mar 2017 14:28
Last Modified:29 Mar 2017 14:28

Thesis Files

[img] PDF - Final Version
Restricted to Caltech community only
See Usage Policy.

13Mb

Repository Staff Only: item control page