Examples of Permutation

bnGUI.venn.geometry.Permutation
@author muellera
cc.redberry.core.combinatorics.Permutation
kipedia.org/wiki/Permutation">http://en.wikipedia.org/wiki/Permutation). For keeping permutation it uses one-line notation. Instances of this class are immutable. {@link Comparable} implementation is necessary for using{@link TreeMap} of combinatorics in {@link PermutationsSpanIterator} @see Comparable @see PermutationsSpanIterator @author Dmitry Bolotin @author Stanislav Poslavsky
cc.redberry.core.groups.permutations.Permutation
@author Dmitry Bolotin @author Stanislav Poslavsky
com.google.gwt.dev.Permutation
Represents the state of a single permutation for compile.
infovis.utils.Permutation
ivory.lsh.data.Permutation
org.bouncycastle.pqc.math.linearalgebra.Permutation
This class implements permutations of the set {0,1,...,n-1} for some given n > 0, i.e., ordered sequences containing each number m (0 <= m < n) once and only once.
org.eigenbase.util.Permutation
Represents a mapping which reorders elements in an array.
org.teiid.query.util.Permutation

Examples of ivory.lsh.data.Permutation

    String randomPermFile = PwsimEnvironment.getPermutationsFile(dir, fs, vocabSize, numInts);


    if (fs.exists(new Path(randomPermFile))) {
      sLogger.info("Random permutations output path already exists!");
    } else {
      Permutation p = new PermutationByBit(vocabSize);
      Permutation.writeToFile(p, numInts, fs, job, randomPermFile);
    }
    DistributedCache.addCacheFile(new URI(randomPermFile), job);


    sLogger.info("Computing signatures...");

View Full Code Here

Examples of ivory.lsh.data.Permutation

      return randomPermFile;
    }


    SequenceFile.Writer writer = SequenceFile.createWriter(fs, job, new Path(randomPermFile),
        IntWritable.class, ArrayListOfIntsWritable.class);
    Permutation p = new PermutationByBit(numBits);
    for (int i = 0; i < numOfPermutations; i++) {
      ArrayListOfIntsWritable perm = p.nextPermutation();
      writer.append(new IntWritable(i), perm);
      sLogger.debug(i + ":" + perm);
    }
    writer.close();
    sLogger.info("Random permutations written.");

View Full Code Here

Examples of ivory.lsh.data.Permutation

    PwsimEnvironment.numOfPermutations = 0; // doesn't matter. not used to compute signatures


    if (fs.exists(new Path(randomPermFile))) {
      sLogger.info("Random permutations output path already exists!");
    } else {
      Permutation p = new PermutationByBit(vocabSize);
      Permutation.writeToFile(p, numInts, fs, job, randomPermFile);
    }
    DistributedCache.addCacheFile(new URI(randomPermFile), job);


    sLogger.info("Computing signatures...");

View Full Code Here

Examples of ivory.lsh.data.Permutation

      sLogger.info("Random permutations output path already exists!");
      return randomPermFile;
    }
    SequenceFile.Writer writer = SequenceFile.createWriter(fs, job, new Path(randomPermFile),
        IntWritable.class, ArrayListOfIntsWritable.class);
    Permutation p = new PermutationByBit(numBits);
    for (int i = 0; i < numOfPermutations; i++) {
      ArrayListOfIntsWritable perm = p.nextPermutation();
      writer.append(new IntWritable(i), perm);
      sLogger.debug(i + ":" + perm);
    }
    writer.close();
    sLogger.info("Random permutations written.");

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        BCMcElieceCCA2PrivateKey privKey, GF2Vector c)
    {


        // obtain values from private key
        int k = privKey.getK();
        Permutation p = privKey.getP();
        GF2mField field = privKey.getField();
        PolynomialGF2mSmallM gp = privKey.getGoppaPoly();
        GF2Matrix h = privKey.getH();
        PolynomialGF2mSmallM[] q = privKey.getQInv();


        // compute inverse permutation P^-1
        Permutation pInv = p.computeInverse();


        // multiply c with permutation P^-1
        GF2Vector cPInv = (GF2Vector)c.multiply(pInv);


        // compute syndrome of cP^-1

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        McElieceCCA2PrivateKeyParameters privKey, GF2Vector c)
    {


        // obtain values from private key
        int k = privKey.getK();
        Permutation p = privKey.getP();
        GF2mField field = privKey.getField();
        PolynomialGF2mSmallM gp = privKey.getGoppaPoly();
        GF2Matrix h = privKey.getH();
        PolynomialGF2mSmallM[] q = privKey.getQInv();


        // compute inverse permutation P^-1
        Permutation pInv = p.computeInverse();


        // multiply c with permutation P^-1
        GF2Vector cPInv = (GF2Vector)c.multiply(pInv);


        // compute syndrome of cP^-1

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        this.oid = oid;
        this.n = n;
        this.k = k;
        field = new GF2mField(encFieldPoly);
        goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
        p = new Permutation(encP);
        h = new GF2Matrix(encH);
        qInv = new PolynomialGF2mSmallM[encQInv.length];
        for (int i = 0; i < encQInv.length; i++)
        {
            qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        GF2Matrix h = GoppaCode.createCanonicalCheckMatrix(field, gp);


        // compute short systematic form of check matrix
        MaMaPe mmp = GoppaCode.computeSystematicForm(h, random);
        GF2Matrix shortH = mmp.getSecondMatrix();
        Permutation p = mmp.getPermutation();


        // compute short systematic form of generator matrix
        GF2Matrix shortG = (GF2Matrix)shortH.computeTranspose();


        // obtain number of rows of G (= dimension of the code)

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        GF2Vector vec = GF2Vector.OS2VP(n, input);
        McEliecePrivateKeyParameters privKey = (McEliecePrivateKeyParameters)key;
        GF2mField field = privKey.getField();
        PolynomialGF2mSmallM gp = privKey.getGoppaPoly();
        GF2Matrix sInv = privKey.getSInv();
        Permutation p1 = privKey.getP1();
        Permutation p2 = privKey.getP2();
        GF2Matrix h = privKey.getH();
        PolynomialGF2mSmallM[] qInv = privKey.getQInv();


        // compute permutation P = P1 * P2
        Permutation p = p1.rightMultiply(p2);


        // compute P^-1
        Permutation pInv = p.computeInverse();


        // compute c P^-1
        GF2Vector cPInv = (GF2Vector)vec.multiply(pInv);


        // compute syndrome of c P^-1

View Full Code Here

Examples of org.bouncycastle.pqc.math.linearalgebra.Permutation

        McElieceCCA2PrivateKeyParameters privKey, GF2Vector c)
    {


        // obtain values from private key
        int k = privKey.getK();
        Permutation p = privKey.getP();
        GF2mField field = privKey.getField();
        PolynomialGF2mSmallM gp = privKey.getGoppaPoly();
        GF2Matrix h = privKey.getH();
        PolynomialGF2mSmallM[] q = privKey.getQInv();


        // compute inverse permutation P^-1
        Permutation pInv = p.computeInverse();


        // multiply c with permutation P^-1
        GF2Vector cPInv = (GF2Vector)c.multiply(pInv);


        // compute syndrome of cP^-1

View Full Code Here

0 1 2 3

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.