{"id":"https://openalex.org/W4289655235","doi":"https://doi.org/10.1109/isit50566.2022.9834578","title":"Matched Information Rate Codes for Binary-Input Intersymbol Interference Wiretap Channels","display_name":"Matched Information Rate Codes for Binary-Input Intersymbol Interference Wiretap Channels","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655235","doi":"https://doi.org/10.1109/isit50566.2022.9834578"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834578","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834578","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5022117405","display_name":"Aria Nouri","orcid":"https://orcid.org/0000-0001-5548-184X"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Aria Nouri","raw_affiliation_strings":["Shahid Beheshti University,Faculty of Electrical Engineering,Tehran,Iran","Faculty of Electrical Engineering, Shahid Beheshti University, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Shahid Beheshti University,Faculty of Electrical Engineering,Tehran,Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, Shahid Beheshti University, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035190795","display_name":"Reza Asvadi","orcid":"https://orcid.org/0000-0001-9898-7744"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Reza Asvadi","raw_affiliation_strings":["Shahid Beheshti University,Faculty of Electrical Engineering,Tehran,Iran","Faculty of Electrical Engineering, Shahid Beheshti University, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Shahid Beheshti University,Faculty of Electrical Engineering,Tehran,Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, Shahid Beheshti University, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022117405"],"corresponding_institution_ids":["https://openalex.org/I48379061"],"apc_list":null,"apc_paid":null,"fwci":0.3222,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.3739643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1052","last_page":"1057"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9995999932289124,"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/secrecy","display_name":"Secrecy","score":0.642643392086029},{"id":"https://openalex.org/keywords/intersymbol-interference","display_name":"Intersymbol interference","score":0.6412646770477295},{"id":"https://openalex.org/keywords/nyquist-isi-criterion","display_name":"Nyquist ISI criterion","score":0.5914769172668457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.584144651889801},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5220541954040527},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.508211612701416},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4815714359283447},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44494959712028503},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4393538236618042},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.43605607748031616},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"Information-theoretic security","score":0.4357636570930481},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.420624703168869},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36976945400238037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35996881127357483},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.342012882232666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29596146941185},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.18441972136497498},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1252242624759674},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08711192011833191}],"concepts":[{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.642643392086029},{"id":"https://openalex.org/C97812054","wikidata":"https://www.wikidata.org/wiki/Q2166055","display_name":"Intersymbol interference","level":3,"score":0.6412646770477295},{"id":"https://openalex.org/C106743206","wikidata":"https://www.wikidata.org/wiki/Q7071249","display_name":"Nyquist ISI criterion","level":4,"score":0.5914769172668457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.584144651889801},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5220541954040527},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.508211612701416},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4815714359283447},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44494959712028503},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4393538236618042},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.43605607748031616},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.4357636570930481},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.420624703168869},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36976945400238037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35996881127357483},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.342012882232666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29596146941185},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.18441972136497498},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1252242624759674},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08711192011833191},{"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/isit50566.2022.9834578","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834578","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1562070166","https://openalex.org/W1968626661","https://openalex.org/W1980381813","https://openalex.org/W2039250757","https://openalex.org/W2043769961","https://openalex.org/W2045407304","https://openalex.org/W2047667035","https://openalex.org/W2070432296","https://openalex.org/W2080918425","https://openalex.org/W2097682410","https://openalex.org/W2102888884","https://openalex.org/W2105393329","https://openalex.org/W2120162479","https://openalex.org/W2121606987","https://openalex.org/W2124221743","https://openalex.org/W2124602541","https://openalex.org/W2127490352","https://openalex.org/W2128153585","https://openalex.org/W2131086249","https://openalex.org/W2139584447","https://openalex.org/W2151961505","https://openalex.org/W2154756387","https://openalex.org/W2158514560","https://openalex.org/W2931556563","https://openalex.org/W2950235675","https://openalex.org/W3025110074","https://openalex.org/W3103399905","https://openalex.org/W3104095479","https://openalex.org/W3106398877","https://openalex.org/W3110347254","https://openalex.org/W3141610964","https://openalex.org/W4285787737","https://openalex.org/W4299515172","https://openalex.org/W6795753751"],"related_works":["https://openalex.org/W2148130657","https://openalex.org/W2066927863","https://openalex.org/W2103646469","https://openalex.org/W2024698673","https://openalex.org/W1868885205","https://openalex.org/W1585818366","https://openalex.org/W2135294057","https://openalex.org/W2350290990","https://openalex.org/W2164676903","https://openalex.org/W2154661269"],"abstract_inverted_index":{"A":[0,107],"two-stage":[1],"coding":[2,122],"scheme":[3,54,123],"is":[4,18,34],"proposed":[5,53,121],"for":[6,75],"reliable":[7],"and":[8,39,63,115],"secure":[9,26,50,125],"transmission":[10],"over":[11,32],"intersymbol":[12],"interference":[13],"wiretap":[14],"channels":[15],"(ISI-WTCs).":[16],"It":[17],"shown":[19],"that":[20],"the":[21,25,48,52,56,77,82,86,95,102,113,116,120,129],"ultimate":[22],"bound":[23,93],"on":[24,94],"rate":[27,96],"of":[28,58,81,97,119],"linear":[29],"block":[30],"codes":[31],"ISI-WTCs":[33],"achieved":[35],"by":[36],"an":[37,59,64,90],"independent":[38],"uniformly":[40],"distributed":[41],"(i.u.d.)":[42],"input":[43],"process.":[44],"Aiming":[45],"to":[46,128],"exceed":[47],"i.u.d.":[49],"rate,":[51],"comprises":[55],"concatenation":[57],"inner":[60,69],"trellis":[61],"code":[62],"outer":[65,87],"coset":[66],"code.":[67],"The":[68],"stage":[70,88],"emulates":[71],"a":[72],"Markov":[73],"process":[74],"achieving":[76],"constrained":[78,130],"secrecy":[79,105,114,131],"capacity":[80],"ISI-WTC.":[83],"In":[84],"contrast,":[85],"vanishes":[89],"obtained":[91],"upper":[92],"information":[98],"leakage":[99],"toward":[100],"satisfying":[101],"so-called":[103],"weak":[104],"criterion.":[106],"carefully":[108],"modified":[109],"density":[110],"evolution":[111],"confirms":[112],"reliability":[117],"efficiency":[118],"at":[124],"rates":[126],"close":[127],"capacity.":[132]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}