In binary up to how many times can a 1 (one) or a 0 (zero) be repeated.
Let's say I have an myfile.mp3; if I was to read the binary code of that file, that would be something like "010001001010..."
on this occasion the 0 is repeated at most 3 times.
would a binary code have 9 (or more) zeros between the 1s? e.g: 1000000000101001....>> there are nine zeroes here...
You're asking about binary strings. In a general sense, there is no limit to the number of 0's or 1's that can appear in sequence. That is, an infinitely-long string of 0's is valid binary.
You're also asking about binary formats. Data in a computer aren't just random binary strings; they're formatted in a particular way so that specially-designed machines called computers can process them, either as information (like an MP3) or as instructions (like winamp.exe), or even as transmission encodings (like the encodings used in USB or Ethernet).
In a practical sense, you won't find arbitrary-length strings of 0's or 1's in executable code. Transmission encodings, if they aren't synchronized via another method, may insert extra bits after a certain number of data bits, so arbitrary-length strings won't be found there either. Data formats can be more flexible, and some will allow long strings of 0's or 1's, but formats like MP3 require regular markers (again, for synchronization), so even an MP3 of silence won't contain all 0's.
So: could a binary string contain a sequence of 9 zeroes? Sure, it's quite possible, and probably very common. Could a particular binary format contain that? Maybe. But it's impossible to tell without specifying what format.
od to view as hex or octal (and then convert to binary).
Feb 4, 2010 at 13:36
od are tools that you would use to examine a file's contents for yourself. if you're trying to manipulate the file programmatically, you'd need to read the file and use tools available to you in whatever programming language you're using.
Feb 4, 2010 at 14:03
It is possible that it is repeated any number of times. Binary and decimal are almost the same. If you have a binary number abcde, it just means that abcde = a*2^4+b*2^3+c*2^2+d*2+e.
So if you want to write 0, to a file, you'll have to write a byte of all 0s, and if you have a long sequence of 0s.
Also for example 10000000(binary) = 128(decimal), and if you want to multiply it by 2 any number of times, you'll have to add so many 0s to the end of the number. (I've made a little mixture between real numbers, and computer representation of numbers, but I think you can see the general idea).
Edit: As a continuation to the questions in your comments:
Any programming language is able to open files to read in binary format.(Here by binary it's meant as binary versus text) And you're most likely to find such strings in uncompressed image files, like uncompressed BMP format, output by painter.
Your compression technique is one of the first used to compress images, I think they were named RLE, after the name of the compression, but I really don't remember exactly. (RLE on wikipedia)
If you want to read more about compression, you can look on wikipedia, since it has a lot of information. Specific widely used and not very complex compressions is Huffman coding, and also you can take a look at Lempel Ziv used by zip.
It's exactly equivalent to asking how many zeros, or ones, or twos etc you can have in a row in a decimal number. As many as you want, why would there be a limit?
There is, of course, a limit to the maximum size that any particular variable/file/disk can hold, but that is a practical matter which is secondary to the maths.
More specifically, if you asking how likely is a particular sequence of zeros in an MP3 file, because that its a compressed file format, it is less likely as the length of the sequence increases. You'll find many pairs of zeros, but fewer runs of three, and even fewer runs of 4 etc. The compression routines are specifically looking for patterns so are removing them to reduce the file size, and replacing them with a reference to the pattern - as an approximate explanation of file compression.
A file that was all 1s or all 0s wouldn't be a very interesting file. If it were all zeros then it wouldn't contain any meaningful data. If it were all ones then there could be some data present, but it would depend on what format the file was supposed to be.
A file will only contain "interesting" data if it consists of patterns of 1s & 0s and, depending on the encoding of the file, these could be any length. Though long runs of one or the other will be unlikely.
This is a pure guess but I would expect that any type of file will contain roughly the same number of 1s & 0s and just looking at the binary data wouldn't tell you what type of file it was. You would have to interpret the stream for ascii codes, number etc. to extract meaning.
To answer your 2nd question in your comment on @SurDin's answer - yes it is possible to read any file as a binary stream, but that will depend on the language used to write the program.
