Abstract
Consider the setF63of all 6-tuplesx0x1x2x3x4x5withxi∈{0, 1, 2}. It is known that there is a subsetCofF63with 73 elements such that, for anyx∈F63, there is a word inCthat differs fromxin at most one coordinate. We show that there exists such a setCwith a clear structure; this structure is used to give a combinatorial proof of the covering property of the set.
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.
