A Method to determine Partial Weight Enumerator for Linear Block Codes

A Method to determine Partial Weight Enumerator for Linear Block Codes

In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood dec...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Nouh, Said, Aylaj, Bouchaib, Belkasmi, Mostafa
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Theory
Mathematics - Information Theory
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Nouh, Said
Aylaj, Bouchaib
Belkasmi, Mostafa
description In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical performances of the BCH(130,66), BCH(103,47) and BCH(111,55) shortened codes; the first code is obtained by shortening the binary primitive BCH (255,191,17) code and the two other codes are obtained by shortening the binary primitive BCH(127,71,19) code. The weight distributions of these three codes are unknown at our knowledge.
doi_str_mv 10.48550/arxiv.1212.6086
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1212_6086</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1212_6086</sourcerecordid><originalsourceid>FETCH-LOGICAL-a656-b0ea2eaedf49f5cc2d4c9fc322ac84df3d5ba9bf4847a9d3043aeff31f02b6cb3</originalsourceid><addsrcrecordid>eNotz71OwzAUBWAvDKiwMyG_QILjP5KxRC0gpYKhEmN0bd9LLZIauQbB29MCw9FZjo70MXbViFq3xogbyF_xs25kI2srWnvO1ku-wbJLgZfEAxbMc9wjf4ZcIkz8BePrrvDV_mPGDCVlTscMxwlkfjcl_8b7FPBwwc4IpgNe_veCbderbf9QDU_3j_1yqMAaWzmBIBEwkO7IeC-D9h15JSX4VgdSwTjoHOlW30IXlNAKkEg1JKSz3qkFu_67_XWM7znOkL_Hk2c8edQPfs5GiA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Method to determine Partial Weight Enumerator for Linear Block Codes</title><source>arXiv.org</source><creator>Nouh, Said ; Aylaj, Bouchaib ; Belkasmi, Mostafa</creator><creatorcontrib>Nouh, Said ; Aylaj, Bouchaib ; Belkasmi, Mostafa</creatorcontrib><description>In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical performances of the BCH(130,66), BCH(103,47) and BCH(111,55) shortened codes; the first code is obtained by shortening the binary primitive BCH (255,191,17) code and the two other codes are obtained by shortening the binary primitive BCH(127,71,19) code. The weight distributions of these three codes are unknown at our knowledge.</description><identifier>DOI: 10.48550/arxiv.1212.6086</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2012-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1212.6086$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1212.6086$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Nouh, Said</creatorcontrib><creatorcontrib>Aylaj, Bouchaib</creatorcontrib><creatorcontrib>Belkasmi, Mostafa</creatorcontrib><title>A Method to determine Partial Weight Enumerator for Linear Block Codes</title><description>In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical performances of the BCH(130,66), BCH(103,47) and BCH(111,55) shortened codes; the first code is obtained by shortening the binary primitive BCH (255,191,17) code and the two other codes are obtained by shortening the binary primitive BCH(127,71,19) code. The weight distributions of these three codes are unknown at our knowledge.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUBWAvDKiwMyG_QILjP5KxRC0gpYKhEmN0bd9LLZIauQbB29MCw9FZjo70MXbViFq3xogbyF_xs25kI2srWnvO1ku-wbJLgZfEAxbMc9wjf4ZcIkz8BePrrvDV_mPGDCVlTscMxwlkfjcl_8b7FPBwwc4IpgNe_veCbderbf9QDU_3j_1yqMAaWzmBIBEwkO7IeC-D9h15JSX4VgdSwTjoHOlW30IXlNAKkEg1JKSz3qkFu_67_XWM7znOkL_Hk2c8edQPfs5GiA</recordid><startdate>20121225</startdate><enddate>20121225</enddate><creator>Nouh, Said</creator><creator>Aylaj, Bouchaib</creator><creator>Belkasmi, Mostafa</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20121225</creationdate><title>A Method to determine Partial Weight Enumerator for Linear Block Codes</title><author>Nouh, Said ; Aylaj, Bouchaib ; Belkasmi, Mostafa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a656-b0ea2eaedf49f5cc2d4c9fc322ac84df3d5ba9bf4847a9d3043aeff31f02b6cb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Nouh, Said</creatorcontrib><creatorcontrib>Aylaj, Bouchaib</creatorcontrib><creatorcontrib>Belkasmi, Mostafa</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nouh, Said</au><au>Aylaj, Bouchaib</au><au>Belkasmi, Mostafa</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Method to determine Partial Weight Enumerator for Linear Block Codes</atitle><date>2012-12-25</date><risdate>2012</risdate><abstract>In this paper we present a fast and efficient method to find partial weight enumerator (PWE) for binary linear block codes by using the error impulse technique and Monte Carlo method. This PWE can be used to compute an upper bound of the error probability for the soft decision maximum likelihood decoder (MLD). As application of this method we give partial weight enumerators and analytical performances of the BCH(130,66), BCH(103,47) and BCH(111,55) shortened codes; the first code is obtained by shortening the binary primitive BCH (255,191,17) code and the two other codes are obtained by shortening the binary primitive BCH(127,71,19) code. The weight distributions of these three codes are unknown at our knowledge.</abstract><doi>10.48550/arxiv.1212.6086</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1212.6086
ispartof
issn
language eng
recordid cdi_arxiv_primary_1212_6086
source arXiv.org
subjects Computer Science - Information Theory
Mathematics - Information Theory
title A Method to determine Partial Weight Enumerator for Linear Block Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T06%3A33%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Method%20to%20determine%20Partial%20Weight%20Enumerator%20for%20Linear%20Block%20Codes&rft.au=Nouh,%20Said&rft.date=2012-12-25&rft_id=info:doi/10.48550/arxiv.1212.6086&rft_dat=%3Carxiv_GOX%3E1212_6086%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true