Nonlinearity Computation for Sparse Boolean Functions
שמור ב:
| הוצא לאור ב: | arXiv.org (May 3, 2013), p. n/a |
|---|---|
| מחבר ראשי: | |
| יצא לאור: |
Cornell University Library, arXiv.org
|
| נושאים: | |
| גישה מקוונת: | Citation/Abstract Full text outside of ProQuest |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2085575609 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2085575609 | ||
| 045 | 0 | |b d20130503 | |
| 100 | 1 | |a Çalık, Çağdaş | |
| 245 | 1 | |a Nonlinearity Computation for Sparse Boolean Functions | |
| 260 | |b Cornell University Library, arXiv.org |c May 3, 2013 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the distances to linear functions is obtained. The special structure of these distances can be exploited to reduce the task of nonlinearity computation to solving an associated binary integer programming problem. The proposed algorithm can be used in cases where applying the Fast Walsh transform is infeasible, typically when the number of input variables exceeds 40. | |
| 653 | |a Mathematical programming | ||
| 653 | |a Integer programming | ||
| 653 | |a Algorithms | ||
| 653 | |a Computation | ||
| 653 | |a Boolean functions | ||
| 653 | |a Boolean algebra | ||
| 653 | |a Walsh transforms | ||
| 653 | |a Weight | ||
| 653 | |a Linear functions | ||
| 653 | |a Nonlinearity | ||
| 773 | 0 | |t arXiv.org |g (May 3, 2013), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2085575609/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1305.0860 |