DC-free error-correcting codes based on convolutional codes
From MaRDI portal
Publication:4552959
DOI10.1109/26.917767zbMATH Open1017.94027OpenAlexW2134040392MaRDI QIDQ4552959
Publication date: 19 August 2003
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/26.917767
Recommendations
- Error correction by generalized convolutional concatenated codes π π
- Detecting and correcting capabilities of convolutional codes π π
- On upper bounds for the decoding error probability of convolutional codes π π
- Error-trellises for convolutional codes. II: Decoding methods π π
- Constructions of error-correcting DC-free block codes π π
- Bounds on the probability of error for convolutional codes (Corresp.) π π
- DC-free binary convolutional coding π π
- A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4 π π
- On the probability of error of convolutional codes π π
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm π π
This page was built for publication: DC-free error-correcting codes based on convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4552959)