Show simple item record

dc.contributor.advisorGeist, J.M.
dc.contributor.authorAlfredson, Leonard Eric
dc.date.accessioned2012-11-13T23:44:21Z
dc.date.available2012-11-13T23:44:21Z
dc.date.issued1972-03
dc.identifier.urihttp://hdl.handle.net/10945/16353
dc.description.abstractVarious representations of convolutional codes useful in analyzing distance properties are presented. Row distance, column distance, minimum distance, and free distance are defined. Known bounds on these distances are summarized, and where instructive, the methods of proof are indicated. A novel approach to the distance structure of a code is given in the form of a plot of row distance and column distance against depth into the code trellis. Bounds on minimum distance are applied to determine behavior of row and column distance. Finally, the problem of determining the length of sequence necessary to produce the minimum weight codeword is considered. A bound for systematic codes is presented. This bound appears to be the tightest bound on this length presently known.en_US
dc.description.urihttp://archive.org/details/somedistanceprop1094516353
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.titleSome distance properties of convolutional codes.en_US
dc.typeThesisen_US
dc.contributor.secondreaderNaval Postgraduate School
dc.contributor.corporateNaval Postgraduate School
dc.contributor.schoolElectrical Engineering
dc.description.serviceLieutenant, Civil Engineer Corps, United States Navyen_US
etd.thesisdegree.nameM.S. in Electrical Engineeringen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineElectrical Engineeringen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US
dc.description.distributionstatementApproved for public release; distribution is unlimited.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record