{"id":"https://openalex.org/W7160930014","doi":"https://doi.org/10.48550/arxiv.2605.08500","title":"Non-binary LDPC codes for Data Storage","display_name":"Non-binary LDPC codes for Data Storage","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160930014","doi":"https://doi.org/10.48550/arxiv.2605.08500"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.08500","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08500","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.08500","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135913824","display_name":"Irina Bocharova","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bocharova, Irina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060721331","display_name":"B.G. Kudryashov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kudryashov, Boris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089300685","display_name":"Henk D. L. Hollmann","orcid":"https://orcid.org/0000-0003-4005-2369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hollmann, Henk D. L.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048122752","display_name":"Vitaly Skachek","orcid":"https://orcid.org/0000-0002-0626-2437"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Skachek, Vitaly","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.8435999751091003,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.8435999751091003,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.12860000133514404,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.00839999970048666,"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.8902000188827515},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.5720999836921692},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4643000066280365},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4571000039577484},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4392000138759613},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4388999938964844},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.43380001187324524},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.4156000018119812},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.39070001244544983}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8902000188827515},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.5720999836921692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46950000524520874},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4643000066280365},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4571000039577484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4498000144958496},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4392000138759613},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4388999938964844},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.43380001187324524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4307999908924103},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.4156000018119812},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.38119998574256897},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3790000081062317},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.36250001192092896},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.3598000109195709},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3555999994277954},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.336899995803833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33570000529289246},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.3057999908924103},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.303600013256073},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.3025999963283539},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.29490000009536743},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.2766000032424927},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2680000066757202},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.08500","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08500","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.08500","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.08500","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"modern":[1],"data":[2],"storage":[3],"systems,":[4],"non-binary":[5,35,55,114,140,150],"LDPC":[6,36,56,82,115,141,151],"codes":[7,20,37,57,116,152],"for":[8,108,122,132,134],"recovering":[9],"from":[10],"disk":[11,26],"failures":[12,27],"are":[13],"increasingly":[14],"considered":[15],"strong":[16],"competitors":[17],"to":[18,48],"MDS":[19,49],"such":[21,81],"as":[22,31],"Reed-Solomon":[23],"codes.":[24,50],"Since":[25],"can":[28],"be":[29],"modeled":[30],"erasures,":[32],"we":[33,84,146],"analyze":[34],"over":[38],"a":[39,69,76,98],"$q$-ary":[40,44,77],"field":[41],"in":[42],"the":[43,65,86,102,109,124,135,139,154],"erasure":[45,106],"channel,":[46],"relative":[47],"Our":[51],"focus":[52],"is":[53,61,127,143],"on":[54,101],"whose":[58],"parity-check":[59],"matrix":[60,72],"obtained":[62],"by":[63,73],"replacing":[64],"non-zero":[66],"entries":[67],"of":[68,75,88,104,112,138,149],"binary":[70],"base":[71],"elements":[74],"finite":[78],"field.":[79],"For":[80],"codes,":[83],"introduce":[85],"notion":[87],"ultimate":[89,125,155],"distance,":[90],"which":[91],"upper-bounds":[92],"their":[93],"minimum":[94,136],"distance.":[95,156],"We":[96],"derive":[97],"random-coding":[99],"bound":[100],"number":[103],"non-correctable":[105],"patterns":[107],"Gallager":[110],"ensemble":[111],"regular":[113],"under":[117],"maximum-likelihood":[118],"decoding.":[119],"An":[120],"algorithm":[121,131],"finding":[123],"distance":[126,137],"presented.":[128],"A":[129],"low-complexity":[130],"searching":[133],"code":[142],"proposed.":[144],"Finally,":[145],"construct":[147],"examples":[148],"achieving":[153]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}