{"id":"https://openalex.org/W3011923935","doi":"https://doi.org/10.1109/icac347590.2019.9036747","title":"Decoding Algorithm for Modified Linear Block Code with Syndrome Polynomial","display_name":"Decoding Algorithm for Modified Linear Block Code with Syndrome Polynomial","alternate_titles":[],"publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3011923935","doi":"https://doi.org/10.1109/icac347590.2019.9036747","mag":"3011923935"},"language":"en","primary_location":{"id":"doi:10.1109/icac347590.2019.9036747","doi":"https://doi.org/10.1109/icac347590.2019.9036747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icac347590.2019.9036747","pdf_url":null,"source":{"id":"https://openalex.org/S7407087643","display_name":"International Conference on Advances in Computing, Communication and Control (ICAC3)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Advances in Computing, Communication and Control (ICAC3)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W3011923935"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003499240","display_name":"Seema Talmale","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Seema Talmale","raw_affiliation_strings":["Department of Electronics Engineering, Faculty K.J.Somaiya College of Engineering and Rsearch Scholar, Fr.CRCE. Bandra (W), Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, Faculty K.J.Somaiya College of Engineering and Rsearch Scholar, Fr.CRCE. Bandra (W), Mumbai, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080103749","display_name":"Srija Unnikrishnan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Srija Unnikrishnan","raw_affiliation_strings":["Department of Electronics Engineering, Fr. CRCE. Bandra (W), Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, Fr. CRCE. Bandra (W), Mumbai, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018141873","display_name":"B. K. Lande","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"B.K. Lande","raw_affiliation_strings":["Department of Electronics Engineering, DMCE, Airoli, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, DMCE, Airoli, Mumbai, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8734999895095825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.8734999895095825,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.12559999525547028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-algorithms","display_name":"decoding algorithms","score":0.800000011920929},{"id":"https://openalex.org/keywords/perfect-codes","display_name":"perfect codes","score":0.8119999766349792},{"id":"https://openalex.org/keywords/minimum-hamming-distance","display_name":"minimum Hamming distance","score":0.7089999914169312},{"id":"https://openalex.org/keywords/error-correcting-codes","display_name":"error-correcting codes","score":0.675000011920929},{"id":"https://openalex.org/keywords/linear-codes","display_name":"linear codes","score":0.5950000286102295},{"id":"https://openalex.org/keywords/multiple-solutions","display_name":"multiplicity of solutions","score":0.35199999809265137}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8478617668151855},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7333065867424011},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6669460535049438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6548714637756348},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.6168357729911804},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5832939743995667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5545600056648254},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.546615481376648},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5340691208839417},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5212138891220093},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48614808917045593},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.48535504937171936},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4590297043323517},{"id":"https://openalex.org/C73666251","wikidata":"https://www.wikidata.org/wiki/Q5310189","display_name":"Dual code","level":5,"score":0.45771825313568115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32554253935813904},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30625832080841064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2254570722579956},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08859732747077942},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icac347590.2019.9036747","doi":"https://doi.org/10.1109/icac347590.2019.9036747","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icac347590.2019.9036747","pdf_url":null,"source":{"id":"https://openalex.org/S7407087643","display_name":"International Conference on Advances in Computing, Communication and Control (ICAC3)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Advances in Computing, Communication and Control (ICAC3)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1562436439","https://openalex.org/W2042035018","https://openalex.org/W2120868534","https://openalex.org/W2135964784","https://openalex.org/W2140899540","https://openalex.org/W2283496439","https://openalex.org/W2794336776","https://openalex.org/W2920924303","https://openalex.org/W2963609343","https://openalex.org/W4252446463"],"related_works":["https://openalex.org/W4409144491","https://openalex.org/W4408242649","https://openalex.org/W2586975884","https://openalex.org/W2141179382","https://openalex.org/W2228515601","https://openalex.org/W2920924303","https://openalex.org/W567535138","https://openalex.org/W2277789380","https://openalex.org/W2320664861","https://openalex.org/W2955457959"],"abstract_inverted_index":{"This":[0],"article":[1],"gives":[2],"the":[3,16,54,60,97,103,111],"encoding":[4],"and":[5,42,65,92,107],"decoding":[6,49,68],"methodology":[7],"for":[8,25,78,89],"a":[9,20,45],"Modified":[10],"Linear":[11,71],"Block":[12,72],"Code":[13],"(MLBC)":[14],"from":[15,53],"solution":[17],"space":[18],"of":[19,62,96,105],"completely":[21],"controllable":[22],"discrete-time":[23],"system":[24,58,85],"any":[26],"k":[27],"length":[28],"message":[29],"bits.":[30],"Such":[31],"an":[32],"established":[33],"code":[34,41,75],"is":[35,44,51,76,100],"(n,":[36],"k)":[37],"linear":[38],"modified":[39],"block":[40],"it":[43],"perfect":[46],"code.":[47],"The":[48,57,74,84,94],"algorithm":[50],"developed":[52],"syndrome":[55],"polynomial.":[56],"avoids":[59],"limitation":[61],"multiple":[63],"solutions":[64],"Maximum":[66],"Likelihood":[67],"associated":[69],"with":[70,102],"Codes.":[73],"designed":[77],"minimum":[79],"Hamming":[80],"distance,":[81],"dminof":[82],"3.":[83],"can":[86],"be":[87],"generalized":[88],"dmin=":[90],"4":[91],"above.":[93],"performance":[95],"said":[98],"MLBC":[99],"evaluated":[101],"help":[104],"simulation":[106],"check":[108],"on":[109],"all":[110],"bit":[112],"positional":[113],"errors":[114],"has":[115],"been":[116],"carried":[117],"out.":[118]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3011923935","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2020-03-23T00:00:00"}
