{"id":"https://openalex.org/W7167717303","doi":"https://doi.org/10.48550/arxiv.2607.05816","title":"From Bit to Block: Capacity Achievement via Code Concatenation","display_name":"From Bit to Block: Capacity Achievement via Code Concatenation","publication_year":2026,"publication_date":"2026-07-07","ids":{"openalex":"https://openalex.org/W7167717303","doi":"https://doi.org/10.48550/arxiv.2607.05816"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.05816","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.05816","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.05816","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140262207","display_name":"Bin Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhang, Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5140262207"],"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/T11321","display_name":"Error Correcting Code Techniques","score":0.3725000023841858,"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.3725000023841858,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.267300009727478,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.12219999730587006,"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/decodes","display_name":"Decodes","score":0.7551000118255615},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6312000155448914},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.6195999979972839},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5544000267982483},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.40689998865127563},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.39959999918937683},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.3978999853134155},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.3968000113964081},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.38420000672340393}],"concepts":[{"id":"https://openalex.org/C2778858076","wikidata":"https://www.wikidata.org/wiki/Q5249539","display_name":"Decodes","level":3,"score":0.7551000118255615},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6312000155448914},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.6195999979972839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5683000087738037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5619999766349792},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5544000267982483},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.39959999918937683},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.3978999853134155},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.38420000672340393},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.38190001249313354},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.3707999885082245},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3702000081539154},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.3346000015735626},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32339999079704285},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.3174999952316284},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.311599999666214},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.27709999680519104},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.2567000091075897},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25540000200271606},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.05816","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.05816","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.05816","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.05816","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"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":{"This":[0],"paper":[1],"shows":[2],"that":[3],"bit-level":[4],"reliability":[5,11],"can":[6,83,111],"be":[7,84,112],"converted":[8,85,113],"into":[9,86,114],"block-level":[10],"for":[12,79],"binary":[13,96],"codes":[14,98,105],"over":[15],"BMS":[16],"channels":[17],"through":[18],"Forney's":[19],"concatenation":[20],"scheme.":[21],"The":[22],"construction":[23],"concatenates":[24],"an":[25,36],"inner":[26,104],"code":[27,38,64],"of":[28,39],"rate":[29,40,66],"R-o(1)":[30,67],"and":[31,68],"vanishing":[32,69,76],"bit-error":[33,77,107],"probability":[34,78,108],"\u03b5with":[35],"outer":[37,52,102],"1-o(1)":[41],"equipped":[42],"with":[43,75,106],"a":[44,57,73,87,115],"bounded-distance":[45],"decoder.":[46],"We":[47,91],"show":[48,93],"that,":[49,94],"when":[50,95],"the":[51,62],"correction":[53],"radius":[54],"exceeds":[55],"\u03b5and":[56],"suitable":[58],"large-deviation":[59],"condition":[60],"holds,":[61],"concatenated":[63,117],"has":[65],"block-error":[70],"probability.":[71],"Hence,":[72],"family":[74],"rates":[80],"below":[81],"capacity":[82],"capacity-achieving":[88,116],"concatenated-code":[89],"family.":[90,118],"further":[92],"BCH":[97],"are":[99],"used":[100],"as":[101],"codes,":[103],"\u03b5=o(1/\\log\\log":[109],"n)":[110]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-09T00:00:00"}