Program source is an intermediate representation of software; it lies between between a developer’s intention, and the hardware’s execution. Despite advances in languages and development tools, source itself and the applications we use to view it remain an essentially static representation of software, from which developers can spend considerable energy postulating actual behaviour. Emerging te...

This paper provides an alternative proof to the MacWilliams identity for linear block codes over GF(q). The intermediate results of our alternative proof offer some insights of the vector-space structure. Our vector-space-based methodology can be used to establish the relation between weight distributions of dual codes for other metrics.

In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the cardinality of the ground field is large enough. More precisely, we prove that for most values of the parameters, an equidistant code of maximum cardinality is ei...

Recently [1] we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called “inner codes” and “outer codes.” In Ref. 1, some small examples of these codes were given as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size regi...

Recently [1] we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called “inner codes” and “outer codes.” In Ref. [1], some small examples of these codes were given as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size re...

We investigate a new class of authenticate codes (A-codes) that support verification by a group of message recipients in the network coding setting. That is, a sender generates an A-code over a message such that any intermediate node or recipient can check the authenticity of the message, typically to detect pollution attacks. We call such an A-code as multi-receiver homomorphic A-code (MRHA-co...

a method is introduced for efficient encoding and decoding of the Reed-Solomon codes based on the matrix formalism. In this ideology, a method is suggested for vectorization of the Berlekamp-Massey algorithm for detecting and correcting several silent data corruptions. The results of comparison of suggested method with other knows ways of decoding RS codes are presented. This approach requires ...

Propose a system which uses Program Dependence Graphs as an intermediate representation of codes to perform approximate sub graph isomorphism using graph alignment techniques for finding similar code. The document aims at defining all of the concepts used to build the system along with the results being compared with the current state of the art, JPLAG. The proposed system only works for Java c...

This paper describes a Higher Order Logic (HOL) theory formalizing an extended version of the Gong, Needham, Yahalom (GNY) belief logic, a theory used by software that automatically proves authentication properties of cryptographic protocols. The theory's extensions to the GNY logic include being able to specify protocol properties at intermediate stages and being able to specify protocols that...

We consider recursive decoding for Reed-Muller (RM) codes and their subcodes. Two new recursive techniques are described. We analyze asymptotic properties of these algorithms and show that they substantially outperform other decoding algorithms with nonexponential complexity known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures....