Abstract
The paper considers the structural problems and cardinality problems of pairs of non-empty subsets with certain restrictions with respect to the space where the sum is by modulo 2. The described subsets are related, in many cases, to the construction of error-correcting codes on additive communication channels, and to the quantitative bounds of their cardinality.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
