Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets

Design of 8 Bit, 16 Bit and 32 Bit Lfsr for Pn Sequence Generation Using Vhdl

LFSR (Linear Feedback Shift Register) is commonly employed in various cryptography applications to generate pseudo-random numbers. The overall number of random state produced by the LFSR is determined by the feedback polynomial. LFSR is a shift register in which some of their outputs are taken in exclusive-OR format that forms the feedback path. So it capable to generate maximum of 2-1 random s...

Enumeration of (16, 4, 16, 4) Relative Difference Sets

A complete enumeration of relative difference sets (RDS) with parameters (16, 4, 16, 4) in a group of order 64 with a normal subgroup N of order 4 is given. If N = Z4, three of the eleven abelian groups of order 64, and 23 of the 256 nonabelian groups of order 64 contain (16, 4, 16, 4) RDSs. If N = Z2 × Z2, six of the abelian groups and 194 of the non-abelian groups of order 64 contain (16, 4, ...

Contextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages

In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of gramm...

On the [32, 16, 8] BCH and quadratic residue codes

Factoring (16, 6, 2) Hadamard Difference Sets

We describe a “factoring” method which constructs all twenty-seven Hadamard (16, 6, 2) difference sets. The method involves identifying perfect ternary arrays of energy 4 (PTA(4)) in homomorphic images of a group G, studying the image of difference sets under such homomorphisms and using the preimages of the PTA(4)s to find the “factors” of difference sets in G. This “factoring” technique gener...