Download presentation
Presentation is loading. Please wait.
Published byAdrian Trenton Modified over 10 years ago
1
Reconstruction of bits … n bits n-1 bits n-2 bits n-1 bits n-2 bits n-3 bits n-4 bits n-3 bits n bits n-2 bits n-4 bits D = distance A. Fúster-Sabater Gjøvik June 2006
2
Reconstruction of bits … n bits n-1 bits n-2 bits n-4 bits n-6 bits n-8 bits n-6 bits n bits n-4 bits n-8 bits D’ = distance A. Fúster-Sabater Gjøvik June 2006
3
Strategic Bits 1 0 0 1 0 0 0 0 1 1 1 1 1 1 1 0 0 1 1 1 1 0 1 0 0 1 0 1 1 0 0 1 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 0 1 0 1 1 0 0 1 1 1 0 1 0 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 0 0 0 0 1 0 1 0 0 1 1 0 1 1 1 0 1 0 0 1 0 1 0 0 0 0 1 1 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1 1 1 1 0 0 0 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 0 1 0 1 1 0 0 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 1 0 1 0 0 1 1 1 0 1 1 1 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 1 1 0 0 0 L i = 4, 5 T = 248 In vertical the same PN-sec. Horizontally shrunken sec. A. Fúster-Sabater Gjøvik June 2006...
4
Strategic Bits 1 0 0 1 0 0 0 0 1 1 1 1 1 1 1 0 0 1 1 1 1 0 1 0 0 1 0 1 1 0 0 1 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0 0 1 0 1 1 0 0 1 1 1 0 1 0 1 1 0 0 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 0 0 0 0 1 0 1 0 0 1 1 0 1 1 1 0 1 0 0 1 0 1 0 0 0 0 1 1 0 1 1 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1 1 1 1 0 0 0 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 0 0 1 0 1 1 0 0 1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 1 0 1 0 0 1 1 1 0 1 1 1 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 1 1 0 0 0 L i = 4, 5 T = 248 In vertical the same PN-seq. Horizontally shrunken seq. A. Fúster-Sabater Gjøvik June 2006...
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.