Block codes for a class of constrained noiseless channels
From MaRDI portal
Publication:5652533
DOI10.1016/S0019-9958(70)90369-4zbMATH Open0241.94010MaRDI QIDQ5652533FDOQ5652533
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)
Cited In (9)
- Links between complexity theory and constrained block coding
- Performance of binary block codes at low signal-to-noise ratios
- Noisy Constrained Capacity for BSC Channels
- On volumes of spheres for the stem distance
- Lossless sliding-block compression of constrained systems
- Fast enumeration algorithm for words with given constraints on run lengths of ones
- Distribution of patterns of constrained length in binary sequences
- Block-definition approaches to source coding with a fidelity criterion
- Chains, entropy, coding
Recommendations
- Construction of Bounded Delay Codes for Discrete Noiseless Channels π π
- Coding theorems for the nonsynchronized channel π π
- On synchronous variable length coding for discrete noiseless chrannels π π
- A simple derivation of the coding theorem and some applications π π
- A new approach to constructing optimal block codes for runlength-limited channels π π
This page was built for publication: Block codes for a class of constrained noiseless channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5652533)