Efficient computing of some vector operations over GF(3) and GF(4)

MaRDI QIDQ3598607zbMATH OpenFDO

Authors Iliya G. Bouyukliev, Valentin P. Bakoev

Publication date 3 February 2009

Full work available at URL https://eudml.org/doc/11458

zbMATH Keywords

finite fieldsaddition of vectorsbit-wise representationmultiplication of a vector by a scalar

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fast vector arithmetic over \(\mathbb{F}_3\)
• scientific article; zbMATH DE number 1759315
• Arithmetic operations in \(GF(2^ m)\)
• An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
• scientific article; zbMATH DE number 5691665

Cited in

(3)

• Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
• Fast vector arithmetic over \(\mathbb{F}_3\)
• New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)

Describes a project that uses

Uses Software

• Q-extension

This page was built for publication: Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598607)