Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 4 years ago.
Improve this question
so i had a homework to get a document (a buffer of ASCII bytes) which has the CRC32 hash (the gzip variant of CRC32), of 0xbbd1264f and unti now i don't know how to get it so if someone know how to do that please answer
spoof will calculate what bits out of a provided candidate set to invert in order to force the CRC to the desired value.
From your question, I think you mean generating collision for crc32 with your document.
You can find a lot of articles about creating crc32 collisions. For example you can see it here, here or here.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
Is there any probabilistic algorithm for calculating set cardinality taking into account that must support deleting elements from set? I've been using HyperLogLogs for calculating cardinalities of some sets and their unions but when necessity of deleting elements from set emerged my current solution became unappropriate. Maybe there are some researches or papers related to this topic you could advise.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
I am looking for a high performance data structure on GPU (preferably over CUDA). The CUDPP is something cool but it does not satisfy my requirements because I want my key to be fixed size int array. I need to query 10k+ queries per second over a KEY-VALUE store of size 1M+. Is there any library already providing such type of functionality. I tried alternates on CPU but they are not that good for the purpose.
I haven't used it, though I have heard about a hashmap extension for CUDA Thrust. Present here:
Cuda-thrust-extensions library
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I want to handle extremely large integer values of a few million digits for an experiment I'm conducting.
Which language is best for this? I know some languages such as batch have pre-established limits on how many digits it can handle.
I have a large RAM and 64-bit OS, so my machine isn't a problem.
Regards,
-Master-chip
in python 3.x the int type does not have a limit so if you are just looking for a suggestion I would check out python.
see https://docs.python.org/3.1/whatsnew/3.0.html#integers
What are you looking to do with the numbers? If your number is larger than the maximum value of an unsigned 64 bit long is 18446744073709551615 then you won't be able to use the normal types and will want to look at languages that support bigInts http://docs.oracle.com/javase/6/docs/api/java/math/BigInteger.html
Honestly there are solutions for this in most languages you will just have to pick the one you want to work with and look at its solution
Can you store these values as Strings?
Do you need complete accuracy of the numbers or can you store them as floats
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 8 years ago.
Improve this question
I am doing a software that grabs in the end a numeric string, that string encodes important data, and any error destroy the contents.
Worse: It is VERY prone for errors, because of how data is transmitted (and I can do nothing about it).
So I decided to add a verification digit of sorts... After some research, I have more questions than answers... So, someone can point me to a decent location to study more about that subject?
Also, someone know some popular algorithms that can even fix errors, or at least point where the errors are, so I can retry grabbing the data with error?
Also what I do, if the checksum data itself managed to be wrong in transmission?
Hamming Code
simple pdf explanation of hamming code
Basically for every N bits of your message, you have some check bits.
You can detect and correct errors in the check bits, based on the data, or errors in the data, based on check bits. Too many errors though, and it's just garbage. There may be a utility in your language of choice to already do this.
This can be of use: http://www.eccpage.com/
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 2 years ago.
Improve this question
is there a tool to view files as binary in windows? actually i need the interpretation like 0010101010 not Hex Values !
Check out the Hex Editors :
http://en.wikipedia.org/wiki/Comparison_of_hex_editors
Get GnuWin32 utilities. The od utility will do exactly what you need.
The hex values are just a little bit compacted binary values. For example E represents 1110 etc. So you can use any hex editor to view and edit binary values.