Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes (Q2497694): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.chaos.2005.08.081 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001040901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convolutions via Mersenne Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248054 / rank
 
Normal rank

Latest revision as of 17:36, 24 June 2024

scientific article
Language Label Description Also known as
English
Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes
scientific article

    Statements

    Fast algorithm for ``error-free'' convolution computation using Mersenne--Lucas codes (English)
    0 references
    0 references
    4 August 2006
    0 references
    discrete circular convolution
    0 references
    discrete orthogonal transforms
    0 references
    Lucas numbers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references