Counting sequences
From MaRDI portal
Publication:3904546
DOI10.1109/TC.1981.6312153zbMath0455.94053MaRDI QIDQ3904546
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)
Related Items (13)
Data compression and Gray-code sorting ⋮ Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes ⋮ Equipartition of mass distributions by hyperplanes ⋮ Multi-dimensional Interval Routing Schemes ⋮ Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations ⋮ A construction of Gray codes inducing complete graphs ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ On the spectrum of Hamiltonian cycles in the \(n\)-cube ⋮ On the \((n,t)\)-antipodal Gray codes ⋮ Multidimensional interval routing schemes ⋮ Antipodal Gray codes ⋮ Existence of a maximum balanced matching in the hypercube ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers
This page was built for publication: Counting sequences
