[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_351":352},"routes/_layout",{"_11":262},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_58":59,"_60":61},"type","technology","id","tech_oa_T10796","section","children","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":49,"_50":-5,"_51":52,"_53":-5,"_54":-5,"_55":-5,"_56":30,"_57":-5},"canonical","https://www.hugmap.com/entity/technology/tech_oa_T10796/children","siteBaseUrl","https://www.hugmap.com","sectionCount",0,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Cooperative Communication and Network Coding\",\"url\":\"https://www.hugmap.com/entity/technology/tech_oa_T10796/children\",\"@type\":\"DefinedTerm\",\"inDefinedTermSet\":\"HugMap Technology Glossary\"},{\"@type\":\"CollectionPage\",\"name\":\"Cooperative Communication and Network Coding 衍生技术\",\"description\":\"Cooperative Communication and Network Coding 在 HugMap 中的衍生技术，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/technology/tech_oa_T10796/children\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"技术\",\"item\":\"https://www.hugmap.com/search?type=technology\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Cooperative Communication and Network Coding\",\"item\":\"https://www.hugmap.com/entity/technology/tech_oa_T10796\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"衍生技术\",\"item\":\"https://www.hugmap.com/entity/technology/tech_oa_T10796/children\"}]}]}","name","Cooperative Communication and Network Coding","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"taxonomy_id\":\"tax_rd_T10796\"}","properties","source","openalex_topics","createdAt","2026-05-17T09:00:35.178925188","updatedAt","2026-05-17T09:00:35.178928108","techType","architecture","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","paperCount","patentCount","displayName","displayDescription","mutations",[],"queries",[62],{"_63":64,"_65":66,"_67":68,"_69":70},"dehydratedAt",1780760912198,"state",{"_72":73,"_74":75,"_76":64,"_77":-5,"_78":26,"_79":26,"_80":26,"_81":-5,"_82":-5,"_83":84,"_35":85,"_86":87},"queryKey",[71,19,14,16],"queryHash","[\"portal\",\"entity\",\"technology\",\"tech_oa_T10796\"]","portal","data",{"_19":20,"_88":89,"_90":91,"_92":93,"_94":95,"_96":97,"_98":99,"_100":101,"_18":102},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount","errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated",false,"success","fetchStatus","idle","entityType","Technology","taxonomies",[],"papers",[103,104,105,106,107,108,109,110,111,112],"events",[],"patents",[],"articles",[],"products",[],[],{"_15":249,"_29":250,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":251,"_39":-5,"_40":116,"_42":252,"_44":253,"_119":254,"_121":-5,"_122":255,"_124":250,"_125":256,"_127":257,"_129":258,"_131":132,"_133":259,"_135":-5,"_136":260,"_138":-5,"_139":84,"_56":250,"_57":-5},{"_15":237,"_29":238,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":239,"_39":-5,"_40":116,"_42":240,"_44":241,"_119":242,"_121":-5,"_122":243,"_124":238,"_125":244,"_127":245,"_129":246,"_131":132,"_133":247,"_135":-5,"_136":248,"_138":-5,"_139":84,"_56":238,"_57":-5},{"_15":225,"_29":226,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":227,"_39":-5,"_40":116,"_42":228,"_44":229,"_119":230,"_121":-5,"_122":231,"_124":226,"_125":232,"_127":233,"_129":234,"_131":132,"_133":235,"_135":-5,"_136":236,"_138":-5,"_139":84,"_56":226,"_57":-5},{"_15":210,"_29":211,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":212,"_39":-5,"_40":116,"_42":213,"_44":214,"_119":215,"_121":216,"_122":217,"_124":211,"_125":218,"_127":219,"_129":190,"_131":220,"_133":221,"_135":-5,"_136":222,"_138":223,"_139":84,"_56":211,"_57":-5},{"_15":195,"_29":196,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":197,"_39":-5,"_40":116,"_42":198,"_44":199,"_119":200,"_121":-5,"_122":201,"_124":196,"_125":202,"_127":203,"_129":204,"_131":205,"_133":206,"_135":-5,"_136":207,"_138":208,"_139":84,"_56":196,"_57":-5},{"_15":181,"_29":182,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":183,"_39":-5,"_40":116,"_42":184,"_44":185,"_119":186,"_121":-5,"_122":187,"_124":182,"_125":188,"_127":189,"_129":190,"_131":191,"_133":192,"_135":-5,"_136":193,"_138":-5,"_139":84,"_56":182,"_57":-5},{"_15":168,"_29":169,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":170,"_39":-5,"_40":116,"_42":171,"_44":172,"_119":173,"_121":-5,"_122":174,"_124":169,"_125":175,"_127":176,"_129":177,"_131":132,"_133":178,"_135":-5,"_136":179,"_138":-5,"_139":84,"_56":169,"_57":-5},{"_15":155,"_29":156,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":157,"_39":-5,"_40":116,"_42":158,"_44":159,"_119":160,"_121":-5,"_122":161,"_124":156,"_125":162,"_127":163,"_129":164,"_131":132,"_133":165,"_135":-5,"_136":166,"_138":-5,"_139":84,"_56":156,"_57":-5},{"_15":142,"_29":143,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":144,"_39":-5,"_40":116,"_42":145,"_44":146,"_119":147,"_121":-5,"_122":148,"_124":143,"_125":149,"_127":150,"_129":151,"_131":152,"_133":153,"_135":-5,"_136":154,"_138":-5,"_139":84,"_56":143,"_57":-5},{"_15":113,"_29":114,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":115,"_39":-5,"_40":116,"_42":117,"_44":118,"_119":120,"_121":-5,"_122":123,"_124":114,"_125":126,"_127":128,"_129":130,"_131":132,"_133":134,"_135":-5,"_136":137,"_138":-5,"_139":84,"_56":114,"_57":-5},"paper_W2164684058","The zero error capacity of a noisy channel","{\"openalex\":\"W2164684058\",\"doi\":\"10.1109/tit.1956.1056798\"}","openalex","2026-05-14T06:55:45.318177784","2026-05-21T09:38:02.196221677","doi","10.1109/tit.1956.1056798","arxivId","openalexId","W2164684058","title","abstractText","The zero error capacity C_o of a noisy channel is defined as the least upper bound of rates at which it is possible to transmit information with zero probability of error. Various properties of C_o are studied; upper and lower bounds and methods of evaluation of C_o are given. Inequalities are obtained for the C_o relating to the \"sum\" and \"product\" of two given channels. The analogous problem of zero error capacity C_oF for a channel with a feedback link is considered. It is shown that while the ordinary capacity of a memoryless channel with feedback is equal to that of the same channel without feedback, the zero error capacity may be greater. A solution is given to the problem of evaluating C_oF .","publishedDate","1956-09-01","publishedYear",1956,"venue","IEEE Transactions on Information Theory","citationCount",1512,"authors","keywords",[140,30,141],"pdfUrl","topVenue","Wireless Communication Security Techniques","Coding theory and cryptography","paper_W1971536606","Three-terminal communication channels","{\"openalex\":\"W1971536606\",\"doi\":\"10.2307/1426331\"}","2026-05-14T06:52:02.300202784","2026-05-21T09:27:54.336126733","10.2307/1426331","W1971536606","The problem of transmitting information in a specified direction over a communication channel with three terminals is considered. Examples are given of the various ways of sending information. Basic inequalities for average mutual information rates are obtained. A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived. Upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.","1971-01-01",1971,"Advances in Applied Probability",1531,[30,140,141],"paper_W2116631972","A universal lattice code decoder for fading channels","{\"openalex\":\"W2116631972\",\"doi\":\"10.1109/18.771234\"}","2026-05-14T06:47:26.359009518","2026-05-21T09:18:05.197010578","10.1109/18.771234","W2116631972","We present a maximum-likelihood decoding algorithm for an arbitrary lattice code when used over an independent fading channel with perfect channel state information at the receiver. The decoder is based on a bounded distance search among the lattice points falling inside a sphere centered at the received point. By judicious choice of the decoding radius we show that this decoder can be practically used to decode lattice codes of dimension up to 32 in a fading environment.","1999-07-01",1999,1554,[141,30,167],"Algorithms and Data Compression","paper_W2296441616","Broadcast channels","{\"openalex\":\"W2296441616\",\"doi\":\"10.1109/tit.1972.1054727\"}","2026-05-14T05:37:46.209775709","2026-05-21T08:01:22.189266458","10.1109/tit.1972.1054727","W2296441616","We introduce the problem of a single source attempting to communicate information simultaneously to several receivers. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listeners. Thus several different channels with a common input alphabet are specified. We shall determine the families of simultaneously achievable transmission rates for many extreme classes of channels. Upper and lower bounds on the capacity region will be found, and it will be shown that the family of theoretically achievable rates dominates the family of rates achievable by previously known time-sharing and maximin procedures. This improvement is gained by superimposing high-rate information on low-rate information. All of these results lead to a new approach to the compound channels problem.","1972-01-01",1972,1722,[30,140,180],"Cellular Automata and Applications","paper_W2007529001","Guaranteeing Secrecy using Artificial Noise","{\"openalex\":\"W2007529001\",\"doi\":\"10.1109/twc.2008.060848\"}","2026-05-14T04:53:26.233889944","2026-05-21T07:12:25.185853416","10.1109/twc.2008.060848","W2007529001","The broadcast nature of the wireless medium makes the communication over this medium vulnerable to eavesdropping. This paper considers the problem of secret communication between two nodes, over a fading wireless medium, in the presence of a passive eavesdropper. The assumption used is that the transmitter and its helpers (amplifying relays) have more antennas than the eavesdropper. The transmitter ensures secrecy of communication by utilizing some of the available power to produce 'artificial noise', such that only the eavesdropper's channel is degraded. Two scenarios are considered, one where the transmitter has multiple transmit antennas, and the other where amplifying relays simulate the effect of multiple antennas. The channel state information (CSI) is assumed to be publicly known, and hence, the secrecy of communication is independent of the secrecy of CSI.","2008-06-01",2008,"IEEE Transactions on Wireless Communications",1907,[140,30,194],"Wireless Signal Modulation Classification","paper_W2126924915","Reaching Agreement in the Presence of Faults","{\"openalex\":\"W2126924915\",\"doi\":\"10.1145/322186.322188\"}","2026-05-14T03:52:35.293968233","2026-05-21T05:44:34.185217678","10.1145/322186.322188","W2126924915","The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that allows each nonfaulty processor to infer a value for each other processor. The value inferred for a nonfaulty processor must be that processor's private value, and the value inferred for a faulty one must be consistent with the corresponding value inferred by each other nonfaulty processor. It is shown that the problem is solvable for, and only for, n ≥ 3 m + 1, where m is the number of faulty processors and n is the total number. It is also shown that if faulty processors can refuse to pass on information but cannot falsely relay information, the problem is solvable for arbitrary n ≥ m ≥ 0. This weaker assumption can be approximated in practice using cryptographic methods.","1980-04-01",1980,"Journal of the ACM",2360,[209,30,140],"https://dl.acm.org/doi/pdf/10.1145/322186.322188","Cryptography and Data Security","paper_W2122496159","Femtocell networks: a survey","{\"arxiv\":\"0803.0952\",\"openalex\":\"W2122496159\",\"doi\":\"10.1109/mcom.2008.4623708\"}","2026-05-14T02:33:59.297256339","2026-05-21T04:31:49.205404672","10.1109/mcom.2008.4623708","0803.0952","W2122496159","The surest way to increase the system capacity of a wireless link is by getting the transmitter and receiver closer to each other, which creates the dual benefits of higher-quality links and more spatial reuse. In a network with nomadic users, this inevitably involves deploying more infrastructure, typically in the form of microcells, hot spots, distributed antennas, or relays. A less expensive alternative is the recent concept of femtocells - also called home base stations - which are data access points installed by home users to get better indoor voice and data coverage. In this article we overview the technical and business arguments for femtocells and describe the state of the art on each front. We also describe the technical challenges facing femtocell networks and give some preliminary ideas for how to overcome them.","2008-09-01","IEEE Communications Magazine",3056,[30,180,224],"https://arxiv.org/pdf/0803.0952","Advanced MIMO Systems Optimization","paper_W2144007657","Broadcast channels with confidential messages","{\"openalex\":\"W2144007657\",\"doi\":\"10.1109/tit.1978.1055892\"}","2026-05-14T02:16:00.239343214","2026-05-21T04:10:57.294010334","10.1109/tit.1978.1055892","W2144007657","Given two discrete memoryless channels (DMC's) with a common input, it is desired to transmit private messages to receiver 1 rate R_{1} and common messages to both receivers at rate R_{o} , while keeping receiver 2 as ignorant of the private messages as possible. Measuring ignorance by equivocation, a single-letter characterization is given of the achievable triples (R_{1},R_{e},R_{o}) where R_{e} is the equivocation rate. Based on this channel coding result, the related source-channel matching problem is also settled. These results generalize those of Wyner on the wiretap channel and of Körner-Marton on the broadcast Channel.","1978-05-01",1978,3375,[140,30,180],"paper_W2106403318","Linear network coding","{\"openalex\":\"W2106403318\",\"doi\":\"10.1109/tit.2002.807285\"}","2026-05-14T02:13:50.355430308","2026-05-21T04:06:19.181919061","10.1109/tit.2002.807285","W2106403318","Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data before passing it on, the question involves optimization of the multicast mechanisms at the nodes. Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. We formulate this multicast problem and prove that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.","2003-02-01",2003,3454,[30,180,140],"paper_W2105831729","Network information flow","{\"openalex\":\"W2105831729\",\"doi\":\"10.1109/18.850663\"}","2026-05-14T01:01:36.288905421","2026-05-21T02:37:40.200929829","10.1109/18.850663","W2105831729","We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a \"fluid\" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.","2000-07-01",2000,7859,[30,261,180],"Error Correcting Code Techniques",{"_58":263,"_60":264},[],[265],{"_63":266,"_65":267,"_67":268,"_69":269},1780760911089,{"_72":271,"_74":75,"_76":266,"_77":-5,"_78":26,"_79":26,"_80":26,"_81":-5,"_82":-5,"_83":84,"_35":85,"_86":87},[71,270],"[\"portal\",\"industries\"]","industries",[272,273,274,275,276,277,278,279,280,281,282,283],{"_15":344,"_29":345,"_31":-5,"_32":346,"_33":347,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":348,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":345,"_57":347},{"_15":340,"_29":341,"_31":-5,"_32":-5,"_33":342,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":343,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":341,"_57":342},{"_15":334,"_29":335,"_31":-5,"_32":336,"_33":337,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":338,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":335,"_57":337},{"_15":330,"_29":331,"_31":-5,"_32":-5,"_33":332,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":333,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":331,"_57":332},{"_15":326,"_29":327,"_31":-5,"_32":-5,"_33":328,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":329,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":327,"_57":328},{"_15":320,"_29":321,"_31":-5,"_32":322,"_33":323,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":324,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":321,"_57":323},{"_15":315,"_29":316,"_31":-5,"_32":-5,"_33":317,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":318,"_296":26,"_297":319,"_298":26,"_18":-5,"_56":316,"_57":317},{"_15":311,"_29":312,"_31":-5,"_32":-5,"_33":313,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":314,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":312,"_57":313},{"_15":307,"_29":308,"_31":-5,"_32":-5,"_33":309,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":310,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":308,"_57":309},{"_15":303,"_29":304,"_31":-5,"_32":-5,"_33":305,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":306,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":304,"_57":305},{"_15":299,"_29":300,"_31":-5,"_32":-5,"_33":301,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":302,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":300,"_57":301},{"_15":284,"_29":285,"_31":-5,"_32":-5,"_33":286,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":287,"_42":-5,"_44":-5,"_288":289,"_290":-5,"_291":75,"_292":293,"_294":295,"_296":26,"_297":84,"_298":26,"_18":-5,"_56":285,"_57":286},"tax_ind_smartphone","智能手机","Smartphone","manual","taxonomyType","INDUSTRY","code","level","parentId","tax_ind_root","path","科技行业/智能手机","sortOrder","isLeaf","entityCount","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算",true,"tax_ind_blockchain","区块链",[325],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[339],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[349,350],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_353":24},"SITE_BASE_URL"]

Cooperative Communication and Network Coding 技术

Cooperative Communication and Network Coding · 衍生技术