Canonical Encoders for Sliding Block Decoders
From MaRDI portal
Publication:4863977
DOI10.1137/S0895480193244310zbMATH Open0841.68101OpenAlexW1969335396MaRDI QIDQ4863977FDOQ4863977
Jonathan J. Ashley, Brian Marcus
Publication date: 2 July 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480193244310
Graph theory (including graph drawing) in computer science (68R10) Coding theorems (Shannon theory) (94A24)
Cited In (1)
Recommendations
- A linear bound for sliding-block decoder window size. II π π
- Causal sliding block encoders with feedback (Corresp.) π π
- Complexity and sliding-block decodability π π
- Minimum scope for sliding block decoder mappings π π
- Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity π π
This page was built for publication: Canonical Encoders for Sliding Block Decoders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863977)