A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems-Reference-Cited by-同舟云学术

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

A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems

Published:2019-12-06 Issue:2 Volume:75 Page:137-157
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks.

Author:

Kabakulak Banu¹^ORCID,Taşkin Z. Caner¹,Pusane Ali E.²

Affiliation:

1. Department of Industrial EngineeringBoğaziçi University Istanbul Turkey

2. Department of Electrical and Electronics EngineeringBoğaziçi University Istanbul Turkey

Funder

Boğaziçi Üniversitesi

Türkiye Bilimsel ve Teknolojik Araştirma Kurumu

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.21914

Reference33 articles.

1. Families of small regular graphs of girth 5

2. Constructions of small regular bipartite graphs of girth 6;Araujo‐Pardo G.;Networks,2010

3. On Girth Conditioning for Low-Density Parity-Check Codes

4. I.E.Bocharova R.Johannesson andB.D.Kudryashov A unified approach to optimization of LDPC codes for various communication scenarios 2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) 2014 pp. 243–248.

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

1. A Comparative Review of Recent Advances in Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes and Their Applications;Archives of Computational Methods in Engineering;2020-07-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP