{"id":"https://openalex.org/W4416798353","doi":"https://doi.org/10.1109/tit.2025.3638947","title":"Distance Properties of Punctured Simplex Codes and Design of High-Rate PRC-LDPC Codes for Complexity-Constrained Applications","display_name":"Distance Properties of Punctured Simplex Codes and Design of High-Rate PRC-LDPC Codes for Complexity-Constrained Applications","publication_year":2025,"publication_date":"2025-11-28","ids":{"openalex":"https://openalex.org/W4416798353","doi":"https://doi.org/10.1109/tit.2025.3638947"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2025.3638947","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tit.2025.3638947","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1109/tit.2025.3638947","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039296240","display_name":"Massimo Battaglioni","orcid":"https://orcid.org/0000-0002-8539-4007"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo Battaglioni","raw_affiliation_strings":["Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8539-4007","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108167671","display_name":"Marco Baldi","orcid":"https://orcid.org/0000-0002-8754-5526"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Baldi","raw_affiliation_strings":["Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8754-5526","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103097011","display_name":"Franco Chiaraluce","orcid":"https://orcid.org/0000-0001-6994-1448"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Franco Chiaraluce","raw_affiliation_strings":["Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6994-1448","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066901921","display_name":"Giovanni Cancellieri","orcid":null},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Cancellieri","raw_affiliation_strings":["Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell’Informazione, Università Politecnica delle Marche, Ancona, Italy","institution_ids":["https://openalex.org/I122534668"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122534668"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36637231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"1","first_page":"183","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9898999929428101,"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.9898999929428101,"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.0026000000070780516,"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.002300000051036477,"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/simplex","display_name":"Simplex","score":0.8396000266075134},{"id":"https://openalex.org/keywords/puncturing","display_name":"Puncturing","score":0.7340999841690063},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6338000297546387},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5392000079154968},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4745999872684479},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4462999999523163},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4332999885082245},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.4027999937534332},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.3765000104904175}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.8396000266075134},{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.7340999841690063},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6338000297546387},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5392000079154968},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4627000093460083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45010000467300415},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4462999999523163},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.438400000333786},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4332999885082245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4235999882221222},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4027999937534332},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.358599990606308},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.3562000095844269},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.33329999446868896},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.33090001344680786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32170000672340393},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.2955000102519989},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2888999879360199},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.27810001373291016},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.27790001034736633},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2025.3638947","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tit.2025.3638947","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:iris.univpm.it:11566/350852","is_oa":true,"landing_page_url":"https://hdl.handle.net/11566/350852","pdf_url":"https://iris.univpm.it/bitstream/11566/350852/3/Battaglioni_Distance-Properties-Punctured-Simplex_2026.pdf","source":{"id":"https://openalex.org/S4306402571","display_name":"Universit\u00e0 Politecnica delle Marche (Universit\u00e0 Politecnica delle Marche)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122534668","host_organization_name":"Marche Polytechnic University","host_organization_lineage":["https://openalex.org/I122534668"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1109/tit.2025.3638947","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tit.2025.3638947","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1522100248","display_name":null,"funder_award_id":"J33C22002880001","funder_id":"https://openalex.org/F7311471023","funder_display_name":"NextGenerationEU"}],"funders":[{"id":"https://openalex.org/F7311471023","display_name":"NextGenerationEU","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Cyclic":[0],"simplex":[1,34,58,81,125],"codes":[2,82,98,116],"are":[3],"usually":[4],"deemed":[5],"as":[6],"impractical":[7],"because":[8],"of":[9,21,55,67,79,85,95,106],"their":[10,46],"extremely":[11],"low":[12],"rate":[13],"and":[14,40,120],"large":[15],"codeword":[16],"length":[17],"for":[18],"practical":[19],"values":[20],"the":[22,53,63,76,93,104],"code":[23,108],"dimension.":[24],"To":[25],"address":[26],"these":[27],"limitations,":[28],"researchers":[29],"have":[30],"resorted":[31],"to":[32,44,99,113,123],"punctured":[33,56,80],"codes,":[35,59,126],"focusing":[36,61],"on":[37,62],"primitive":[38],"polynomials":[39],"employing":[41],"statistical":[42],"analyses":[43],"investigate":[45],"properties.":[47,88],"This":[48],"paper":[49],"delves":[50],"deeper":[51],"into":[52],"properties":[54],"binary":[57],"also":[60,127],"recently":[64],"introduced":[65],"family":[66],"Primitive":[68],"Rate-Compatible":[69],"Low-Density":[70],"Parity-Check":[71],"(PRC-LDPC)":[72],"codes.":[73],"We":[74,110],"study":[75],"average":[77],"behavior":[78],"in":[83],"terms":[84],"minimum":[86],"distance":[87],"Furthermore,":[89],"our":[90],"results":[91],"highlight":[92],"potential":[94],"high-rate":[96],"PRC-LDPC":[97],"reach":[100],"or":[101],"even":[102],"surpass":[103],"performance":[105],"state-of-the-art":[107],"families.":[109],"show":[111],"how":[112],"design":[114],"good":[115],"by":[117],"applying":[118],"puncturing":[119],"shortening":[121],"operations":[122],"cyclic":[124],"considering":[128],"complexity-constrained":[129],"scenarios.":[130]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-11-28T00:00:00"}