Abstract
Integer codes have been successfully applied to various areas of communication and computer technology. They demonstrate good performance in correcting specific kinds of errors. In many cases, the used integer codes are constructed by computer search. This paper presents an algebraic construction of integer codes over the ring of integers modulo A=2n+1 capable of correcting at least up to two bit errors in a single b-byte. Moreover, the codes can correct some configurations of three or more erroneous bits, but not all possible ones. The construction is based on the use of cyclotomic cosets of 2 modulo A.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
