Codes over a subset of octonion integers (Q889135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Codes over a subset of octonion integers |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Codes over a subset of octonion integers |
scientific article |
Statements
Codes over a subset of octonion integers (English)
0 references
6 November 2015
0 references
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.
0 references
cyclic codes
0 references
block codes
0 references
integer codes
0 references
octonian integers
0 references
codes over Gaussian integers
0 references
0.91544515
0 references
0 references
0 references
0.8795526
0 references
0 references
0 references
0 references
