On addition and multiplication with Hensel codes

DOI10.1109/12.61062MaRDI QIDQ5375455zbMATH OpenOpenAlexFDO

Authors Christopher J. Zarowski, Howard C. Card

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.61062

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Linear codes (general theory) (94B05)

Recommendations

• Additive codes over Galois rings
• Constacyclic additive codes over finite fields
• Multi-twisted additive codes over finite fields
• Generalized additive codes over Galois rings
• Hasse-Weil bound for additive cyclic codes
• The theory of cyclic codes and a generalization to additive codes
• Direct constructions of additive codes
• On additive GF(4) codes

Cited in

(1)

• Conversion of Hensel codes to rational numbers

This page was built for publication: On addition and multiplication with Hensel codes

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