Abstract
Abstract Given a prime power q, the number c ( q ) denotes the minimum cardinality of a subset H of F q 3 which satisfies the following property: every element in this space differs in at most 1 coordinate from a scalar multiple of a vector in H . In this work, the upper bound on c ( q ) is improved when q is odd. The method is based on ω-partition, a combinatorial concept which can be also reformulated as a kind of matching in weighted graph.
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.
