A survey on proper codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2074251
- Sufficient conditions for interval properness of linear error detecting codes
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
- The MMD codes are proper for error detection
- Sufficient conditions for good and proper error-detecting codes
Cites work
- A characterization of certain Griesmer codes: MMD codes in a more general sense
- A characterization of MMD codes
- Almost MDS codes
- Almost-MDS and near-MDS codes for error detection
- Binomial moments of the distance distribution and the probability of undetected error.
- Binomial moments of the distance distribution: bounds and applications
- Codes of small defect
- Concerning a bound on undetected error probability (Corresp.)
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- Extended binomial moments of a linear code and the undetected error probability
- scientific article; zbMATH DE number 1001631 (Why is no real title available?)
- scientific article; zbMATH DE number 1189048 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1498783 (Why is no real title available?)
- scientific article; zbMATH DE number 1505483 (Why is no real title available?)
- scientific article; zbMATH DE number 2154102 (Why is no real title available?)
- scientific article; zbMATH DE number 6433928 (Why is no real title available?)
- Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)
- Maximum distance<tex>q</tex>-nary codes
- Necessary conditions for good error detection
- On near-MDS codes
- On repeated-root cyclic codes
- On some properties of the undetected error probability of linear codes (Corresp.)
- On the inherent intractability of certain coding problems (Corresp.)
- On the performance of the ternary [13, 7, 5] quadratic-residue code
- On the Probability of Undetected Error for Linear Block Codes
- On the Probability of Undetected Error for the Maximum Distance Separable Codes
- On the undetected error probability of triple-error-correcting BCH codes
- Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
- Optimum cyclic redundancy codes for noisy channels (Corresp.)
- Reed-Muller codes for error detection: the good, the bad, and the ugly
- Sufficient conditions for good and proper error-detecting codes
- The MMD codes are proper for error detection
Cited in
(12)- Information-bit error rate and false positives in an MDS code
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
- On the error-detecting performance of some classes of block codes
- A sufficient condition for properness of a linear error-detecting code and its dual
- Sufficient conditions for interval properness of linear error detecting codes
- Error detection with a class of cyclic codes
- The duals of mmd codes are proper for error detection
- scientific article; zbMATH DE number 176151 (Why is no real title available?)
- scientific article; zbMATH DE number 2074251 (Why is no real title available?)
- The MMD codes are proper for error detection
- Good error-detection codes satisfying the expurgated bound
- On the undetected error probability of binary expansions of Reed-Solomon codes
This page was built for publication: A survey on proper codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900373)
