Publication | Closed Access
On runlength codes
142
Citations
7
References
1988
Year
Input SequencesEngineeringBinary Symmetric ChannelChannel Capacity EstimationCoding TheoryError Correction CodePolar CodesComputational ComplexityChannel CodingComputer ScienceDiscrete MathematicsCombinatorial OptimizationBroadcast ChannelsSoftware AnalysisRunlength CodesLower BoundsVariable-length CodeAlgebraic Coding Theory
Several results on binary (d, k) codes are given. First, a novel derivation for the capacity of these codes based on information-theoretic principles is given. Based on this result the spectrum of a (d, k) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the (d, k) constraint is considered. Lower bounds on the capacity of such a channel are derived.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1