Constructions of error-correcting DC-free block codes
From MaRDI portal
Recommendations
- A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4
- DC-free codes of rate (n-1)/n, n odd
- DC-free error-correcting codes based on convolutional codes
- Constructing efficient DC-free runlength-limited block codes for recording channels
- DC-free coset codes
Cited in
(16)- Incomplete sums, DC-constrained codes, and codes that maintain synchronization
- DC-free coset codes
- The (d,k) subcode of a linear block code
- scientific article; zbMATH DE number 820491 (Why is no real title available?)
- scientific article; zbMATH DE number 910951 (Why is no real title available?)
- scientific article; zbMATH DE number 4102986 (Why is no real title available?)
- Upper bounds and Hamming spheres under the DC constraint
- DC-free binary convolutional coding
- DC-free codes of rate (n-1)/n, n odd
- Constructing efficient DC-free runlength-limited block codes for recording channels
- DC-free error-correcting codes based on convolutional codes
- A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4
- Optimal block codes for M-ary runlength-constrained channels
- Tilings of \(\mathcal{H}_q(n,w)\) with optimal \((n,d,w)_q\)-codes
- scientific article; zbMATH DE number 3891247 (Why is no real title available?)
- A new approach to constructing optimal block codes for runlength-limited channels
This page was built for publication: Constructions of error-correcting DC-free block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489934)
