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.
Recommendations
- On octonary codes and their covering radii
- Codes over the \(p\)-adic integers
- Codes over Hurwitz integers
- Octanary linear codes using simplicial complexes
- On the [162,8,80] codes
- Codes over Gaussian integers
- On codes over quaternion integers
- scientific article; zbMATH DE number 5878931
- scientific article; zbMATH DE number 691473
- On codes over integers modulo \(q\)
Cites work
- scientific article; zbMATH DE number 45834 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 1881995 (Why is no real title available?)
- scientific article; zbMATH DE number 2114370 (Why is no real title available?)
- scientific article; zbMATH DE number 3234475 (Why is no real title available?)
- A generalization of the Lee distance and error correcting codes
- A tree for computing the Cayley-Dickson twist
- About some split central simple algebras
- Codes over Gaussian integers
- Codes over Hurwitz integers
- Groups of complex integers used as QAM signals
- Lattice constellations and codes from quadratic number fields
- Parameterized codes over cycles
- Perfect Codes From Cayley Graphs Over Lipschitz Integers
Cited in
(4)
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)
