3 search results - page 1 / 1 » Number-theoretic transforms of prescribed length |
EUROCAL
1987
14 years 2 months ago
1987
Abstract. A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is prese...
SIAMDM
2010
13 years 9 months ago
2010
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
EJC
2010
13 years 11 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...