Probability Of Undetected Error Reed Solomon
(1988) The undetected error probability for Reed-Solomon codes. In: Conference record: MILCOM 88: 21st century military communications - what's possible? IEEE , Piscataway, NJ , pp. 163-167. ISBN 70783857 http://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345 Preview PDF - Published Version See Usage Policy. 238KbUse this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345AbstractThis paper is an extension of a recent paper by McEliece and Swanson dealing with the decoder error probability for Reed-Solomon codes {more generally, linear MDS codes). McEliece and Swanson offered an upper bound on P_E(u), the decoder error probability given u symbol errors occur. In this paper, by using combinatoric technique like the principle of inclusion and exclusion, an exact formula for P_E(u) is derived. The P_E(u) of an MDS code is observed to approach Q rapidly as u gets large, where Q is the probability that a compltely random error pattern will cause decoder error. An upper bound for the expression │P_E(u)/Q-1│ is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P_E(u) indeed approaches Q as u becomes large, and some laws of large number come info play somehow.Item Type:Book SectionRelated URLs:URLURL TypeDescriptionhttp://dx.doi.org/10.1109/MILCOM.1988.13385 DOIUNSPECIFIEDhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=13385PublisherUNSPECIFIEDAdditional Information:© 1988 IEEE. Date of Current Version: 06 August 2002. This work was supported in part by the National Aeronautics and Space Administration under Grant NAS7-918 and in part by the Air Force Office of Scientific Research Grant AFOSR-83-0296.Funders:Funding AgencyGrant NumberNASANAS7-918Air Force Office of Scientific Research (AFOSR)AFOSR-83-0296Other Numbering System:Other Numbering System NameOther Numbering System IDINSPEC Accession Number3338385Record Number:CaltechAUTHORS:20120216-080309345Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20120216-080309345Official Citation:Kar-Ming Cheung; McEliece, R.J.; , "The undetected error probability for Reed-Solomon codes," Military Communications Conference, 1988. MILCOM 88, Conference record. '21st Century Military Communications - What's Possible?'. 1988 IEEE , vol., no., pp.163-167 vol.1, 23-26 Oct 1988 doi: 10.1109/MILCOM.1988.13385 URL: http://ieeexplore.ieee.org/stamp/
to ensure that javascript is enabled. › Learn How NASA Technical Reports Server (NTRS) Providing Access to NASA's Technology, Research, and Science › Advanced Search Main menu Skip to content BASIC SEARCH ADVANCED SEARCH ABOUT NTRS NTRS NEWS OAI HARVEST SEARCH TIPS CONTACT / HELP Record Details ‹Return to Search Results ‹Previous Record | ›Next Record ›Printable View Text Size Grow Text Size Shrink Text Size Record 1 of 1 Share Send The undetected error probability for Reed-Solomon codes Author and Affiliation: Cheung, Kar-Ming(Jet Propulsion Lab., California Inst. of Tech., Pasadena, CA, United States);Mceliece, Robert J.(California http://authors.library.caltech.edu/29326/ Institute of Technology, Jet Propulsion Laboratory, Pasadena, United States) Abstract: McEliece and Swanson (1986) offered an upper bound on P(E)u, the decoder error probability given u symbol errors occur. In the present study, by using a combinatoric technique such as the principle of inclusion and exclusion, an exact formula for P(E)u is derived. The P(E)u of a maximum distance separable code is observed to approach Q rapidly as http://ntrs.nasa.gov/search.jsp?R=19890036661 u gets large, where Q is the probability that a completely random error pattern will cause decoder error. An upper bound for the expansion P(E)u/Q - 1 is derived, and is shown to decrease nearly exponentially as u increases. This proves analytically that P(E)u indeed approaches Q as u becomes large, and that some laws of large number come into play. Publication Date: Jan 01, 1988 Document ID: 19890036661 (Acquired Nov 28, 1995) Accession Number: 89A24032 Subject Category: COMMUNICATIONS AND RADAR Document Type: Conference Paper Publication Information: (SEE A89-24026 08-32) Publisher Information: United States Meeting Information: MILCOM '88 - IEEE Military Communications Conference; Oct. 23-26, 1988; San Diego, CA; United States Contract/Grant/Task Num: NAS7-918; AF-AFOSR-83-0296 Financial Sponsor: NASA; United States Organization Source: Jet Propulsion Lab., California Inst. of Tech.; Pasadena, CA, United States Description: 5p; In English Distribution Limits: Unclassified; Publicly available; Unlimited Rights: Copyright NASA Terms: ERROR DETECTION CODES; PROBABILITY THEORY; SIGNAL ENCODING; CHANNELS (DATA TRANSMISSION); DECODING Imprint And Other Notes: IN: MILCOM '88 - IEEE Military Communications Conference, San Diego, CA, Oct. 23-26, 1988, Conference Record. Volume 1 (A89-24026 08-32). New York, Institute of Electrical and Electronics Engineers, Inc., 1988, p. 163-167. Availability Source: Other Sources ‹Return to Search Re
OA InitiativesOA Policy InformationSite-wide Policies Privacy PolicyPublish/DepositGet Started Now Deposit & Manage Your ContentManage Your Publications BooksConferencesJournalsPreviously Published http://escholarship.org/uc/item/6051p7qf WorksWorking PapersNon-textual MediaBrowse ContentBrowse by Recently AddedMost PopularUC CampusDepartmentJournalsBooksTheses & DissertationsPreviously Published WorksAuthorDateHelpGet help with Managing Your ContentContent on the SiteTechnical ResourcesResources for LibrariansAuthorsPublication Policies Content GuidelinesCopyright & LegalPeer ReviewContent RemovalAccess & PreservationContact UsMy AccountMy Saved Items (0)eScholarship probability of requires Javascript to be enabled in your browser.Previously Published WorksUC San DiegoDownload PDFShow AbstractEmailShareCiteSaveof 8Email ItemAddress: Multiple emails? Use commas.CitationHan, Junsheng S; Siegel, Paul H; & Lee, Patrick. (2006). On the probability of undetected error for overextended Reed-Solomon codes. IEEE probability of undetected Transactions on Information Theory, 52(8), 3662 - 3669. UC San Diego: Retrieved from: http://escholarship.org/uc/item/6051p7qfExport to EndnoteAbstract Upper and lower bounds on the weight distribution of overextended Reed-Solomon (OERS) codes are derived, from which tight upper and lower bounds on the probability of undetected error for OERS codes are obtained for q-ary symmetric channels. ShareFacebookTwitterCiteULikeDiggDeliciousGoogle BookmarksStumbleUponMendeleyWARNING: eScholarship requires Javascript to be enabled in your browser.8Follow eScholarship on Document Info Search Document Table of Contents Supporting MaterialDocument MetricsJournal InfoSimilar Items Peer ReviewedTitle:On the probability of undetected error for overextended Reed-Solomon codesJournal Issue:IEEE Transactions on Information Theory, 52(8)Author:Han, Junsheng S, University of California, San Diego; Siegel, Paul H, University of California, San Diego; Lee, PatrickPublication Date:08-01-2006Se