{"id":"https://openalex.org/W2108824410","doi":"https://doi.org/10.1109/isit.2004.1365559","title":"Minimum basis search algorithm for nearly maximum likelihood decoding of block codes","display_name":"Minimum basis search algorithm for nearly maximum likelihood decoding of block codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2108824410","doi":"https://doi.org/10.1109/isit.2004.1365559","mag":"2108824410"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},"type":"article","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/A5049912160","display_name":"M. Ben-Yishai","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"M. Ben-Yishai","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","Sch. of Electr. Eng., Tel-Aviv Univ., Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Sch. of Electr. Eng., Tel-Aviv Univ., Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000375702","display_name":"J. Snyders","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"J. Snyders","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","Sch. of Electr. Eng., Tel-Aviv Univ., Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Sch. of Electr. Eng., Tel-Aviv Univ., Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049912160"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11921692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"58 a","issue":null,"first_page":"522","last_page":"522"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6935375928878784},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6551433801651001},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6069849729537964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5731908679008484},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5572404265403748},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5138835906982422},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5126672983169556},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.45443999767303467},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45103535056114197},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44567206501960754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4375728368759155},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3050249218940735},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.28618717193603516},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.27367067337036133},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.2668275237083435}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6935375928878784},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6551433801651001},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6069849729537964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5731908679008484},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5572404265403748},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5138835906982422},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5126672983169556},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.45443999767303467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45103535056114197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44567206501960754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4375728368759155},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3050249218940735},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.28618717193603516},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.27367067337036133},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.2668275237083435},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365559","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2096070773","https://openalex.org/W2138779125"],"related_works":["https://openalex.org/W2350442631","https://openalex.org/W2367967120","https://openalex.org/W2883494139","https://openalex.org/W2148762366","https://openalex.org/W2052368793","https://openalex.org/W1978153242","https://openalex.org/W2744658369","https://openalex.org/W4302175014","https://openalex.org/W2952823298","https://openalex.org/W1624259157"],"abstract_inverted_index":{"With":[0],"any":[1],"parity":[2],"check":[3],"matrix":[4],"H":[5],"of":[6,22,26,44,58,68],"a":[7,13,31,41],"code":[8],"C(n,k,d)":[9],"one":[10],"may":[11],"associate":[12],"graph":[14,47,61],"whose":[15],"vertices":[16],"represent":[17],"distinct":[18],"bases,":[19],"i.e.,":[20],"sets":[21],"n-k":[23],"independent":[24],"columns":[25],"H.":[27],"Such":[28],"basis":[29],"specifies":[30],"unique":[32],"error":[33,50],"pattern.":[34],"A":[35],"search":[36,70],"is":[37],"carried":[38],"out":[39],"over":[40],"limited":[42],"part":[43],"the":[45,53,59,66,69,76,85],"bases":[46,60],"for":[48,75,84],"an":[49],"pattern":[51],"having":[52],"minimum":[54],"confidence":[55],"value.":[56],"Properties":[57],"are":[62,73],"utilized":[63],"to":[64],"reduce":[65],"complexity":[67,80],"procedure.":[71],"Bounds":[72],"derived":[74],"worst":[77],"case":[78],"computational":[79],"as":[81,83],"well":[82],"correct-decoding":[86],"probability.":[87]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}