LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

The 3/4 Conjecture for Fix-Free Codes With at Most Three Distinct Codeword Lengths

Photo by bkaraivanov from unsplash

The 3/4 conjecture was posed 25 years ago by Ahlswede, Balkenhol, and Khachatrian, and states that if a multiset of positive integers has Kraft sum at most 3/4, then there… Click to show full abstract

The 3/4 conjecture was posed 25 years ago by Ahlswede, Balkenhol, and Khachatrian, and states that if a multiset of positive integers has Kraft sum at most 3/4, then there exists a code that is both a prefix code and a suffix code with these integers as codeword lengths. We prove that the 3/4 conjecture is true whenever the given multiset of positive integers contains at most three distinct values.

Keywords: fix free; conjecture fix; three distinct; free codes; codeword lengths; conjecture

Journal Title: IEEE Transactions on Information Theory
Year Published: 2023

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.