Re: Q: SAC
- From: Mok-Kong Shen <mok-kong.shen@xxxxxxxxxxx>
- Date: Thu, 01 Oct 2009 17:39:37 +0200
Scott Fluhrer wrote:
"Maaartin" <grajcar1@xxxxxxxxx> wrote:
Mok-Kong Shen <mok-kong.s...@xxxxxxxxxxx> wrote:
For n = 0 (mod 4), n > 4, do there exist bijective functionsNo idea.
(by necessity nonlinear, see (1) above) which satisfy the condition
that flipping any one input bit always causes exactly 2 output bits
to flip?
The answer is no (and that answer is still 'no' even without the conditions on n). If we flip any input bit, then two output bits will flip; this implies that the parity of the output (whether there's an even number of '1' bits) will remain the same. We can move to any input setting by successively flipping input bits, this means that the output parity will still be fixed, and so half the possible outputs will be impossible (and hence the function cannot be bijective).
Pardon! There was a typo in my previous post. I am sorry. That question
should read:
For n = 0 (mod 4), n > 4, do there exist bijective functions
(by necessity nonlinear, see (1) above) which satisfy the condition
that flipping any one input bit always causes exactly n/2 output bits
to flip?
Thanks,
M. K. Shen
.
- Follow-Ups:
- Re: Q: SAC
- From: Scott Fluhrer
- Re: Q: SAC
- References:
- Re: Q: SAC
- From: Maaartin
- Re: Q: SAC
- From: Mok-Kong Shen
- Re: Q: SAC
- From: Maaartin
- Re: Q: SAC
- From: Scott Fluhrer
- Re: Q: SAC
- Prev by Date: Re: Q: SAC
- Next by Date: Re: Q: SAC
- Previous by thread: Re: Q: SAC
- Next by thread: Re: Q: SAC
- Index(es):
Relevant Pages
|