Codes over a subset of octonion integers
Block Codes over subsets of the octonion integers have been defined in this paper and decoding algorithms for these codes have been given. The alphabets considered are quotients of the subset of octonion integers. Two code constructions one for one error correcting block codes and the second for double error correcting codes have been presented. It is noted that the code rate in the octonions case can be better than in the Hurwitz case.
scientific article