Random Codes and Graphs for Secure Communication

This dissertation considers two groups of problems related to secure communication. The first line of research is devoted to theoretical problems of copyright protection of digital content. Embedding identification data in the content is a well-developed technique of content protection known under the name of fingerprinting. Schemes that provide such protection are known as fingerprinting codes in the literature. We study limits of the number of users of a fingerprinting system as well as constructions of low-complexity fingerprinting codes that support a large number of users. The second problem that is addressed in the dissertation relates to connectivity analysis of ad hoc wireless networks. One of the basic requirements in such environments is to ensure that none of the nodes are completely isolated from the network. We address the problem of characterizing threshold parameters for node isolation that enable the system designer to choose the power needed for network operation based on the outage probability of links in the network. The methods of this research draw from coding theory, information theory and random graphs. An idea that permeates most results in this dissertation is the application of randomization both in the analysis of fingerprinting and node isolation. The main contributions of this dissertation belong in the area of fingerprinting and are described as follows. We derive new lower and upper bounds on the optimal trade-off between the number of users and the length of the fingerprints required to ensure reliability of the system, which we call fingerprinting capacity. Information-theoretic techniques employed in our proofs of bounds on capacity originate in coding theorems for channels with multiple inputs. Constructions of fingerprinting codes draw on methods of coding theory related to list decoding and code concatenation. We also analyze random graph models for ad hoc networks with link failures and secure sensor networks that employ randomized key distribution. We establish a precise zero-one law for node isolation in the model with link failures for nodes placed on the circle. We further generalize this result to obtain a one-law for secure sensor networks on some surfaces

Electroencephalographic field influence on calcium momentum waves

Macroscopic EEG fields can be an explicit top-down neocortical mechanism that directly drives bottom-up processes that describe memory, attention, and other neuronal processes. The top-down mechanism considered are macrocolumnar EEG firings in neocortex, as described by a statistical mechanics of neocortical interactions (SMNI), developed as a magnetic vector potential $\mathbf{A}$. The bottom-up process considered are $\mathrm{Ca}^{2+}$ waves prominent in synaptic and extracellular processes that are considered to greatly influence neuronal firings. Here, the complimentary effects are considered, i.e., the influence of $\mathbf{A}$ on $\mathrm{Ca}^{2+}$ momentum, $\mathbf{p}$. The canonical momentum of a charged particle in an electromagnetic field, $\mathbf{\Pi} = \mathbf{p} + q \mathbf{A}$ (SI units), is calculated, where the charge of $\mathrm{Ca}^{2+}$ is $q = - 2 e$, $e$ is the magnitude of the charge of an electron. Calculations demonstrate that macroscopic EEG $\mathbf{A}$ can be quite influential on the momentum $\mathbf{p}$ of $\mathrm{Ca}^{2+}$ ions, in both classical and quantum mechanics. Molecular scales of $\mathrm{Ca}^{2+}$ wave dynamics are coupled with $\mathbf{A}$ fields developed at macroscopic regional scales measured by coherent neuronal firing activity measured by scalp EEG. The project has three main aspects: fitting $\mathbf{A}$ models to EEG data as reported here, building tripartite models to develop $\mathbf{A}$ models, and studying long coherence times of $\mathrm{Ca}^{2+}$ waves in the presence of $\mathbf{A}$ due to coherent neuronal firings measured by scalp EEG. The SMNI model supports a mechanism wherein the $\mathbf{p} + q \mathbf{A}$ interaction at tripartite synapses, via a dynamic centering mechanism (DCM) to control background synaptic activity, acts to maintain short-term memory (STM) during states of selective attention.Comment: Final draft. http://ingber.com/smni14_eeg_ca.pdf may be updated more frequentl

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform

We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity and structure of some graphs that correspond to codes with high distance. The codes can also be interpreted as quadratic Boolean functions, where inequivalence takes on a spectral meaning. In this context we define PAR_IHN, peak-to-average power ratio with respect to the {I,H,N}^n transform set. We prove that PAR_IHN of a Boolean function is equivalent to the the size of the maximum independent set over the associated orbit of graphs. Finally we propose a construction technique to generate Boolean functions with low PAR_IHN and algebraic degree higher than 2.Comment: Presented at Sequences and Their Applications, SETA'04, Seoul, South Korea, October 2004. 17 pages, 10 figure