Loading...
Please wait, while we are loading the content...
Similar Documents
Fast computing of the positive polarity Reed-Muller transform over GF ( 2 ) and GF ( 3 )
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bakoev, Valentin |
| Copyright Year | 2008 |
| Abstract | The problem of efficient computing of binary and ternary positive (or zero) polarity Reed-Muller (PPRM) transform is important for many areas. The matrices, determining these transforms, are defined recursively or by Kronecker product. Using this fact, we apply the dynamic-programming strategy to develop three algorithms. The first of them is a new version of a previous our algorithm for performing the binary PPRM transform. The second one is a bit-wise implementation of the first algorithm. The third one performs the ternary PPRM transform. The last two algorithms have better time complexities in comparison with other algorithms, known to us. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.moi.math.bas.bg/acct2008/P2.pdf |
| Alternate Webpage(s) | http://www.moi.math.bas.bg/acct2008/b2.pdf |
| Alternate Webpage(s) | http://www.moi.math.bas.bg/acct2008/b2_new.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
