In 2010, Prof. Chang and Prof. Lee applied Lagrange interpolation formula to decode a class of binary cyclic codes, but they did not provide an effective way to calculate the Lagrange interpolation formula. In this thesis, we use the least common multiple of polynomials to compute it effectively.
Let E be an extension field of degree m over F = F_p and £] be a primitive nth root of unity in E. For a nonzero element r in E, the minimal polynomial of r over F is denoted by m_r(x). Then, let Min (r, F) denote the least common multiple of m_r£]^i(x) for i = 0, 1,..., n-1 and be called the generalized minimal polynomial of over F. For any binary quadratic residue code mentioned in this thesis, the set of all its correctable error patterns can be partitioned into root sets of some generalized minimal polynomials over F. Based on this idea, we can develop an effective method to calculate the Lagrange interpolation formula.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0727111-194912 |
| Date | 27 July 2011 |
| Creators | Jen, Tzu-Wei |
| Contributors | D. J. Guan, Tsai-Lien Wong, Tzon-Tzer Lu, Yaotsu Chang, C. D. Lee |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727111-194912 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0021 seconds