Explore (n 1 ν) Convolutional Codes by 1-Generator Quasi-cyclic Codes

  • 曾 秀華

Student thesis: Master's Thesis

Abstract

According to that quasi-cyclic codes and convolutional codes can have the same minimum (free) distance and that Reed-Solomon codes can be designed minimum distance we can construct convolutional codes with lower error probability of decoding
Date of Award2017 Jun 29
Original languageEnglish
SupervisorWen-Fong Ke (Supervisor)

Cite this

Explore (n 1 ν) Convolutional Codes by 1-Generator Quasi-cyclic Codes
秀華, 曾. (Author). 2017 Jun 29

Student thesis: Master's Thesis