Sliding-Block Decodable Encoders Between<tex>(d,k)</tex>Runlength-Limited Constraints of Equal Capacity
From MaRDI portal
Publication:3547100
Recommendations
- Sliding block codes between constrained systems
- Canonical Encoders for Sliding Block Decoders
- Optimal block-type-decodable encoders for constrained systems
- A linear bound for sliding-block decoder window size
- Complexity and sliding-block decodability
- Sliding block codes between shift spaces over infinite alphabets
- Constructions of almost block-decodable runlength-limited codes
- A linear bound for sliding-block decoder window size. II
- A new approach to constructing optimal block codes for runlength-limited channels
- Sliding-block source coding
Cited in
(10)- Sliding block codes between shift spaces over infinite alphabets
- Capacity achieving code constructions for two classes of (d,k) constraints
- A linear bound for sliding-block decoder window size
- Sliding block codes between constrained systems
- Equalities among Capacities of (d,k)-Constrained Systems
- Nested block decodable runlength-limited codes
- Topological entropies of a class of constrained systems
- Optimal block-type-decodable encoders for constrained systems
- Canonical Encoders for Sliding Block Decoders
- Stabilization of Block-Type-Decodability Properties for Constrained Systems
This page was built for publication: Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547100)