Optimal codes for correcting single errors and detecting adjacent errors
From MaRDI portal
Publication:4014153
DOI10.1109/18.144716zbMATH Open0775.94113OpenAlexW2163265741MaRDI QIDQ4014153FDOQ4014153
Authors: Tuvi Etzion
Publication date: 11 October 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.144716
Recommendations
Cited In (12)
- Title not available (Why is that?)
- Optimal codes for minimax criterion on error detection
- New optimal error-correcting codes for crosstalk avoidance in on-chip data buses
- Codes of length two correcting single errors of limited size
- Title not available (Why is that?)
- A Single and Adjacent Error Correction Code for Fast Decoding of Critical Bits
- Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
- Near optimal single-track Gray codes
- Codes for detecting and correcting propagation errors
- Efficient Error-Correcting Codes for Sliding Windows
- Title not available (Why is that?)
- Optimal codes for single-error correction, double-adjacent-error detection
This page was built for publication: Optimal codes for correcting single errors and detecting adjacent errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014153)