Abstract
AbstractThe cyclic ST‐AN code is a cyclic AN code based on a ternary number system using numerals ‐1, 0, 1 (called symmetrical ternary number system). It is suited to the arithmetic operations handling positive and negative numbers in a symmetrical way as well as to the error‐correction. We have already presented some reports on the basic concept of the code and the error‐correcting ability for the random error. This paper proposes the cyclic ST‐AN code which can correct the burst error. The code is generated by the code generator A = (3c ‐ 1) A2, and is an extension of the algebraic Fire code. Because of this property, it has the features that the construction is very simple and the selection of the code is easy. A satisfactory result is also obtained for the code efficiency. This paper describes first the outline of the cyclic ST‐AN code and the concepts of arithmetic burst. Then it discusses the construction of the cyclic ST‐AN Fire‐type code and its error‐correcting ability. Finally, the decoding method is presented which uses the error‐trapping.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
