IEEE Transactions on Information Theory · 1991 · 45 citations · 12 references
EngineeringComputer EngineeringComputer ScienceDigital CommunicationInformation TheoryTheory Of ComputationChannel CodingCoding TheoryError Control CodingError-correcting CodesBounds On CodesCode BoundsError CodesHamming DistanceLower Bound TechniquesLower BoundsMinimum DistanceMinimum Distance Bounds
Runlength-limited (RLL) and digital-sum-limited (DSL) codes are considered. For these codes the finite and asymptotic lower bounds on achievable rates for the given minimum Hamming distance are derived. Using generating functions and trellis diagram techniques, the authors prove the existence of RLL- and DSL-codes of rate R and minimum distance d= delta n, such that R>or=2.log lambda /sub 1/(0)-min(log lambda /sub 1/(z)- delta .log z), 0<or=z<or=1, for large enough code length n. The value lambda /sub 1/(z) is the maximum modulus eigenvalue of a certain matrix that is dependent on the limitations and some parameter z. The bounds for the limited codes improve the lower bound of H. C. Ferreira (1984).<<ETX>>
12
Information Theory and Reliable Communication
David A. Bell · Electronics and Power · 1969 · 4K citations
Ephraim Zehavi, J.K. Wolf · IEEE Transactions on Information Theory · 1988 · 144 citations