Shehadah, Nazmi M.2022-06-282022-06-28197013842693https://hdl.handle.net/10657/10111Burst error statistics at the output of a Viterbi decoder are investigated. Upper bounds on the number of bursts of any length have been derived analytically for a hard decision. A Viterbi decoder for a hard decision has been simulated on a digital computer. Simulation studies have been made on decoders of different constraint lengths and for different probabilities of error for the Binary Symmetric Channel. Number of bursts of different lengths at the output of these decoders have been counted. The results from the simulation study agree with the upper bounds obtained analytically.application/pdfenThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.Thesisreformatted digital