Error detection capability of shortened Hamming codes and their dual codes.

DOI10.1007/BF02679894zbMATH Open1118.94322OpenAlexW1964591613MaRDI QIDQ1582575FDOQ1582575

Shutaong Xia, Fangwei Fu

Publication date: 15 October 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02679894

zbMATH Keywords

Hamming codescombinatorial codessimplex codesundetected error probabilityError detection

Mathematics Subject Classification ID

Combinatorial codes (94B25) Error probability in coding theory (94B70)

Cites Work

• Title not available (Why is that?)
• Dimension/length profiles and trellis complexity of linear block codes
• On the minimum distance of combinatorial codes
• On the monotonic property of the probability of undetected error for a shortened code
• Necessary conditions for good error detection

Cited In (2)

• Determination of best shortened linear codes
• On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory

   Recommendations

• On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory 👍 👎
• Undetected error probabilities of codes for single-error correction and error detection 👍 👎
• On the probability of undetected error for binary codes used for combined correction and detection 👍 👎
• Concerning a bound on undetected error probability (Corresp.) 👍 👎
• On the monotonic property of the probability of undetected error for a shortened code 👍 👎

This page was built for publication: Error detection capability of shortened Hamming codes and their dual codes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582575)