咨询与建议

限定检索结果

文献类型

  • 28 篇 期刊文献
  • 3 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 30 篇 工学
    • 27 篇 电气工程
    • 24 篇 计算机科学与技术...
    • 7 篇 信息与通信工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 控制科学与工程
  • 21 篇 理学
    • 21 篇 数学
    • 1 篇 系统科学

主题

  • 31 篇 pseudocodewords
  • 12 篇 low-density pari...
  • 11 篇 iterative decodi...
  • 7 篇 linear programmi...
  • 5 篇 linear codes
  • 5 篇 pseudoweight
  • 4 篇 linear programmi...
  • 4 篇 linear programmi...
  • 4 篇 linear programmi...
  • 4 篇 fundamental cone
  • 3 篇 maximum-likeliho...
  • 3 篇 belief propagati...
  • 3 篇 linear-programmi...
  • 3 篇 maximum likeliho...
  • 3 篇 low-density pari...
  • 2 篇 lp decoding
  • 2 篇 irreducible pseu...
  • 2 篇 lp relaxation
  • 2 篇 graph cover
  • 2 篇 pseudoweights

机构

  • 3 篇 univ coll dublin...
  • 3 篇 xidian univ sch ...
  • 2 篇 clemson univ dep...
  • 2 篇 tel aviv univ sc...
  • 2 篇 univ calif san d...
  • 2 篇 univ notre dame ...
  • 2 篇 univ kaiserslaut...
  • 2 篇 san diego state ...
  • 2 篇 univ calif berke...
  • 2 篇 hewlett packard ...
  • 2 篇 univ calif berke...
  • 2 篇 mahidol univ dep...
  • 2 篇 univ calif san d...
  • 1 篇 nicta nsw
  • 1 篇 univ coll dublin...
  • 1 篇 simula uib n-502...
  • 1 篇 harvard univ div...
  • 1 篇 natl univ singap...
  • 1 篇 ceragon networks...
  • 1 篇 univ notre dame ...

作者

  • 3 篇 smarandache roxa...
  • 3 篇 skachek vitaly
  • 3 篇 rosnes eirik
  • 3 篇 kositwattanarerk...
  • 3 篇 helmling michael
  • 3 篇 flanagan mark f.
  • 3 篇 jiao xiaopeng
  • 2 篇 lifshitz asi
  • 2 篇 costello daniel ...
  • 2 篇 vontobel pascal ...
  • 2 篇 kelley christine...
  • 2 篇 mu jianjun
  • 2 篇 dreher deanna
  • 2 篇 matthews gretche...
  • 2 篇 axvig nathan
  • 2 篇 sridhara deepak
  • 2 篇 siegel paul h.
  • 2 篇 graell i amat al...
  • 2 篇 be'ery yair
  • 2 篇 pusane ali e.

语言

  • 30 篇 英文
  • 1 篇 其他
检索条件"主题词=pseudocodewords"
31 条 记 录,以下是1-10 订阅
排序:
On Minimal pseudocodewords of Binary Hamming Codes
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2025年 第4期71卷 2360-2372页
作者: Liu, Haiyang Jiao, Xiaopeng Ma, Lianrong Chinese Acad Sci Inst Microelect Beijing 100029 Peoples R China Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China
pseudocodewords, and in particular minimal pseudocodewords, play an important role in understanding the performance of linear programming (LP) decoding. In this paper, we investigate minimal pseudocodewords of binary ... 详细信息
来源: 评论
Suppressing Fractional pseudocodewords by Eliminating Small Instantons
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2016年 第2期E99A卷 674-677页
作者: Guo, Junjun Mu, Jianjun Jiao, Xiaopeng Zhao, Peng Xian Technol Univ Sch Comp Sci & Engn Xian 710021 Peoples R China Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China
In this letter, a new method is presented to suppress fractional pseudocodewords by eliminating small instantons of irregular low-density parity-check (LDPC) codes under the linear programming (LP) decoding over the b... 详细信息
来源: 评论
pseudocodewords of Parity-Check Codes Over Fields of Prime Cardinality
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2014年 第9期60卷 5215-5227页
作者: Kositwattanarerk, Wittawat Matthews, Gretchen L. Mahidol Univ Dept Math Fac Sci Bangkok 10400 Thailand Commiss Higher Educ Ctr Excellence Math Bangkok 10400 Thailand Clemson Univ Dept Math Sci Clemson SC 29634 USA
This paper considers pseudocodewords of low-density parity-check codes over alphabets with prime cardinality p for use over the p-ary symmetric channel. pseudocodewords are decoding algorithm outputs that may not be l... 详细信息
来源: 评论
A Multivariate Weight Enumerator for Tail-biting Trellis pseudocodewords
收藏 引用
Journal of Generalized Lie Theory and Applications 2015年 第S1期9卷 1-4页
作者: Nigel Boston
Tail-biting-trellis representations of codes allow for iterative decoding algorithms, which are limited in effectiveness by the presence of pseudocodewords. We introduce a multivariate weight enumerator that keeps tra... 详细信息
来源: 评论
Adaptive Linear Programming Decoding of Nonbinary Linear Codes Over Prime Fields
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2020年 第3期66卷 1281-1317页
作者: Rosnes, Eirik Helmling, Michael Simula UiB N-5020 Bergen Norway Univ Koblenz Landau Math Inst D-50722 Koblenz Germany Fraunhofer Inst Ind Math ITWM D-67663 Kaiserslautern Germany
In this work, we consider adaptive linear programming (ALP) decoding of linear codes over prime fields, i.e., the finite fields F-p of size p where p is a prime, when used over a p-ary input memoryless channel. In par... 详细信息
来源: 评论
pseudocodewords from Bethe Permanents
Pseudocodewords from Bethe Permanents
收藏 引用
IEEE International Symposium on Information Theory (ISIT)
作者: Smarandache, Roxana Univ Notre Dame Dept Math & Elect Engn Notre Dame IN 46556 USA
It was recently conjectured that a vector with components equal to the Bethe permanent of certain submatrices of a parity-check matrix is a pseudocodeword. In this paper, we analyze some important cases for which the ... 详细信息
来源: 评论
Graphical Characterizations of Linear Programming pseudocodewords for Cycle Codes
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2013年 第9期59卷 5917-5934页
作者: Axvig, Nathan Dreher, Deanna Virginia Mil Inst Dept Appl Math Lexington VA 24450 USA Univ Nebraska Dept Math Lincoln NE 68502 USA
The performance of linear programming decoding is determined by the set of nonzero linear programming pseudocodewords. The minimum pseudoweight of this set of linear programming pseudocodewords is also generally accep... 详细信息
来源: 评论
Pseudocodeword-free criterion for codes with cycle-free Tanner graph
收藏 引用
DESIGNS CODES AND CRYPTOGRAPHY 2018年 第12期86卷 2791-2805页
作者: Kositwattanarerk, Wittawat Mahidol Univ Dept Math Fac Sci Bangkok 10400 Thailand Commiss Higher Educ Ctr Excellence Math Si Ayutthaya RD Bangkok 10400 Thailand
Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low... 详细信息
来源: 评论
On pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes
收藏 引用
IEEE TRANSACTIONS ON COMMUNICATIONS 2012年 第4期60卷 963-971页
作者: Lifshitz, Asi Be'ery, Yair Tel Aviv Univ Sch Elect Engn IL-69978 Ramat Aviv Israel
In this paper we explore the decision regions of Linear Programming (LP) decoding. We compare the decision regions of an LP decoder, a Belief Propagation (BP) decoder and the optimal Maximum Likelihood (ML) decoder. W... 详细信息
来源: 评论
Improved Penalty Functions of ADMM Penalized Decoder for LDPC Codes
收藏 引用
IEEE COMMUNICATIONS LETTERS 2017年 第2期21卷 234-237页
作者: Wang, Biao Mu, Jianjun Jiao, Xiaopeng Wang, Zhongfei Xidian Univ Sch Comp Sci & Technol Xian 710071 Peoples R China Baoji Univ Arts & Sci Sch Math & Informat Sci Baoji 721013 Peoples R China
By making the pseudocodewords more costly than codewords, the alternating direction method of multipliers (ADMM) penalized decoder can improve the error rate performances significantly for low-density parity-check (LD... 详细信息
来源: 评论