{"id":"https://openalex.org/W1986308718","doi":"https://doi.org/10.1109/isit.2014.6875416","title":"An upper bound on the minimum distance of array low-density parity-check codes","display_name":"An upper bound on the minimum distance of array low-density parity-check codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W1986308718","doi":"https://doi.org/10.1109/isit.2014.6875416","mag":"1986308718"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875416","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I2799829267","display_name":"Simula Research Laboratory","ror":"https://ror.org/00vn06n10","country_code":"NO","type":"facility","lineage":["https://openalex.org/I2799829267"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Eirik Rosnes","raw_affiliation_strings":["Department of Informatics, Simula Research Lab., Bergen, Norway","[Dept. of Inf., Univ. of Bergen, Bergen, Norway]"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, Simula Research Lab., Bergen, Norway","institution_ids":["https://openalex.org/I2799829267"]},{"raw_affiliation_string":"[Dept. of Inf., Univ. of Bergen, Bergen, Norway]","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077402042","display_name":"Marcel Ambroze","orcid":"https://orcid.org/0000-0001-9021-1095"},"institutions":[{"id":"https://openalex.org/I897542642","display_name":"University of Plymouth","ror":"https://ror.org/008n7pv89","country_code":"GB","type":"education","lineage":["https://openalex.org/I897542642"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marcel Adrian Ambroze","raw_affiliation_strings":["Fixed and Mobile Communications Research Center, University of Plymouth, UK","Fixed & Mobile Commun. Res. Center, Univ. of Plymouth, Plymouth, UK"],"affiliations":[{"raw_affiliation_string":"Fixed and Mobile Communications Research Center, University of Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]},{"raw_affiliation_string":"Fixed & Mobile Commun. Res. Center, Univ. of Plymouth, Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113824568","display_name":"Martin Tomlinson","orcid":null},"institutions":[{"id":"https://openalex.org/I897542642","display_name":"University of Plymouth","ror":"https://ror.org/008n7pv89","country_code":"GB","type":"education","lineage":["https://openalex.org/I897542642"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Tomlinson","raw_affiliation_strings":["Fixed and Mobile Communications Research Center, University of Plymouth, UK","Fixed & Mobile Commun. Res. Center, Univ. of Plymouth, Plymouth, UK"],"affiliations":[{"raw_affiliation_string":"Fixed and Mobile Communications Research Center, University of Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]},{"raw_affiliation_string":"Fixed & Mobile Commun. Res. Center, Univ. of Plymouth, Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090738616"],"corresponding_institution_ids":["https://openalex.org/I2799829267","https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08927569,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3155","last_page":"3159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9976999759674072,"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.9962000250816345,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7754213809967041},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7629687786102295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6848716735839844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6386457681655884},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6069331169128418},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.594828724861145},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5533754229545593},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5377469658851624},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3235967755317688},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26211556792259216}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7754213809967041},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7629687786102295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6848716735839844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6386457681655884},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6069331169128418},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.594828724861145},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5533754229545593},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5377469658851624},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3235967755317688},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26211556792259216},{"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/isit.2014.6875416","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4300000071525574,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1760355913","https://openalex.org/W2004036066","https://openalex.org/W2076838340","https://openalex.org/W2079767843","https://openalex.org/W2103495212","https://openalex.org/W2109491150","https://openalex.org/W2128765501","https://openalex.org/W2152956478","https://openalex.org/W2153292363","https://openalex.org/W2156660752","https://openalex.org/W2170998175"],"related_works":["https://openalex.org/W2479327835","https://openalex.org/W2537963609","https://openalex.org/W2092857423","https://openalex.org/W2110972223","https://openalex.org/W2121408388","https://openalex.org/W2163036861","https://openalex.org/W2361015587","https://openalex.org/W2361792238","https://openalex.org/W2182725540","https://openalex.org/W2090054304"],"abstract_inverted_index":{"In":[0,44,110],"this":[1,111],"work,":[2,112],"we":[3,113,147,171],"present":[4],"an":[5,37,115],"upper":[6,93,117],"bound":[7,118,137],"on":[8],"the":[9,45,47,88,126,144],"minimum":[10,48,91,166,175],"distance":[11,49,92,167,176],"of":[12,50,70,78,119,128,133,155,162,185],"array":[13,19],"low-density":[14],"parity-check":[15],"(LDPC)":[16],"codes.":[17],"An":[18],"LDPC":[20,25],"code":[21,26],"is":[22,36,105,138],"a":[23,129,134,165],"quasi-cyclic":[24],"specified":[27],"by":[28,54,96,124],"two":[29],"integers":[30],"q":[31,35,71,163,186],"and":[32,40,72,74,182],"m,":[33,73],"where":[34],"odd":[38],"prime":[39],"m":[41,61,85,179],"\u2264":[42,62,86,108,122,180,187],"q.":[43],"literature,":[46],"these":[51],"codes":[52],"(denoted":[53],"d(q,m))":[55],"has":[56],"been":[57,82,150],"thoroughly":[58],"studied":[59],"for":[60,67,159,178],"5.":[63],"Both":[64],"exact":[65],"results,":[66],"small":[68],"values":[69,161,184],"general":[75],"(i.e.,":[76],"independent":[77],"q)":[79],"bounds":[80],"have":[81,148],"established.":[83],"For":[84],"6,":[87],"best":[89],"known":[90],"bound,":[94],"derived":[95],"Mittelholzer":[97],"(IEEE":[98],"Int.":[99],"Symp.":[100],"Inf.":[101],"Theory,":[102],"Jun./Jul.":[103],"2002),":[104],"d(q,":[106,120],"6)":[107,121],"32.":[109],"derive":[114],"improved":[116],"20":[123],"using":[125,164],"concept":[127],"template":[130],"support":[131],"matrix":[132],"codeword.":[135],"The":[136],"tight":[139],"with":[140],"high":[141],"probability":[142],"in":[143],"sense":[145],"that":[146],"not":[149],"able":[151],"to":[152],"find":[153],"codewords":[154],"strictly":[156],"lower":[157],"weight":[158],"several":[160],"probabilistic":[168],"algorithm.":[169],"Finally,":[170],"provide":[172],"new":[173],"specific":[174],"results":[177],"6":[181],"low-to-moderate":[183],"79.":[188]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}