Codes over a subset of octonion integers

From MaRDI portal



Abstract: In this paper we define codes over some Octonion integers. We prove that in some conditions these codes can correct up to two errors for a transmitted vector and the code rate of the codes is grater than the code rate of the codes defined on some subset of Quaternion 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.











This page was built for publication: Codes over a subset of octonion integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889135)