{"id":"https://openalex.org/W1971101353","doi":"https://doi.org/10.1109/itw.2013.6691226","title":"On polarization for the linear operator channel","display_name":"On polarization for the linear operator channel","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W1971101353","doi":"https://doi.org/10.1109/itw.2013.6691226","mag":"1971101353"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2013.6691226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2013.6691226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Information Theory Workshop (ITW)","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/A5071454911","display_name":"Cesar Brito","orcid":null},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesar Brito","raw_affiliation_strings":["Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","Klipsch School of Electrical and Computer Engineering, New Mexico State University Las Cruces, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorg Kliewer","raw_affiliation_strings":["Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","Klipsch School of Electrical and Computer Engineering, New Mexico State University Las Cruces, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08862928,"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":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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.9991000294685364,"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.9950000047683716,"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/linear-subspace","display_name":"Linear subspace","score":0.6095516085624695},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5832135677337646},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5773789882659912},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.5749987363815308},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5673959255218506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5239940881729126},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.510482907295227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4429299235343933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34551769495010376},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32752230763435364},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.3069149851799011},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21889838576316833},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.21375614404678345},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13793495297431946},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08355438709259033}],"concepts":[{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6095516085624695},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5832135677337646},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5773789882659912},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.5749987363815308},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5673959255218506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5239940881729126},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.510482907295227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4429299235343933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34551769495010376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32752230763435364},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.3069149851799011},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21889838576316833},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.21375614404678345},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13793495297431946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08355438709259033},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2013.6691226","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2013.6691226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.4000000059604645,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1984960835","https://openalex.org/W1986170574","https://openalex.org/W2055060019","https://openalex.org/W2058891692","https://openalex.org/W2060439883","https://openalex.org/W2096894382","https://openalex.org/W2098558858","https://openalex.org/W2139416652","https://openalex.org/W2142901448","https://openalex.org/W2150498905","https://openalex.org/W2162099497","https://openalex.org/W2162421771","https://openalex.org/W2167183476","https://openalex.org/W2172906094","https://openalex.org/W3099132056","https://openalex.org/W4205855417","https://openalex.org/W6665699771","https://openalex.org/W6685205706"],"related_works":["https://openalex.org/W2896134808","https://openalex.org/W3172436493","https://openalex.org/W4287164812","https://openalex.org/W2957492749","https://openalex.org/W1887135636","https://openalex.org/W2386063599","https://openalex.org/W1975884855","https://openalex.org/W3213150849","https://openalex.org/W4285605394","https://openalex.org/W2025894073"],"abstract_inverted_index":{"We":[0,55],"address":[1],"the":[2,12,28,86,132,137,142],"problem":[3],"of":[4,89],"reliably":[5],"transmitting":[6],"information":[7],"through":[8],"a":[9,35,38,48,63,101,111],"network":[10,17],"where":[11,20,42],"nodes":[13],"perform":[14],"random":[15],"linear":[16,39,120],"coding":[18],"and":[19,51,73,75],"an":[21,78,127],"adversary":[22],"potentially":[23],"injects":[24],"malicious":[25],"packets":[26],"into":[27],"network.":[29],"A":[30],"good":[31],"model":[32],"for":[33,93,117,131,146],"such":[34],"channel":[36,60,68,90,122,143],"is":[37],"operator":[40,121],"channel,":[41],"in":[43,141],"this":[44,58,118],"work":[45],"we":[46,113],"employ":[47],"combined":[49],"multiplicative":[50],"additive":[52],"matrix":[53],"channel.":[54],"show":[56,114],"that":[57,115],"adversarial":[59,119],"behaves":[61],"like":[62],"subspace-based":[64],"symmetric":[65],"discrete":[66],"memoryless":[67],"(DMC)":[69],"under":[70],"subspace":[71],"insertions":[72],"deletions":[74],"typically":[76],"has":[77],"input":[79,97,106,133],"alphabet":[80],"with":[81,95],"non-prime":[82],"cardinality.":[83],"This":[84],"facilitates":[85],"recent":[87],"application":[88],"polarization":[91,116],"results":[92],"DMCs":[94],"arbitrary":[96],"alphabets":[98],"by":[99],"providing":[100],"suitable":[102],"one-to-one":[103],"mapping":[104,130],"from":[105],"matrices":[107],"to":[108],"subspaces.":[109],"As":[110],"consequence,":[112],"can":[123],"be":[124],"obtained":[125],"via":[126],"element-wise":[128],"encoder":[129],"matrices,":[134],"which":[135],"replaces":[136],"finite":[138],"field":[139],"summation":[140],"combining":[144],"step":[145],"Arikan's":[147],"classical":[148],"polar":[149],"codes.":[150]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}