Abstract | ||
---|---|---|
In this paper, we define binary block codes over subsets of real algebras obtained by the Cayley–Dickson process and we provide an algorithm to obtain codes with a better rate. This algorithm offers more flexibility than other methods known until now. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/s00006-016-0645-2 | Advances in Applied Clifford Algebras |
Keywords | Field | DocType |
94B15, 94B05, 15B33, Block codes, Cyclic codes, Integer codes, Codes over Gaussian Integers, Matrices over special rings | Discrete mathematics,Combinatorics,Concatenated error correction code,Group code,Luby transform code,Block code,Expander code,Reed–Solomon error correction,Reed–Muller code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
abs/1505.07958 | 4 | 1661-4909 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Cristina Flaut | 1 | 3 | 4.73 |