Complexity Reduction of Constant Matrix Computations over the Binary Field

DOI10.1007/978-3-540-73074-3_9zbMath1213.68330OpenAlexW2148246531MaRDI QIDQ5426084

Mikael Olofsson, Oscar Gustafsson

Publication date: 15 November 2007

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73074-3_9

zbMATH Keywords

low-complexitybinary fieldGalois field arithmeticconstant multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07)

Related Items (1)

On the subfield subcodes of Hermitian codes

This page was built for publication: Complexity Reduction of Constant Matrix Computations over the Binary Field