Publication | Closed Access
New Construction for Binary Sequences of Period with Optimal Autocorrelation Using
11
Citations
10
References
2001
Year
Unknown Venue
EngineeringPseudo-random SequenceBinary SequencesIterative DecodingComputational ComplexitySequence DesignOptimal Autocorrelation UsingBlock DecoderCoding TheoryFull ObservabilityVariable-length CodeAlgebraic Coding TheoryComputer EngineeringNew ConstructionComputer ScienceChain CodeError Correction CodeSignal ProcessingCryptographyDifferent Parity
.Yet, on the other hand, we require that two codeword candidates for the same input tag have different parity, label edges that terminate in the same state, and be located in at addresses 256 apart. Due to those conditions, only 53 entries in are accessible by , compared to 64 entries in Section III-B. A block decoder of is obtained by deleting the two most significant bits of the 10-bit address of the entry in that contains the codeword . When restricted to the domain , this is also a block decoder of , with the range consisting of bytes having least significant bits “ .” The encoder is weakly observable from . Nesting and full observability can be attained if we do not exclude the 28-bit pattern
| Year | Citations | |
|---|---|---|
Page 1
Page 1