An Efficient Strategy to Count Cycles in the Tanner Graph of Quasi-Cyclic LDPC Codes-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An Efficient Strategy to Count Cycles in the Tanner Graph of Quasi-Cyclic LDPC Codes

Published:2023 Issue: Volume:4 Page:499-513
ISSN:2641-8770
Container-title:IEEE Journal on Selected Areas in Information Theory
language:
Short-container-title:IEEE J. Sel. Areas Inf. Theory

Author:

Gómez-Fonseca Anthony¹^ORCID,Smarandache Roxana²^ORCID,Mitchell David G. M.³^ORCID

Affiliation:

1. Department of Mathematics, University of Notre Dame, Notre Dame, IN, USA

2. Department of Mathematics and the Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA

3. Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA

Funder

National Science Foundation

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

General Medicine

Link

https://ieeexplore.ieee.org/ielam/8700143/10153947/10251427-aam.pdf

Reference34 articles.

1. Enumeration of the Elementary Circuits of a Directed Graph

2. The Parameterized Complexity of Counting Problems

3. Message-Passing Algorithms for Counting Short Cycles in a Graph

4. Finding All the Elementary Circuits of a Directed Graph

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cycle-Detection Based Decimation Policies for Lossy Source Encoding;ICC 2024 - IEEE International Conference on Communications;2024-06-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP