Abstract
Abstract We study properties of differences of finite binary sequences with a fixed number of ones, treated as binary numbers from ℤ (2m).We show that any binary sequence consisting of m terms (except of the sequence (1, 0, . . . , 0)) can be presented as a difference of two sequences having exactly n ones, whenever .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
