Dept. of Electr. Eng., National Taiwan Univ.MAO-CHAO LIN2007-04-192018-07-062007-04-192018-07-061991-1100135194http://ntur.lib.ntu.edu.tw//handle/246246/2007041910042660https://www.scopus.com/inward/record.uri?eid=2-s2.0-0026259224&doi=10.1049%2fel%3a19911400&partnerID=40&md5=2fdde1ebb3215dcf6b850e59474e2206It is shown that the probabilities of undetected errors for maximum-length codes are upper bounded by (n + 1). 2−(n−k) if the codes are used for correcting every single error and detecting other errors over a binary symmetric channel of which the transition probability is less than 1/2. Moreover, it is shown that binary linear codes with poor distance property do not satisfy the aforementioned bound. © 1991, The Institution of Electrical Engineers. All rights reserved.application/pdf195154 bytesapplication/pdfen-USCodes and coding; Error detection codes; Error-correction codes; Information theoryMathematical Techniques--Error Analysis; Probability; Error probabilities; Maximum-length codes; Undetected errors; Codes, Symbolicjournal article10.1049/el:199114002-s2.0-0026259224http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910042660/1/00109524.pdf