A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under execution and (b) the mobile code against tampering attempts by the executing host. Many techniques for the first problem (a) have been developed. The second problem (b) seems to be much harder: It is the general bel...

Recently Haah introduced a new quantum error correcting code embedded on a cubic lattice. One of the defining properties of this code is the absence of string logical operator. We present new codes with similar properties by relaxing the condition on the local particle dimension. The resulting code is well-defined when the local Hilbert space dimension is prime. These codes can be divided into ...

We propose a combination of partial evaluation and staged interpretation with MetaOCaml for rapid prototyping of domain-specific languages. Interpretation is an easy way to implement such languages. MetaOCaml can eliminate the overhead of interpretation at run time, if the interpreter is written in a staged form, i.e., takes the source program separate from the input data in a first stage. Part...

Adviser: Carina Curto Neurons in the brain represent external stimuli via neural codes. These codes often arise from stimulus-response maps, associating to each neuron a convex receptive field. An important problem confronted by the brain is to infer properties of a represented stimulus space without knowledge of the receptive fields, using only the intrinsic structure of the neural code. How d...

The paper addresses minimality of encoders for basic convolutional codes over Zpr by using a recently developed concept of row reducedness for polynomial matrices over Zpr . It is known in the literature that the McMillan degree of a basic encoder is an upper bound for the minimum number of trellis states, but a general expression is missing. This open problem is solved in this paper. An expand...

Since the proof in 1982, by Tsfasman Vlăduţ and Zink of the existence of algebraic-geometric (AG) codes with asymptotic performance exceeding the Gilbert–Varshamov (G–V) bound, one of the challenges in coding theory has been to provide explicit constructions for these codes. In a major step forward during 1995–1996, Garcia and Stichtenoth (G–S) provided an explicit description of algebraic curv...

Abstraction is a powerful tool for developers and it is o ered by numerous features such as polymorphism classes modules and functors A working programmer may be confused with this abundance We develop a computer algebra library which is being certi ed Reporting this experience made with a language Ocaml o ering all these features we argue that they are all needed together We compare several wa...

Lomont, Chris C.. Ph.D., Purdue University, May, 2003. Error Correcting Codes on Algebraic Surfaces. Major Professor: Tzuong-Tsieng Moh. Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in P are briefly studied, then codes resulting fr...

A large part in the design of secure cryptographic primitives consists in identifying hard algorithmic problems. Despite thefact that several problems have been proposed as a foundation for public-key primitives, those effectively used are essentiallyclassical problems coming from integer factorization and discrete logarithm. On the other hand, coding theory appeared with thegoal to...