Laced Boolean Functions and Subset Sum Problems in Finite Fields

Abstract

In this paper, we investigate some algebraic and combinatorial properties of a special Boolean function on n variables, defined using weighted sums in the residue ring modulo the least prime p great n. We also give further evidence to a question raised by Shparlinski regarding this function, by computing accurately the Boolean sensitivity thus settling the question for prime number values p = n. Finally, we propose a generalization of these functions, which we call laced func- tions, and compute the weight of one such, for every value of n.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 13, 2011
Accession Number
ADA548861

Entities

People

  • David Canright
  • Pantelimon Stanica
  • Subhamoy Maitra
  • Sugata Gangopadhyay

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Binomials
  • Coefficients
  • Complex Variables
  • Computations
  • Computer Programs
  • Equations
  • Functions (Mathematics)
  • Hypergeometric Functions
  • Information Operations
  • Mathematical Analysis
  • Mathematics
  • Numbers
  • Prime Numbers
  • Sensitivity
  • Special Functions (Mathematics)
  • Vector Spaces

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Approximation Theory.
  • Educational Psychology