Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Lower bounds on achievable rates for limited bitshift correcting codes

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)
Kolesnik, V.D. ; St. Petersburg Acad. of Aerospace Instrum., Russia ; Krachkovsky, V.Yu.

Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance dBS of a code. For a given δ=dBS/n, where n is the code length, the achievable code rate Rα is lower bounded. We prove the existence of codes of rate R⩾Rα

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 5 )