Linear block codes for error detection (Corresp.)
From MaRDI portal
Publication:3966052
DOI10.1109/TIT.1983.1056615zbMATH Open0499.94021MaRDI QIDQ3966052FDOQ3966052
Authors: Tadao Kasami, Torleiv Kløve, Shu Lin
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1188997
- Bounds on the undetected error probabilities of linear codes for both error correction and detection
- Undetected error probabilities of codes for single-error correction and error detection
- On the undetected error probability of linear block codes on channels with memory
- The probability of undetected error when a code is used for error correction and detection (Corresp.)
Linear codes (general theory) (94B05) Bounds on codes (94B65) Error probability in coding theory (94B70)
Cited In (14)
- The undetected error probabilities of combinatorial codes and their dual codes
- Determination of best shortened linear codes
- On the error-detecting performance of some classes of block codes
- Concerning a bound on undetected error probability (Corresp.)
- Codes for error detection.
- Title not available (Why is that?)
- Repeated use of codes for error detection five times is bad
- Title not available (Why is that?)
- Linear Network Error Correction Codes in Packet Networks
- On the probability of undetected error for binary codes used for combined correction and detection
- The probability of undetected error when a code is used for error correction and detection (Corresp.)
- Title not available (Why is that?)
- Detection and recognition of a binary linear code
- On the Probability of Undetected Error for the Maximum Distance Separable Codes
This page was built for publication: Linear block codes for error detection (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966052)