The introduction of Decision Diagrams (DDs) has brought new means towards solving many of the problems involved in digital circuit design. Compactness of the representation is one key issue. Ordered Pseudo Kronecker Decision Diagrams (OPKDDs) together with the use of complemented edges is known to offer the most general ordered, read-once DD representation at the bit-level, hence OPKDDs hold al...

Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x,y ∈ C if di ∈ {xi, yi} for 1 ≤ i ≤ n. A code C is an identifiable parent property (IPP) code if the following property holds. Whenever we are given C and a descendant d of a pair of codewords in C, it is possible to determine at least one of these codewords. The paper introduces the notion ...

Abstract T emory designs with replication numbers all or all but one of the values in the range 1\(V-1J/(K-l} to 1\(V-l)/(K-2) are studied. It is known that for K=3 and replication numbers all values in the range 1\{V-l) /(K-l J to 1\(V-l }/(K-2J, designs exist if and only if 1\=2. Here we show the uniqueness of such designs. When K=3 and all values in the range 1\(V-l J/(K-l) to 1\(V-l )/(K-2)...

We study a construction of the Mathieu group M12 using a game reminiscent of Loyd’s “15-puzzle”. The elements of M12 are realized as permutations on 12 of the 13 points of the finite projective plane of order 3. There is a natural extension to a “pseudogroup” M13 acting on all 13 points, which exhibits a limited form of sextuple transitivity. Another corollary of the construction is a metric, a...

A split complete weight enumerator in six variables is used to study the 3-colored designs held by codewords of xed composition in Type III codes containing the all-one codeword. In particular the ternary Golay code contains 3-colored 3-designs. We conjecture that every weight class in a Type III code with the all-one codeword holds 3-colored 3-designs.

A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.

We consider algorithms of the Waltz type for computing local consistency (also called arc-consistency) for constraints over numeric domains. Many commonly used propagation rules do not in fact enforce local consistency. We extend the propagation rule given by Falt-ings Faltings, 1994] to the case of ternary constraints. Since any general n-ary continuous constraint can be represented as a colle...

Following the Larson prescription for modelling amphiphilic molecules m ternary microemulsions, we develop a microscopic lattice model for a pseudo-ternary

objective(s): the objective of this study was to design a topical microemulsion of vit b12 and to study the correlation between internal structure and physicochemical properties of the microemulsions. microemulsions are thermodynamically stable mixtures of water, oil, surfactants and usually cosurfactants with several advantages for topical and transdermal drug delivery. the formulation of micr...