Lower bounds on achievable rates for limited bitshift correcting codes
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (5) , 1443-1458
- https://doi.org/10.1109/18.333860
Abstract
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αKeywords
This publication has 15 references indexed in Scilit:
- Bounds on the zero-error capacity of the input-constrained bit-shift channelIEEE Transactions on Information Theory, 1994
- Lower bounds on achievable rates for limited bitshift correcting codesIEEE Transactions on Information Theory, 1994
- A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithmIEEE Transactions on Information Theory, 1993
- Bounds and constructions for runlength-limited error-control block codesIEEE Transactions on Information Theory, 1991
- Upper bounds on error-correcting runlength-limited block codesIEEE Transactions on Information Theory, 1991
- Bounds on the capacity of the bit-shift magnetic recording channelIEEE Transactions on Information Theory, 1991
- Runlength-limited codes for mixed-error channelsIEEE Transactions on Information Theory, 1991
- On the capacity of binary and Gaussian channels with run-length-limited inputsIEEE Transactions on Communications, 1990
- Sliding-block coding for input-restricted channelsIEEE Transactions on Information Theory, 1988
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948