EFFICIENCY OF QUADS ALGORITHM IN COMPLEMENTARY SEQUENCE SEARCH
The biggest obstacle in complementary sequence search is the high time complexity, especially when the search method used has an exponential complexity. The complementary sequence search is important because it is used in the construction of Hadamard matrices, which have many applications in technol...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/83426 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |