咨询与建议

限定检索结果

文献类型

  • 32 篇 期刊文献
  • 15 篇 会议

馆藏范围

  • 47 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 41 篇 工学
    • 34 篇 计算机科学与技术...
    • 31 篇 电气工程
    • 4 篇 电子科学与技术(可...
    • 3 篇 光学工程
    • 1 篇 信息与通信工程
  • 27 篇 理学
    • 21 篇 数学
    • 5 篇 物理学
    • 3 篇 统计学(可授理学、...
    • 1 篇 科学技术史(分学科...
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...
    • 1 篇 工商管理

主题

  • 47 篇 coding theorem
  • 8 篇 capacity
  • 7 篇 entropy
  • 6 篇 decoding
  • 6 篇 channel coding
  • 5 篇 source coding
  • 4 篇 kolmogorov compl...
  • 3 篇 channels with me...
  • 3 篇 zero-error capac...
  • 3 篇 feedback
  • 3 篇 capacity-achievi...
  • 3 篇 entanglement
  • 3 篇 shannon cipher s...
  • 2 篇 feedback capacit...
  • 2 篇 quantum informat...
  • 2 篇 directed informa...
  • 2 篇 tree code
  • 2 篇 manganese
  • 2 篇 one-way function...
  • 2 篇 classical capaci...

机构

  • 2 篇 univ calif san d...
  • 2 篇 sun yat sen univ...
  • 2 篇 univ electrocomm...
  • 1 篇 univ tsukuba gra...
  • 1 篇 jaypee univ info...
  • 1 篇 osaka univ dept ...
  • 1 篇 nomura res inst ...
  • 1 篇 hong kong univ s...
  • 1 篇 sun yat sen univ...
  • 1 篇 univ oxford oxfo...
  • 1 篇 ibm t. j. watson...
  • 1 篇 tel aviv univ de...
  • 1 篇 univ cambridge d...
  • 1 篇 sun yat sen univ...
  • 1 篇 univ tsukuba ins...
  • 1 篇 va steklov math ...
  • 1 篇 georgia inst tec...
  • 1 篇 ibm t. j. watson...
  • 1 篇 ne baumann mhtu ...
  • 1 篇 idsia ch-6928 lu...

作者

  • 4 篇 ma xiao
  • 4 篇 yamamoto h
  • 3 篇 holevo a. s.
  • 3 篇 koga hiroki
  • 2 篇 kuznetsova a. a.
  • 2 篇 rangi anshuka
  • 2 篇 lin wenchao
  • 2 篇 kim young-han
  • 2 篇 franceschetti ma...
  • 2 篇 cai suihua
  • 2 篇 andreas winter
  • 2 篇 wei baodian
  • 1 篇 izhar mohd azri ...
  • 1 篇 goyal vivek k.
  • 1 篇 kobayashi k
  • 1 篇 charles h. benne...
  • 1 篇 oppenheim jonath...
  • 1 篇 vanni leonardo
  • 1 篇 piantanida pablo
  • 1 篇 zhu zheqi

语言

  • 46 篇 英文
  • 1 篇 其他
检索条件"主题词=Coding theorem"
47 条 记 录,以下是1-10 订阅
An Importance Aware Weighted coding theorem Using Message Importance Measure
收藏 引用
IEEE COMMUNICATIONS LETTERS 2020年 第8期24卷 1598-1601页
作者: Zhu, Zheqi Liu, Shanyun She, Rui Wan, Shuo Fan, Pingyi Letaief, Khaled B. Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Hong Kong Univ Sci & Technol Dept ECE Hong Kong Peoples R China
There are numerous scenarios in source coding where not only the code length but the importance of each value should also be taken into account. Different from the traditional coding theorems, by adding the importance... 详细信息
来源: 评论
coding theorem and Converse for Abstract Channels With Time Structure and Memory
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2018年 第7期64卷 4993-5016页
作者: Mittelbach, Martin Jorswieck, Eduard A. Tech Univ Dresden Chair Commun Theory Commun Lab D-01062 Dresden Germany
A coding theorem and converse are proved for a large-class of abstract stationary channels with time structure including the result by Kadota and Wyner (1972) on continuoustime real-valued channels as special cases. A... 详细信息
来源: 评论
coding theorem for Systematic LDGM Codes Under List Decoding
Coding Theorem for Systematic LDGM Codes Under List Decoding
收藏 引用
IEEE Information Theory Workshop (ITW)
作者: Lin, Wenchao Cai, Suihua Wei, Baodian Ma, Xiao Sun Yat Sen Univ Guangdong Key Lab Informat Secur Technol Guangzhou 510006 Guangdong Peoples R China Chongqing Key Lab Comp Network & Commun Technol Chongqing 400065 Peoples R China
This paper is concerned with three ensembles of systematic low density generator matrix (LDGM) codes, all of which were provably capacity-achieving in terms of bit error rate (BER). This, however, does not necessarily... 详细信息
来源: 评论
coding theorem for Systematic Low Density Generator Matrix Codes  9
Coding Theorem for Systematic Low Density Generator Matrix C...
收藏 引用
9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)
作者: Ma, Xiao Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Guangdong Peoples R China
This paper presents three new ensembles of low density generator matrix (LDGM) codes, all of which are systematic codes. We prove that, under the maximum likelihood (ML) decoding, these codes can achieve the capacity ... 详细信息
来源: 评论
A New Framework for Proving coding theorems for Linear Codes
A New Framework for Proving Coding Theorems for Linear Codes
收藏 引用
IEEE International Symposium on Information Theory (ISIT)
作者: Ma, Xiao Wang, Yixin Zhu, Tingting Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Sun Yat Sen Univ Guangdong Key Lab Informat Secur Technol Guangzhou 510006 Peoples R China
A new framework is presented in this paper for proving coding theorems for linear codes, where the systematic bits and the corresponding parity-check bits play different roles. Precisely, the noisy systematic bits are... 详细信息
来源: 评论
Channel coding theorems in Non-stochastic Information Theory
Channel Coding Theorems in Non-stochastic Information Theory
收藏 引用
IEEE International Symposium on Information Theory (ISIT)
作者: Rangi, Anshuka Franceschetti, Massimo Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 92103 USA
Recently, the delta-mutual information between uncertain variables has been introduced as a generalization of Nair's non-stochastic mutual information functional [1, 2]. Within this framework, we introduce four di... 详细信息
来源: 评论
Optimal coding for Randomized Kolmogorov Complexity and Its Applications  65
Optimal Coding for Randomized Kolmogorov Complexity and Its ...
收藏 引用
65th Symposium on Foundations of Computer Science
作者: Hirahara, Shuichi Lu, Zhenjian Nanashima, Mikito Natl Inst Informat Tokyo Japan Univ Warwick Coventry W Midlands England Tokyo Inst Technol Tokyo Japan
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov co... 详细信息
来源: 评论
Robustness of Average-Case Meta-Complexity via Pseudorandomness  2022
Robustness of Average-Case Meta-Complexity via Pseudorandomn...
收藏 引用
54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Ilango, Rahul Ren, Hanlin Santhanam, Rahul MIT Cambridge MA 02139 USA Univ Oxford Oxford England Tsinghua Univ Beijing Peoples R China
We show broad equivalences in the average-case complexity of many different meta-complexity problems, including Kolmogorov complexity, time-bounded Kolmogorov complexity, and the Minimum Circuit Size Problem. These re... 详细信息
来源: 评论
Systematic Convolutional Low Density Generator Matrix Code
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2021年 第6期67卷 3752-3764页
作者: Cai, Suihua Lin, Wenchao Yao, Xinyuanmeng Wei, Baodian Ma, Xiao Sun Yat Sen Univ Sch Comp Sci & Engn Guangdong Key Lab Informat Secur Technol Guangzhou 510006 Peoples R China
In this paper, we propose a systematic low density generator matrix (LDGM) code ensemble, which is defined by the Bernoulli process. We prove that, under maximum likelihood (ML) decoding, the proposed ensemble can ach... 详细信息
来源: 评论
Credibility distribution based R-norm fuzzy information measures in noiseless coding theorems
收藏 引用
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 2019年 第3期48卷 302-320页
作者: Kumar, Tanuj Bajaj, Rakesh Kumar Maheshwari, Prerna SRM Inst Sci & Technol Dept Math Delhi NCR Campus Ghaziabad India Jaypee Univ Informat Technol Dept Math Waknaghat HP India Sardar Vallabhbhai Patel Univ Agr & Technol Dept Math Meerut Uttar Pradesh India
In the present communication, a parametric R-norm fuzzy entropy of a fuzzy variable and subsequently R-norm fuzzy directed divergence measure of fuzzy variables by taking the credibility distribution measure into acco... 详细信息
来源: 评论