Change search
ReferencesLink to record
Permanent link

Direct link
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0001-8217-0158
2016 (English)In: IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2016, 335-339 p.Conference paper (Refereed)
Abstract [en]

Two sets A, B ⊆ {0, 1}n form a Uniquely Decodable Code Pair (UDCP) if every pair a ⋯ A, b ⋯ B yields a distinct sum a+b, where the addition is over ℤn. We show that every UDCP A, B, with |A| = 2(1-ϵ)n and |B| = 2βn, satisfies equation. For sufficiently small ϵ, this bound significantly improves previous bounds by Urbanke and Li [Information Theory Workshop ′98] and Ordentlich and Shayevitz [2014, arXiv:1412.8415], which upper bound β by 0.4921 and 0.4798, respectively, as ϵ approaches 0. © 2016 IEEE.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016. 335-339 p.
Keyword [en]
Decoding, Uniquely decodable codes, Upper Bound, Information theory
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-194967DOI: 10.1109/ISIT.2016.7541316ScopusID: 2-s2.0-84986000922ISBN: 9781509018062OAI: oai:DiVA.org:kth-194967DiVA: diva2:1048728
Conference
2016 IEEE International Symposium on Information Theory, ISIT 2016, 10 July 2016 through 15 July 2016
Note

QC 20161122

Available from: 2016-11-22 Created: 2016-11-01 Last updated: 2016-11-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Austrin, Per
By organisation
Theoretical Computer Science, TCS
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 18 hits
ReferencesLink to record
Permanent link

Direct link