Codes over a subset of octonion integers (Q889135): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q505667 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Bai Kishan Dass / rank | |||
Normal rank | |||
Revision as of 22:31, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
