Computational techniques for nonlinear codes and Boolean functions

Bellini, Emanuele (2014) Computational techniques for nonlinear codes and Boolean functions. PhD thesis, University of Trento.

PDF - Doctoral Thesis
Available under License Creative Commons Attribution.



We present some upper bounds on the size of nonlinear codes and their restriction to systematic codes and linear codes. These bounds, which are an improvement of a bound by Zinoviev, Litsyn and Laihonen, are independent of other classical known theoretical bounds. Among these, we mention the Griesmer bound for linear codes, of which we provide a partial generalization for the systematic case. Our experiments show that in some cases (the majority of cases for some q) our bounds provide the best value, compared to all other closed-formula upper-bounds. We also present an algebraic method for computing the minimum weight of any nonlinear code. We show that for some particular code, using a non-standard representation of the code, our method is faster than brute force. An application of this method allows to compute the nonlinearity of a Boolean function, improving existing algebraic methods and reaching the same complexity of algorithms based on the fast Fourier transform.

Item Type:Doctoral Thesis (PhD)
Doctoral School:Mathematics
PhD Cycle:26
Subjects:Area 01 - Scienze matematiche e informatiche > INF/01 INFORMATICA
Area 01 - Scienze matematiche e informatiche > MAT/02 ALGEBRA
Repository Staff approval on:26 Jan 2015 09:44

Repository Staff Only: item control page