Parity encoding of binary sequences (Q697641)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parity encoding of binary sequences |
scientific article; zbMATH DE number 1801783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parity encoding of binary sequences |
scientific article; zbMATH DE number 1801783 |
Statements
Parity encoding of binary sequences (English)
0 references
17 September 2002
0 references
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.
0 references
labeling binary trees
0 references
parity encoding
0 references
differentiation of binary sequences
0 references
cycle spectrum
0 references
0.6814126968383789
0 references
0.6630836725234985
0 references