A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations

DOI10.1109/TIT.2006.890775MaRDI QIDQ3548848zbMATHOpenAlexFDO

Authors James A. Muir

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

redundant representationscomputer arithmeticelliptic curve cryptographyleft-to-right recodingminimal weight representationssigned radix-\(r\) representations

Mathematics Subject Classification ID

Cryptography (94A60) Radix representation; digital problems (11A63) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• New left-to-right minimal weight signed-digit radix-\(r\) representation
• Minimal weight and colexicographically minimal integer representations
• Information Security
• Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
• Minimal weight \(k\)-SR representations

Cited in

(7)

• Optimal left-to-right binary signed-digit recoding
• Minimal expansions in redundant number systems and shortest paths in graphs
• Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
• scientific article; zbMATH DE number 2085444 (Why is no real title available?)
• New left-to-right minimal weight signed-digit radix-\(r\) representation
• Minimal weight \(k\)-SR representations
• Minimal weight and colexicographically minimal integer representations

This page was built for publication: A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations

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