• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 380
  • Last Modified:

Java long division in finite field 2

How do I do a long division in galois field 2 in java?
0
humansg
Asked:
humansg
  • 4
  • 2
1 Solution
 
Kevin CrossChief Technology OfficerCommented:
humansg, before we get started, is this for a homework assignment? If so, do you know how to work out the long division manually as I can help you translate that to Java, thus helping you "learn" versus just spitting out an answer...
0
 
humansgAuthor Commented:
yes, it is part of an assignment which I need to call for part of euclid algorithm..
yes i know how to do the long division manually.
0
 
Kevin CrossChief Technology OfficerCommented:
Okay. Great. Please post what you have for the calculation as you understand it in your attempt in Java. If you are getting any compilation or run-time errors, then you should post details on those. For run-time errors, posting the full stack trace in a code snippet is very useful. If the issue is logical, i.e., everything compiles and runs but you are not getting the expected results, then ensure to post what you expect alongside what you are getting currently.

From there, we can guide you through correcting the code.
0
The new generation of project management tools

With monday.com’s project management tool, you can see what everyone on your team is working in a single glance. Its intuitive dashboards are customizable, so you can create systems that work for you.

 
humansgAuthor Commented:
public static int gf2LongDivideQ(int dividend, int divisor) {

        int dividendLength = getLengthOf(dividend);
        int divisorLength = getLengthOf(divisor);

        if (divisorLength > dividendLength) {
            return -1;
        }

        int tempDividend = 0;

        int quotient = 0;

        for (int i = 1; i <= dividendLength; i++) {
            int bitAtPositionI = getBit(dividend, i);

            tempDividend = (tempDividend << 1) + bitAtPositionI;

            if (getLengthOf(tempDividend) < divisorLength) { // cannot divide
                // append '0' to end of quotient
                quotient = (quotient << 1);
            } else {
                // perform xor operation
                tempDividend = tempDividend ^ divisor;

                // append '1' to end of quotient
                quotient = (quotient << 1) + 1;
            }
        }

        return quotient;
    }

    public static int getLengthOf(int input) {
        int length = 0;
        while (input != 0) {
            input = input >> 1;
            length++;
        }
        return length;
    }

    public static int getBit(int input, int index) {
        input = input >> (getLengthOf(input) - index); // shift out bits to the right by (length - index)
        input = input & 0x1; // get right most bit
        return input;
    }

Open in new window

0
 
humansgAuthor Commented:
Coded out myself. Should be able to work..
0
 
humansgAuthor Commented:
accepting own solution..
0

Featured Post

Never miss a deadline with monday.com

The revolutionary project management tool is here!   Plan visually with a single glance and make sure your projects get done.

  • 4
  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now