Looking for the whitest sequence of 1's and 0's

One option might be parity(x) where x goes from 0 to say (2^n)-1 (eg 255,511,1023..)

On 06/07/2016 23:59, Tim Wescott wrote:
> No, I'm not suddenly turning racist -- this is about signal processing.
>
> I want to fill a vector with binary numbers, evenly balanced between ones
> and zeros, such that (with the exception of the honkin' big spike at DC)
> its FFT is as flat as possible.
>
> Is there an algorithm for doing this?
>

Sometimes it's possible to write English words using only hexadecimal 
numbers, like DEAD BEEF. Sometimes words like those appear in industry 
standards, being a sort of an inside joke. But obviously not every word 
could be encoded that way.

Which makes me wondering, what is the shortest binary sequence to encode 
the F-word, and did such a sequence (encoding the F-word) ever make its 
way to any industry standard?

Gene

On 12/10/2016 15:27, Evgeny Filatov wrote:
> On 06/07/2016 23:59, Tim Wescott wrote:
>> No, I'm not suddenly turning racist -- this is about signal processing.
>>
>> I want to fill a vector with binary numbers, evenly balanced between ones
>> and zeros, such that (with the exception of the honkin' big spike at DC)
>> its FFT is as flat as possible.
>>
>> Is there an algorithm for doing this?
>>
>
> Sometimes it's possible to write English words using only hexadecimal
> numbers, like DEAD BEEF. Sometimes words like those appear in industry
> standards, being a sort of an inside joke. But obviously not every word
> could be encoded that way.
>
> Which makes me wondering, what is the shortest binary sequence to encode
> the F-word, and did such a sequence (encoding the F-word) ever make its
> way to any industry standard?
>
> Gene
>

Yeah, that's definitely weird. Let's just move on, for 0x18C56's sake.

Gene