scientific article; zbMATH DE number 910960

MaRDI QIDQ4886137zbMATH OpenFDO

Authors Benjamin Arazi

Publication date 9 April 1997

zbMATH Keywords

periodical binary sequencesrecovery of location indexspace complexity

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Robust positioning patterns
• Storage efficient decoding for a class of binary de Bruijn sequences
• A Binary Search with a Parallel Recovery of the Bits
• On the Computation of the Linear Complexity and the<tex>$k$</tex>-Error Linear Complexity of Binary Sequences With Period a Power of Two
• On binary digit-position sequences over Galois rings, admitting an effect of reduction of period

Cited in

(6)

• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
• scientific article; zbMATH DE number 4207997 (Why is no real title available?)
• Robust positioning patterns
• Robust positioning patterns with low redundancy
• Binary robust positioning patterns with low redundancy and efficient locating algorithms
• Parity encoding of binary sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886137)