{"id":"https://openalex.org/W4415368485","doi":"https://doi.org/10.1109/isit63088.2025.11195256","title":"On the Minimum Distance and Erasure Correction of Codes with Block Circulant Topology","display_name":"On the Minimum Distance and Erasure Correction of Codes with Block Circulant Topology","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368485","doi":"https://doi.org/10.1109/isit63088.2025.11195256"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5040956008","display_name":"Birenjith Sasidharan","orcid":"https://orcid.org/0000-0001-7444-7161"},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Birenjith Sasidharan","raw_affiliation_strings":["Monash University"],"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043667125","display_name":"Emanuele Viterbo","orcid":"https://orcid.org/0000-0002-5861-2873"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]},{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Emanuele Viterbo","raw_affiliation_strings":["Monash University"],"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031318960","display_name":"Son Hoang Dau","orcid":"https://orcid.org/0000-0002-2276-017X"},"institutions":[{"id":"https://openalex.org/I4210113248","display_name":"Indian Institute of Technology Palakkad","ror":"https://ror.org/0264cg909","country_code":"IN","type":"facility","lineage":["https://openalex.org/I4210113248"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Son Hoang Dau","raw_affiliation_strings":["Indian Institute of Technology Palakkad"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Palakkad","institution_ids":["https://openalex.org/I4210113248"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040956008"],"corresponding_institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37474746,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.98089998960495,"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.98089998960495,"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/T11130","display_name":"Coding theory and cryptography","score":0.9754999876022339,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9700999855995178,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6157000064849854},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5189999938011169},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.5127999782562256},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5101000070571899},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.46939998865127563},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.46140000224113464},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.44519999623298645},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4375999867916107},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.4311999976634979}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6291000247001648},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6157000064849854},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5189999938011169},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.5127999782562256},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5101000070571899},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4715999960899353},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.46939998865127563},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.46140000224113464},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.44519999623298645},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42829999327659607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4052000045776367},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.36039999127388},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3264999985694885},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.326200008392334},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3215999901294708},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.32010000944137573},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30059999227523804},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.2858999967575073},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.2615000009536743}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1866030559","https://openalex.org/W1899006889","https://openalex.org/W1993830711","https://openalex.org/W1996042140","https://openalex.org/W1997044393","https://openalex.org/W2018102393","https://openalex.org/W2050500290","https://openalex.org/W2099837838","https://openalex.org/W2143781601","https://openalex.org/W2155418912","https://openalex.org/W2405991429","https://openalex.org/W2743675126","https://openalex.org/W2963163039","https://openalex.org/W2967056459","https://openalex.org/W3210283590","https://openalex.org/W4409916771"],"related_works":[],"abstract_inverted_index":{"Codes":[0],"with":[1,121],"locality":[2],"without":[3],"any":[4],"global":[5],"paritycheck":[6],"constraints":[7,15,50],"apart":[8],"from":[9,188],"those":[10],"generated":[11],"by":[12,81,136],"local":[13,126,196],"codes'":[14],"have":[16],"recently":[17],"found":[18],"a":[19,34,54,98,129,167,181,190,193,225],"unique":[20],"application":[21],"in":[22,31,45,128],"decentralized":[23],"systems.":[24],"In":[25,104],"response":[26],"to":[27,52],"this,":[28],"we":[29,107],"proposed":[30],"previous":[32],"work,":[33,106],"new":[35],"class":[36],"of":[37,48,100,116,124,148,195,204],"block":[38,55],"circulant":[39,56],"(BC)":[40],"codes":[41,71,127],"possessing":[42],"certain":[43],"structure":[44],"the":[46,110,113,117,145,201,218],"arrangement":[47],"parity-check":[49],"referred":[51],"as":[53],"topology.":[57],"The":[58,177],"BC":[59,118],"topology":[60],"<tex":[61,67,72,83,95,101,158,174,205,213,228,236],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[62,68,73,84,96,102,159,175,206,214,229,237],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$T_{[\\mu,":[63],"\\lambda,":[64,76],"\\omega]}(\\rho)$</tex>":[65],"and":[66,94,112,140],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mathbf{B":[69],"C}$</tex>":[70],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C_{\\mathbf{B":[74,160,207],"C}}[\\mu,":[75,161,208],"\\omega,":[77,163,210],"\\rho]$</tex>":[78,211],"are":[79],"parameterized":[80],"integers":[82],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda":[85],"\\geq":[86,89,92],"2,":[87,90],"\\omega":[88],"\\rho":[91],"2$</tex>":[93],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mu$</tex>":[97],"multiple":[99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda$</tex>.":[103],"this":[105],"show":[108,199],"that":[109,131,184,200,227],"rate":[111],"minimum":[114,202],"distance":[115,203],"code":[119],"scale":[120],"corresponding":[122],"metrics":[123],"its":[125],"manner":[130],"can":[132],"not":[133],"be":[134],"realized":[135],"well-known":[137],"linear":[138],"array":[139],"product":[141],"topologies,":[142],"thus":[143],"widening":[144],"possible":[146],"regime":[147],"operation.":[149],"We":[150,198],"also":[151],"provide":[152],"an":[153],"efficient":[154],"erasure-correcting":[155],"decoder":[156,168],"for":[157,173,233],"\\lambda=3,":[162,209],"\\rho]$</tex>,":[164],"while":[165],"such":[166],"was":[169,221],"earlier":[170,222],"known":[171],"only":[172],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda=2$</tex>.":[176],"decoding":[178],"algorithm":[179],"uses":[180],"novel":[182],"mechanism":[183],"iteratively":[185],"corrects":[186],"erasures":[187],"either":[189],"single":[191],"or":[192],"triplet":[194],"codes.":[197],"is":[212],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$3":[215],"\\rho+1$</tex>,":[216],"whereas":[217],"same":[219],"result":[220],"available":[223],"under":[224],"constraint":[226],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\mu=2^{a}":[230],"\\cdot":[231],"3$</tex>":[232],"some":[234],"integer":[235],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$a$</tex>.":[238]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}