This paper describes a numerical implementation in Maple V R. 5 of an algorithm to compute the Legendre–Fenchel conjugate, namely the Linear-time Legendre Transform algorithm. After a brief motivation on the importance of the Legendre–Fenchel transform, we illustrate the information the conjugate gives (how to test for convexity or compacity, and how to smooth a convex function), with several e...

Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low linear complexities. A new method is presented for constructing CDMA sequence sets with the linear complexity of the Legendre sequences, from new frequency hop patterns. Linear complexity is a measure of the robustness of a sequence to cryptographic attack. These are the first families whos...

We consider the problem of recovering polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random samples. In particular, we show that a Legendre s-sparse polynomial of maximal degree N can be recovered fromm s log(N) random samples that are chosen independently according to the Chebyshev probability measure dν(x) = π−1(1 − x2)−1/2dx. As an effici...