Exetools  

Go Back   Exetools > General > Source Code

Notices

 
 
Thread Tools Display Modes
Prev Previous Post   Next Post Next
  #11  
Old 04-10-2018, 03:45
floaters floaters is offline
Friend
 
Join Date: Apr 2018
Posts: 9
Rept. Given: 0
Rept. Rcvd 1 Time in 1 Post
Thanks Given: 12
Thanks Rcvd at 6 Times in 3 Posts
floaters Reputation: 1
Oh cool, I've never looked at the DFT in finite fields before. Looking at it from the DFT perspective, it means that we can compute the inverse DFT directly without having to invert the matrix.

The inverse DFT is given by N^(-1) * {{a^(- i * j)}},
and since we work in the finite field over 127, the negative exponent is resolved
by modular inverse in 127:

ModInverse(N, 127) * {{ModInverse(2^(i * j), 127)}}

i,j are the matrix indices from 0 to N-1.
Here N=7 and ModInverse(7, 127) = 105 for example.

That makes computing the inverse for any such invertible problem much easier!
Reply With Quote
The Following User Says Thank You to floaters For This Useful Post:
dila (04-10-2018)
 


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is On


Similar Threads
Thread Thread Starter Forum Replies Last Post
.NET Reactor v. 6.7.0.0 CF and String Cleaners Source Code Aesculapius Source Code 0 08-28-2021 02:13
Code snippet for Base34 Encoding TempoMat General Discussion 11 03-29-2020 17:58
Base Encoding Library for Delphi XorRanger Source Code 0 04-30-2015 15:37


All times are GMT +8. The time now is 02:06.


Always Your Best Friend: Aaron, JMI, ahmadmansoor, ZeNiX, chessgod101
( Since 1998 )