By Topic

Constructive codes with unequal error protection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Englund, E.K. ; Nat. Defence Res. Establ., Linkoping, Sweden ; Hansson, A.I.

An asymptotic lower bound on the rates of two-level binary codes with unequal error protection is presented. The bound is based on a class of codes that are constructive in the sense that the description complexity is polynomial in the codeword length. In some cases, the bound exceeds an upper bound for linear codes, proving the existence of constructive nonlinear UEP codes that are better than any linear codes

Published in:

Information Theory, IEEE Transactions on  (Volume:43 ,  Issue: 2 )