渗漏 发表于 2025-3-21 17:52:05

书目名称Communications, Information and Network Security影响因子(影响力)<br>        http://impactfactor.cn/if/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security影响因子(影响力)学科排名<br>        http://impactfactor.cn/ifr/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security网络公开度<br>        http://impactfactor.cn/at/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security网络公开度学科排名<br>        http://impactfactor.cn/atr/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security被引频次<br>        http://impactfactor.cn/tc/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security被引频次学科排名<br>        http://impactfactor.cn/tcr/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security年度引用<br>        http://impactfactor.cn/ii/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security年度引用学科排名<br>        http://impactfactor.cn/iir/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security读者反馈<br>        http://impactfactor.cn/5y/?ISSN=BK0230542<br><br>        <br><br>书目名称Communications, Information and Network Security读者反馈学科排名<br>        http://impactfactor.cn/5yr/?ISSN=BK0230542<br><br>        <br><br>

obeisance 发表于 2025-3-21 22:14:09

Geometric Constructions of Gallager Codes, cyclic structural properties of the lines in finite analytic geometries. Two large classes of Gallager codes of various lengths, rates, and minimum distances are constructed. Codes of these two classes do not contain cycles of length 4 in their Tanner graphs and they perform well with iterative decoding.

凝视 发表于 2025-3-22 03:42:48

http://reply.papertrans.cn/24/2306/230542/230542_3.png

IRS 发表于 2025-3-22 06:22:59

978-1-4419-5318-6Springer-Verlag US 2003

DAMP 发表于 2025-3-22 09:51:42

http://reply.papertrans.cn/24/2306/230542/230542_5.png

mighty 发表于 2025-3-22 14:28:08

David Ginley,Kamanio Chattopadhyays quasi-cyclic by construction and hence admits a convolutional representation. A set of low density parity check convolutional codes is derived from this quasi-cyclic code and its generalizations. The performance of these convolutional codes is investigated when decoded using belief propagation on their corresponding graph representations.

mighty 发表于 2025-3-22 19:00:49

http://reply.papertrans.cn/24/2306/230542/230542_7.png

conservative 发表于 2025-3-23 00:17:02

http://reply.papertrans.cn/24/2306/230542/230542_8.png

Type-1-Diabetes 发表于 2025-3-23 04:54:42

http://reply.papertrans.cn/24/2306/230542/230542_9.png

FAR 发表于 2025-3-23 09:20:06

The Springer International Series in Engineering and Computer Sciencehttp://image.papertrans.cn/c/image/230542.jpg
页: [1] 2 3 4 5 6
查看完整版本: Titlebook: Communications, Information and Network Security; Vijay K. Bhargava,H. Vincent Poor,Seokho Yoon Book 2003 Springer-Verlag US 2003 Modulati