{"id":"https://openalex.org/W2140631554","doi":"https://doi.org/10.1109/isit.2009.5205846","title":"Valid inequalities for binary linear codes","display_name":"Valid inequalities for binary linear codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2140631554","doi":"https://doi.org/10.1109/isit.2009.5205846","mag":"2140631554"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5081495032","display_name":"Ak\u0131n Tanatmis","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Akin Tanatmis","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","Department of Mathematics, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107846021","display_name":"Stefan Ruzika","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Ruzika","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","Department of Mathematics, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111683448","display_name":"Horst W. Hamacher","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Horst W. Hamacher","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","Department of Mathematics, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060691866","display_name":"Mayur Punekar","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mayur Punekar","raw_affiliation_strings":["Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","Microelectronic Systems Design Research Group, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany"],"affiliations":[{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042874331","display_name":"Frank Kienle","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Kienle","raw_affiliation_strings":["Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","Microelectronic Systems Design Research Group, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany"],"affiliations":[{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059285190","display_name":"Norbert Wehn","orcid":"https://orcid.org/0000-0002-9010-086X"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Norbert Wehn","raw_affiliation_strings":["Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","Microelectronic Systems Design Research Group, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany"],"affiliations":[{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"Microelectronic Systems Design Research Group, University of Kaiserslautern, Erwin-Schroedinger-Strasse, 67663, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5081495032"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":2.0571,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88246611,"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":"2216","last_page":"2220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7493758201599121},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7090354561805725},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6685314178466797},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5835552215576172},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5776219367980957},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5748400092124939},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5090610384941101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48817044496536255},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.48431482911109924},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47740688920021057},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.4732951521873474},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4617147445678711},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41501322388648987},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4131760597229004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4024847745895386},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32711660861968994},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.26136183738708496},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10688653588294983}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7493758201599121},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7090354561805725},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6685314178466797},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5835552215576172},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5776219367980957},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5748400092124939},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5090610384941101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48817044496536255},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.48431482911109924},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47740688920021057},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.4732951521873474},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4617147445678711},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41501322388648987},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4131760597229004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4024847745895386},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32711660861968994},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.26136183738708496},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10688653588294983},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1652876111","https://openalex.org/W1875056259","https://openalex.org/W2035929826","https://openalex.org/W2140250923","https://openalex.org/W2140459655","https://openalex.org/W2141555819","https://openalex.org/W2163264905","https://openalex.org/W2169134868","https://openalex.org/W2170915934","https://openalex.org/W2175504530","https://openalex.org/W2180587738","https://openalex.org/W2570173562","https://openalex.org/W2951867507","https://openalex.org/W2952346284","https://openalex.org/W2952953400","https://openalex.org/W6639344520"],"related_works":["https://openalex.org/W1983452362","https://openalex.org/W2793186576","https://openalex.org/W1971080259","https://openalex.org/W2010561961","https://openalex.org/W4283805567","https://openalex.org/W2039750302","https://openalex.org/W2366009615","https://openalex.org/W3153682296","https://openalex.org/W1723747798","https://openalex.org/W2171753105"],"abstract_inverted_index":{"We":[0,70],"study":[1],"an":[2,56],"integer":[3,57],"programming":[4,58],"(IP)":[5],"based":[6],"separation":[7],"approach":[8],"to":[9,33,60],"find":[10],"the":[11,38,46,49,62,73,77,83,89],"maximum":[12],"likelihood":[13],"(ML)":[14],"codeword":[15],"for":[16],"binary":[17,67],"linear":[18,68],"codes.":[19],"An":[20],"algorithm":[21],"introduced":[22],"in":[23],"Tanatmis":[24],"et":[25],"al.":[26],"is":[27,43,101],"extended":[28],"and":[29,48,82],"improved":[30],"with":[31],"respect":[32],"decoding":[34],"performance":[35],"without":[36],"increasing":[37],"worst":[39],"case":[40],"complexity.":[41],"This":[42],"demonstrated":[44],"on":[45],"LDPC":[47,80],"BCH":[50],"code":[51,81],"classes.":[52],"Moreover,":[53],"we":[54],"propose":[55],"formulation":[59],"calculate":[61],"minimum":[63,74,90],"distance":[64,75,91],"of":[65,76,92,98],"a":[66,93,95],"code.":[69,87],"exemplarily":[71],"compute":[72],"(204,":[78],"102)":[79],"(576,":[84],"288)":[85],"WIMAX":[86],"Using":[88],"code,":[94],"new":[96],"class":[97],"valid":[99],"inequalities":[100],"introduced.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}