I remember seeing an article a while back about using grain elevators for this purpose in rural areas. This would seem like a good option if you have grain elevators in the area.
Over here in Hawaii the Department of Education has a quirky little technology program show on public tv. One week they showed how they were modifying standard Airport hardware and getting somewhere around 25 miles of range out of it by attaching certain kinds of antennas. If you can get 25 miles out of modified Airport hardware, 45 miles doesn't really sound too unreasonable.
Quick, someone tell me how checksums are computed...until then, if they are composed of any length of a sequence of the n bytes in the file then from the first location there are n possible byte strings, from the second location n-1 possible byte strings... =
(n) + (n-1) + (n-2) +... + 2 + 1
= n(n+1)/2 possible check sums where n is the number of bytes in the file...
Slashdot Mirror
Great, now I'm responding to myself...
4 01 .html
but you can forget about that idea, I just found this article:
http://www.cyberdealerlive.com/inprint/feature0
and it specifies 6 miles...45 miles is probably just too much. I swear I saw that stuff about the Hawaii DOE though.
I remember seeing an article a while back about using grain elevators for this purpose in rural areas. This would seem like a good option if you have grain elevators in the area.
Over here in Hawaii the Department of Education has a quirky little technology program show on public tv. One week they showed how they were modifying standard Airport hardware and getting somewhere around 25 miles of range out of it by attaching certain kinds of antennas. If you can get 25 miles out of modified Airport hardware, 45 miles doesn't really sound too unreasonable.
Quick, someone tell me how checksums are computed...until then, if they are composed of any length of a sequence of the n bytes in the file then from the first location there are n possible byte strings, from the second location n-1 possible byte strings... = (n) + (n-1) + (n-2) + ... + 2 + 1
= n(n+1)/2 possible check sums where n is the number of bytes in the file...