Parity encoding of binary sequences

DOI10.1023/A:1016514905883MaRDI QIDQ697641zbMATH OpenOpenAlexWikidataFDO

Authors Gustavus J. Simmons

Publication date 17 September 2002

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1016514905883

zbMATH Keywords

cycle spectrumdifferentiation of binary sequenceslabeling binary treesparity encoding

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Other types of codes (94B60)

Review text

It is known that the parity encoding of binary sequences, which is essentially the inverse operation to the differentiation of binary sequences, partitions the sequences into cycles of sequences. In this paper, it is shown that the spectrum of these cycles is a fractal-like semi-infinite sequence of powers of 2 with the property that truncating it at the \((n+1)\)st term yields the cycle spectrum for the parity encoding of \(n\)-bit binary sequences. A simple and complete characterization of both the cycles and of the cycle spectrum is derived.

Recommendations

• On differentially encoded M-sequences
• Parity codes
• scientific article; zbMATH DE number 866656
• Binary coding by integration of polynomials
• Publication:4886137

Cited in

(1)

• Sorting parity encodings by reusing variables

This page was built for publication: Parity encoding of binary sequences

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