Solved

Java long division in finite field 2

Posted on 2011-09-14
8
371 Views
Last Modified: 2012-05-12
How do I do a long division in galois field 2 in java?
0
Comment
Question by:humansg
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 4
  • 2
8 Comments
 
LVL 60

Expert Comment

by:Kevin Cross
ID: 36539976
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
 

Author Comment

by:humansg
ID: 36543181
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
 
LVL 60

Expert Comment

by:Kevin Cross
ID: 36543269
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
Industry Leaders: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

 

Accepted Solution

by:
humansg earned 0 total points
ID: 36556907
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
 

Author Closing Comment

by:humansg
ID: 36585517
Coded out myself. Should be able to work..
0
 

Author Comment

by:humansg
ID: 36556915
accepting own solution..
0

Featured Post

Learn how to optimize MySQL for your business need

With the increasing importance of apps & networks in both business & personal interconnections, perfor. has become one of the key metrics of successful communication. This ebook is a hands-on business-case-driven guide to understanding MySQL query parameter tuning & database perf

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Prime numbers are natural numbers greater than 1 that have only two divisors (the number itself and 1). By “divisible” we mean dividend % divisor = 0 (% indicates MODULAR. It gives the reminder of a division operation). We’ll follow multiple approac…
We are taking giant steps in technological advances in the field of wireless telephony. At just 10 years since the advent of smartphones, it is crucial to examine the benefits and disadvantages that have been report to us.
Viewers learn how to read error messages and identify possible mistakes that could cause hours of frustration. Coding is as much about debugging your code as it is about writing it. Define Error Message: Line Numbers: Type of Error: Break Down…
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…
Suggested Courses

615 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question