2015/05/29 by Cristina Flaut, Flaut, Cristina
Computer Science · Mathematics · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Digital Filter Design and Implementation #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1505.07958
arxiv created 2015/05/29 · openalex publication_date 2015/05/29 · arxiv updated 2015/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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, similar to Lenstra algorithm on elliptic curves compared with Pollard algorithm.