{"id":"https://openalex.org/W2015066643","doi":"https://doi.org/10.1109/isit.2007.4557106","title":"On the Minimum Distance of Generalized LDPC Codes","display_name":"On the Minimum Distance of Generalized LDPC Codes","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2015066643","doi":"https://doi.org/10.1109/isit.2007.4557106","mag":"2015066643"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","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/A5106233582","display_name":"Ayoub Otmani","orcid":"https://orcid.org/0000-0001-8176-8692"},"institutions":[{"id":"https://openalex.org/I194210350","display_name":"\u00c9cole Nationale Sup\u00e9rieure d'Ing\u00e9nieurs de Caen","ror":"https://ror.org/01fpqqe90","country_code":"FR","type":"education","lineage":["https://openalex.org/I194210350","https://openalex.org/I4210105918"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ayoub Otmani","raw_affiliation_strings":["ENSICAEN, Cedex Caen, France","ENSICAEN, Caen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENSICAEN, Cedex Caen, France","institution_ids":["https://openalex.org/I194210350"]},{"raw_affiliation_string":"ENSICAEN, Caen","institution_ids":["https://openalex.org/I194210350"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060302693","display_name":"Jean\u2013Pierre Tillich","orcid":"https://orcid.org/0000-0002-1709-1792"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Pierre Tillich","raw_affiliation_strings":["INRIA, Projet Codes, Le Chesnay, France","INRIA, Projet Codes, BP 105, Domaine de Voluceau, F-78153 Le Chesnay, France. jean-pierre.tillich@inria.fr"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA, Projet Codes, Le Chesnay, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA, Projet Codes, BP 105, Domaine de Voluceau, F-78153 Le Chesnay, France. jean-pierre.tillich@inria.fr","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012202064","display_name":"Iryna Andriyanova","orcid":"https://orcid.org/0000-0002-0258-2687"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Iryna Andriyanova","raw_affiliation_strings":["EPFL, School of Communications & Computer Sciences, Lausanne, Switzerland","EPFL, School of Communications & Computer Sciences, 1015 Lausanne, Switzerland, iryna.andriyanova@epfl.ch"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EPFL, School of Communications & Computer Sciences, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"EPFL, School of Communications & Computer Sciences, 1015 Lausanne, Switzerland, iryna.andriyanova@epfl.ch","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9467,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7129379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.9973000288009644,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8994851112365723},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6690722107887268},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6230760812759399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6106867790222168},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5823112726211548},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5715618133544922},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5172494053840637},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49958300590515137},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4533970355987549},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4202849566936493},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3783673644065857},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3516334295272827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.332768052816391},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3158128559589386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27561041712760925},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.2504098117351532}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8994851112365723},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6690722107887268},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6230760812759399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6106867790222168},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5823112726211548},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5715618133544922},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5172494053840637},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49958300590515137},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4533970355987549},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4202849566936493},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3783673644065857},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3516334295272827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.332768052816391},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3158128559589386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27561041712760925},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.2504098117351532},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1996226010","https://openalex.org/W2043838407","https://openalex.org/W2058374373","https://openalex.org/W2115116691","https://openalex.org/W2122703296","https://openalex.org/W2128552304","https://openalex.org/W2161986283","https://openalex.org/W2165363188","https://openalex.org/W2751862591","https://openalex.org/W2753908209","https://openalex.org/W3140968660","https://openalex.org/W6989240722","https://openalex.org/W7038906009","https://openalex.org/W7048060829"],"related_works":["https://openalex.org/W2808439818","https://openalex.org/W1968533815","https://openalex.org/W2150639697","https://openalex.org/W2126464345","https://openalex.org/W2090897912","https://openalex.org/W2351144917","https://openalex.org/W2142415334","https://openalex.org/W2996745071","https://openalex.org/W2099903672","https://openalex.org/W60780125"],"abstract_inverted_index":{"We":[0,19],"study":[1],"necessary":[2],"conditions":[3,22,30],"which":[4,59,132,137,162],"have":[5,12,54],"to":[6,11,113],"be":[7],"satisfied":[8],"in":[9,26,58,82,106],"order":[10],"LDPC":[13,51,88],"codes":[14,52],"with":[15],"linear":[16,118],"minimum":[17,119],"distance.":[18],"give":[20],"two":[21],"of":[23,66,78,96,122,147,159],"this":[24,27,39,152],"kind":[25],"paper.":[28],"These":[29],"are":[31,43,61,103],"not":[32,44,164],"met":[33],"for":[34,136],"several":[35],"interesting":[36],"code":[37,89,130],"families:":[38],"shows":[40],"that":[41,53],"they":[42],"asymptotically":[45,134],"good.":[46],"The":[47],"second":[48,110,167],"one":[49],"concerns":[50],"a":[55,84,97,129,140,156,160],"Tanner":[56],"graph":[57],"there":[60,102,138],"cycles":[62,105],"linking":[63,142],"variable":[64,145],"nodes":[65,146],"degree":[67,148],"2":[68,149],"together":[69],"and":[70,100],"provides":[71],"some":[72,79],"insight":[73],"about":[74],"the":[75,87,94,107,109,117,123,144,166],"combinatorial":[76],"structure":[77],"low-weight":[80],"codewords":[81],"such":[83,104],"case.":[85],"When":[86],"family":[90,131,153,161],"is":[91,126,133,139,154],"obtained":[92],"from":[93],"lifts":[95],"given":[98],"protograph":[99],"if":[101],"protograph,":[108],"condition":[111],"seems":[112],"capture":[114],"really":[115],"well":[116],"distance":[120],"character":[121],"code.":[124],"This":[125],"illustrated":[127],"by":[128],"good":[135],"cycle":[141],"all":[143],"together.":[150],"Surprisingly,":[151],"only":[155],"slight":[157],"modification":[158],"does":[163],"satisfy":[165],"condition.":[168]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}