A Single and Adjacent Error Correction Code for Fast Decoding of Critical Bits
From MaRDI portal
Publication:4683243
DOI10.1109/TC.2018.2821688zbMATH Open1433.68133OpenAlexW2795504780MaRDI QIDQ4683243FDOQ4683243
Authors: Kazuteru Namba, Fabrizio Lombardi
Publication date: 20 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2018.2821688
Recommendations
- Optimal codes for single-error correction, double-adjacent-error detection
- Optimal codes for correcting single errors and detecting adjacent errors
- A New Class of Single Burst Error Correcting Codes with Parallel Decoding
- Integer codes correcting single errors and burst asymmetric errors within a byte
- An efficient class of unidirectional error detecting/correcting codes
- Single-trial decoding of concatenated codes using fixed or adaptive erasing
- New single-error-correcting codes
- Efficient codes for correction and/or detection of moderate-density repeated burst errors
- Integer codes correcting single errors and random asymmetric errors within a byte
- scientific article; zbMATH DE number 721705
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)
This page was built for publication: A Single and Adjacent Error Correction Code for Fast Decoding of Critical Bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683243)