Balanced Maximum Counting Sequences

DOI10.1109/TIT.2006.878217zbMath1309.94133OpenAlexW2034748766MaRDI QIDQ3547995

I. Nengah Suparta, A. J. van Zanten

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2006.878217

Mathematics Subject Classification ID

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

Related Items (2)

Some classes of bipartite graphs induced by Gray codes ⋮ Cyclic arrangements with minimum modulo \(m\) winding numbers

This page was built for publication: Balanced Maximum Counting Sequences