Quaternion Integers Based Higher Length Cyclic Codes and Their Decoding Algorithm

The decoding algorithm for the correction of errors arbitrary Mannheim weight has discussed Lattice constellations and codes from quadratic number fields. Following these lines, algorithms length cyclic over quaternion integers Quaternion one up to two coordinates have considered. In continuation, case lengths studied improve error efficiency. this study, we present 2 (where is prime integer Euler phi function) Hamilton errors. Furthermore, capability code rate tradeoff are also discussed. Thus, an increase in achieved along with its better adequate capability.