Access the full text.
Sign up today, get DeepDyve free for 14 days.
T. Fujiwara, T. Kasami, Shou-ping Feng (1991)
On the monotonic property of the probability of undetected error for a shortened codeIEEE Trans. Inf. Theory, 37
J. Forney (1994)
Dimension/length profiles and trellis complexity of linear block codesIEEE Trans. Inf. Theory, 40
P. Perry (1991)
Necessary conditions for good error detectionIEEE Trans. Inf. Theory, 37
T. Kløve, V. Korzhik (1995)
Error detecting codes : general theory and their applications in feedback communication systems
V.C.Da. Rocha (1985)
Combinatorial CodesElectronics Letter, 21
L. Tolhuizen, J. Lint (1990)
On the minimum distance of combinatorial codesIEEE Trans. Inf. Theory, 36
The undetected error probability and error detection capability of shortened Hamming codes and their dual codes are studied in this paper. We also obtain some interesting properties for the shortened Simplex codes.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 18, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.