Analysis of Digital Expansions of Minimal Weight

Analysis of Digital Expansions of Minimal Weight

Extending an idea of Suppakitpaisarn, Edahiro and Imai, a dynamic programming approach for computing digital expansions of minimal weight is transformed into an asymptotic analysis of minimal weight expansions. The minimal weight of an optimal expansion of a random input of length $\ell$ is shown to...

Full description

Bibliographic Details
Main Authors: Florian Heigl, Clemens Heuberger
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2012-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
dynamic programming
limit distribution
digital expansions
hamming weight
elliptic curve cryptography
frobenius endomorphism
minimal expansions
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
Online Access:https://dmtcs.episciences.org/3009/pdf

Internet

https://dmtcs.episciences.org/3009/pdf

Similar Items