Decoding of second order Reed-Muller codes with a large number of errors

Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel'nikov and A.S. Pershakov algorithm, Problemy Peredachi Informatsii 1992, that has complexity of order n/sup 2/log(n). Experimental results show that the algorithm corrects m...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity (ITW 2005) Rotoruan New Zealand, August 29 - September 1, 2005 s. 3 pp.
Hlavný autor: Bassem Sakkour
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2005
Predmet:
Algorithm design and analysis
Character generation
Communication channels
Encoding
Error correction
Error correction codes
Euclidean distance
Hamming distance
Linearity
Maximum likelihood decoding
ISBN:9780780394803, 0780394801
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel'nikov and A.S. Pershakov algorithm, Problemy Peredachi Informatsii 1992, that has complexity of order n/sup 2/log(n). Experimental results show that the algorithm corrects most error patterns of weight up to n/2(1-e) given that e exceeds n-1/3. This outperforms other decoding algorithms known for RM codes. Decoding performance for known algorithms has been evaluated and the results correspond to asymptotic performance for these algorithms.
AbstractList Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel'nikov and A.S. Pershakov algorithm, Problemy Peredachi Informatsii 1992, that has complexity of order n/sup 2/log(n). Experimental results show that the algorithm corrects most error patterns of weight up to n/2(1-e) given that e exceeds n-1/3. This outperforms other decoding algorithms known for RM codes. Decoding performance for known algorithms has been evaluated and the results correspond to asymptotic performance for these algorithms.
Author Bassem Sakkour
Author_xml – sequence: 1
  surname: Bassem Sakkour
  fullname: Bassem Sakkour
  organization: Ecole Nationale Superieure de Techniques Avancees, Paris, France
BookMark eNotT11LAzEQDKig1nsXfMkfuDObXJrNo9SPFiqFcuBjuUv2auR6J0mL-O8N2GXYHdiZYfeWXY7TSIzdg6gAhH1cNR-VFEJXoBUgygtWWIMiQ9k6t2tWpPQlcimrs-CGLZ_JTT6Mez71PGU-ej5FT5FviXz5fhqGzLOEEv8Jx0_e8qGNe-Lj6dDlTXZRjFNMd-yqb4dExXnOWPP60iyW5Xrztlo8rctgxbG0XtLc1YK0llijVoYIqFaIAAi20-ScANOaHrt5nW831PUoJaEXgA7VjD38xwYi2n3HcGjj7-78rvoD7R1LMg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ITW.2005.1531882
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 1531882
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-9d2e6c40e552848537ee1e438811819b5ecc017a7f8b649787ebf822e8d018c83
IEDL.DBID RIE
ISBN 9780780394803
0780394801
IngestDate Tue Aug 26 19:41:49 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-9d2e6c40e552848537ee1e438811819b5ecc017a7f8b649787ebf822e8d018c83
ParticipantIDs ieee_primary_1531882
PublicationCentury 2000
PublicationDate 20050000
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – year: 2005
  text: 20050000
PublicationDecade 2000
PublicationTitle Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity (ITW 2005) Rotoruan New Zealand, August 29 - September 1, 2005
PublicationTitleAbbrev ITW
PublicationYear 2005
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000395188
Score 1.4280161
Snippet Second order Reed-Muller codes are considered over a binary symmetric channel. We present a modified version of V.M Sidel'nikov and A.S. Pershakov algorithm,...
SourceID ieee
SourceType Publisher
StartPage 3 pp.
SubjectTerms Algorithm design and analysis
Character generation
Communication channels
Encoding
Error correction
Error correction codes
Euclidean distance
Hamming distance
Linearity
Maximum likelihood decoding
Title Decoding of second order Reed-Muller codes with a large number of errors
URI https://ieeexplore.ieee.org/document/1531882
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB3a4sGTSit-swePrs3XZnfPaqmgpUjR3kqyO4GCNJK0_f3ubNKK4MVbJiQhybLMzNt97wHcxgpNZMKCa0yQkz471yISHE2G1hXIWnnh-fcXOZmo-VxPO3C358Igot98hvd06NfybWk2BJUN3ewMXUXYha6UacPV2uMpQaxJW8x35soFJIvSCuzs4ni3TBno4fPsowFU2mf-MlfxuWV09L-3OobBD0mPTffp5wQ6uOrD-NG1kxSzsmA1NbuWeXVN9uau468ktl0x4rHXjCBYlrFP2gvOGmcQugurqqzqAcxGT7OHMW_NEvhSB2uubYSpSQIUwiUcl4MlYohJrBQxS3Uu3FC5yZfJQuUpucpJzAtXHKCyQaiMik-htypXeAZMp1GChRVCSJsYFWUmF65uMVmaIDkVn0OffsLiq5HDWLTff_H36Us49GqnHrW4gt662uA1HJjtellXN34MvwG595fE
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB1qFfSk0orf7sGja_O1ye5ZLS22pUjQ3kqyOwFBGklaf78727QiePGWCUlIsiwz83bfewC3oUQdaL_gCiPkpM_OlQgER52hsQWykk54_nWUTCZyNlPTFtxtuTCI6Daf4T0durV8U-oVQWU9Ozt9WxHuwC45ZzVsrS2i4oWK1MVcby5tQMIojcTOJg43C5We6g3TtzWk0jz1l72Kyy79w_-91xF0f2h6bLpNQMfQwkUHBo-2oaSYlQWrqd01zOlrshd7HR-T3HbFiMleMwJhWcY-aDc4W3uD0F1YVWVVdyHtP6UPA97YJfB35S25MgHGOvJQCJtybBZOEH2MQimJW6pyYQfLTr8sKWQek69cgnlhywOUxvOlluEJtBflAk-BqTiIsDBCiMREWgaZzoWtXHQWR0hexWfQoZ8w_1wLYsyb7z__-_QN7A_S8Wg-Gk6eL-DAaZ86DOMS2stqhVewp7-W73V17cbzG9nOmw0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+IEEE+ITSOC+Information+Theory+Workshop+2005+on+Coding+and+Complexity+%28ITW+2005%29+Rotoruan+New+Zealand%2C+August+29+-+September+1%2C+2005&rft.atitle=Decoding+of+second+order+Reed-Muller+codes+with+a+large+number+of+errors&rft.au=Bassem+Sakkour&rft.date=2005-01-01&rft.pub=IEEE&rft.isbn=9780780394803&rft.spage=3+pp.&rft_id=info:doi/10.1109%2FITW.2005.1531882&rft.externalDocID=1531882
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780394803/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780394803/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780394803/sc.gif&client=summon&freeimage=true