New heuristics for the shortest linear program (SLP) problem for large matrices
The aim of this paper is to propose an efficient algorithm (with polynomial or lower time complexity) to minimise the number of XOR gates required to compute a system of linear equations over GF(2) field. Firstly, famous Paar and Boyar-Peralta’s algorithms are reviewed, followed by introducing two n...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2020
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/139161 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|