scientific article; zbMATH DE number 3788532
From MaRDI portal
Publication:3966050
The aim of this paper is to characterize the \(0,1\) minimal redundancy codes of length \(n\), detecting \(l\) asymmetric errors. There is proved that for such a code \(C\) all code words \(\xi = (\xi_1,\ldots,\xi_n)\in C\) satisfy \[ \sum_{i=1}^n \xi_i \equiv \alpha\pmod{l+1}. \]
Recommendations
- On the minimal redundancy of binary error-correcting codes
- scientific article; zbMATH DE number 3487348
- Optimal error detection codes for completely asymmetric binary channels
- Asymmetric/unidirectional error correcting and detecting codes
- scientific article; zbMATH DE number 826043
- Minimum-check-density codes for correcting bytes of errors, erasures, or defects
- Optimal codes for minimax criterion on error detection
- Some Codes Correcting Asymmetric Errors of Limited Magnitude
- Redundancies of correction capability optimized Reed-Muller codes
- The Probability of Undetected Error for a Class of Asymmetric Error Detecting Codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966050)