Abstract
The object of this research is the quantity defined as the maximum number of edges in a -uniform hypergraph possessing the property that no two edges intersect in vertices. The case when and as , and , are fixed constants is considered in full detail. In the case when the asymptotic accuracy of the Frankl-Wilson upper estimate is established; in the case when new lower estimates for the quantity are proposed. These new estimates are employed to derive upper estimates for the quantity , which is widely used in coding theory and is defined as the maximum number of bit strings of length and weight having Hamming distance at least from one another. Bibliography: 38 titles.
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.
