Balanced Maximum Counting Sequences

DOI10.1109/TIT.2006.878217MaRDI QIDQ3547995zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On generalized balancing sequences
• Sequence t-balancing numbers
• Well-balanced sequences
• scientific article; zbMATH DE number 66773
• The maximum number of balancing sets
• Log-balanced combinatorial sequences
• Zero-sum balanced binary sequences
• On the maximum number of balancing subsets
• scientific article; zbMATH DE number 5505908
• Serially balanced factorial sequences

Cited in

(4)

• The maximum number of balancing sets
• Well-balanced sequences
• Cyclic arrangements with minimum modulo \(m\) winding numbers
• Some classes of bipartite graphs induced by Gray codes

This page was built for publication: Balanced Maximum Counting Sequences

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