TL;DR
This paper introduces a new estimation method for the upper bounds of B_k sequences, which are sequences where sums of any k elements are unique, advancing understanding of their size limitations.
Contribution
It provides a novel estimation approach for the upper bounds of B_k sequences, improving previous bounds and understanding.
Findings
New upper bound estimation for B_k sequences
Enhanced understanding of sequence size limitations
Potential applications in combinatorics and number theory
Abstract
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems