A branch-cut-and-price algorithm for optimal decoding in digital communication systems

Channel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 81; no. 3; pp. 805 - 834
Main Authors:	Kabakulak, Banu, Taşkın, Z. Caner, Pusane, Ali Emre
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2021 Springer Springer Nature B.V
Subjects:	Algorithms Codes Communications systems Computer Science Decoding Error correcting codes Heuristic Integer programming Iterative methods Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Performance enhancement Real Functions Integer programming LDPC decoding Telecommunications Branch-cut-and-price algorithm
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Channel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorithms are used to decode the received vector. However, these algorithms may fail to decode if the received vector contains multiple errors. We consider decoding the received vector with minimum error as an integer programming (IP) problem and propose a branch-and-price method for its solution. We improve the performance of our method by introducing heuristic feasible solutions and adding valid cuts to the mathematical formulation. Our computational experiments reveal that our branch-cut-and-price algorithm significantly improves solvability of the problem compared to a state-of-the-art IP decoder in the literature and has superior error performance than the conventional sum-product algorithm.
AbstractList	Channel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorithms are used to decode the received vector. However, these algorithms may fail to decode if the received vector contains multiple errors. We consider decoding the received vector with minimum error as an integer programming (IP) problem and propose a branch-and-price method for its solution. We improve the performance of our method by introducing heuristic feasible solutions and adding valid cuts to the mathematical formulation. Our computational experiments reveal that our branch-cut-and-price algorithm significantly improves solvability of the problem compared to a state-of-the-art IP decoder in the literature and has superior error performance than the conventional sum-product algorithm.
Audience	Academic
Author	Pusane, Ali Emre Kabakulak, Banu Taşkın, Z. Caner
Author_xml	– sequence: 1 givenname: Banu orcidid: 0000-0001-8613-3266 surname: Kabakulak fullname: Kabakulak, Banu email: banu.kabakulak@bilgi.edu.tr organization: Department of Industrial Engineering, Istanbul Bilgi University – sequence: 2 givenname: Z. Caner surname: Taşkın fullname: Taşkın, Z. Caner organization: Department of Industrial Engineering, Boğaziçi University – sequence: 3 givenname: Ali Emre surname: Pusane fullname: Pusane, Ali Emre organization: Department of Electrical and Electronics Engineering, Boğaziçi University
BookMark	eNp9kE9rHCEYh6Uk0E2aL5DTQM8mrzru6HFZ2iaw0EvSqxj_TAwzulH3sN--biZQ6GHxoPx4H3-8zxW6iCk6hG4J3BGA4b4QEFJgoAQDgYHh_gtaEd4eVJL1BVqBpBxzAPIVXZXyBgBScLpCfzbdS9bRvGJzqFhHi_c5GNfpaUw51Ne58yl3aV_DrKfOOpNsiGMXYmfDGGrLTJrnQwxG15BiV46lurl8Q5deT8XdfN7X6Pnnj6ftA979_vW43eywYVxU3PfemX4trbCUCieYEY5Zp6WDwWv5YskgPNOEMtEyz80ARhPpuATRey7ZNfq-_LvP6f3gSlVv6ZBjq1SUCyokJZy1qbtlatSTUyH6VLM27Vg3B9NM-tDyzUAEkwOsTwBdAJNTKdl51azMOh8VAXUSrhbhqglXH8JV3yDxH2SaoJOV1ham8yhb0NJ64ujyvzXOUH8BW7CXZw
CitedBy_id	crossref_primary_10_1137_21M142770X
Cites_doi	10.1109/JSAC.2006.879405 10.1287/opre.2013.1235 10.1109/TIT.2013.2281372 10.1002/ett.1184 10.1109/LCOMM.2008.080017 10.1109/26.768759 10.1109/TIT.2008.917682 10.1109/18.910572 10.1109/TIT.2009.2030477 10.1109/TIT.1978.1055873 10.1109/TIT.2010.2048489 10.1109/TIT.2012.2204955 10.1287/opre.1050.0234 10.1049/el:19970362 10.1109/TIT.2007.915712 10.1109/TIT.1962.1057683 10.1109/18.748992 10.1109/18.910577 10.1109/TIT.1981.1056404 10.1002/0471739219 10.1109/TIT.2004.842696 10.1002/9780470400531.eorms0158 10.1137/1.9780898717891.ch1 10.23919/ICACT.2017.7890139 10.1109/PIMRC.2014.7136286 10.1109/GLOCOM.2001.965575 10.1109/ISIT.2013.6620477
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 COPYRIGHT 2021 Springer The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 – notice: COPYRIGHT 2021 Springer – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2O M2P M7S MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U
DOI	10.1007/s10898-021-01073-4
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Research Library Science Database (ProQuest) Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ProQuest Research Library Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Mathematics Sciences (General) Computer Science
EISSN	1573-2916
EndPage	834
ExternalDocumentID	A718397063 10_1007_s10898_021_01073_4
GrantInformation_xml	– fundername: Türkiye Bilimsel ve Teknolojik Arastirma Kurumu grantid: 113M499 funderid: http://dx.doi.org/10.13039/501100004410
GroupedDBID	-52 -57 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29K 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 88I 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2O M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCLPG SDD SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8T Z8U Z8W Z92 ZMTXR ZWQNP ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c358t-44fec469d8d228e83c8e3dea9e07fa9bd178f3a1238a9ef5c70ca19e59084f593
IEDL.DBID	M2P
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000695785000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0925-5001
IngestDate	Tue Nov 04 23:18:00 EST 2025 Sat Nov 29 10:09:43 EST 2025 Sat Nov 29 01:59:36 EST 2025 Tue Nov 18 21:53:45 EST 2025 Fri Feb 21 02:47:36 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Integer programming LDPC decoding Telecommunications Branch-cut-and-price algorithm
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c358t-44fec469d8d228e83c8e3dea9e07fa9bd178f3a1238a9ef5c70ca19e59084f593
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-8613-3266
PQID	2582892153
PQPubID	29930
PageCount	30
ParticipantIDs	proquest_journals_2582892153 gale_infotracacademiconefile_A718397063 crossref_primary_10_1007_s10898_021_01073_4 crossref_citationtrail_10_1007_s10898_021_01073_4 springer_journals_10_1007_s10898_021_01073_4
PublicationCentury	2000
PublicationDate	20211100 2021-11-00 20211101
PublicationDateYYYYMMDD	2021-11-01
PublicationDate_xml	– month: 11 year: 2021 text: 20211100
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Dordrecht
PublicationSubtitle	An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
PublicationTitle	Journal of global optimization
PublicationTitleAbbrev	J Glob Optim
PublicationYear	2021
Publisher	Springer US Springer Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer – name: Springer Nature B.V
References	Fossorier, Mihaljevic, Imai (CR7) 1999; 47 MacKay, Neal (CR18) 1997; 33 MacKay (CR16) 1999; 45 Barman, Liu, Draper, Recht (CR2) 2013; 59 Chertkov, Stepanov (CR5) 2008; 54 CR14 CR13 CR12 Yang, Feldman, Wang (CR25) 2006; 24 Yang, Wang, Feldman (CR26) 2008; 54 Berlekamp, McEliece, Van Tilborg (CR3) 1978; 24 Kschischang, Frey, Loeliger (CR11) 2001; 47 Arikan (CR1) 2008; 12 Gallager (CR8) 1962; 8 Zhang, Siegel (CR27) 2012; 58 Feldman, Wainwright, Karger (CR6) 2005; 51 Burshtein (CR4) 2009; 55 Karger, Oh, Shah (CR10) 2014; 62 Moon (CR19) 2005 Vontobel, Koetter (CR24) 2007; 18 Richardson, Urbanke (CR20) 2001; 47 Tanner (CR23) 1981; 27 CR28 CR9 Lübbecke, Desrosiers (CR15) 2005; 53 Tanatmis, Ruzika, Hamacher, Punekar, Kienle, Wehn (CR22) 2010; 56 CR21 MacKay (CR17) 2003 J Feldman (1073_CR6) 2005; 51 PO Vontobel (1073_CR24) 2007; 18 TJ Richardson (1073_CR20) 2001; 47 DJ MacKay (1073_CR17) 2003 X Zhang (1073_CR27) 2012; 58 1073_CR28 ME Lübbecke (1073_CR15) 2005; 53 TK Moon (1073_CR19) 2005 1073_CR21 K Yang (1073_CR26) 2008; 54 R Gallager (1073_CR8) 1962; 8 DR Karger (1073_CR10) 2014; 62 D Burshtein (1073_CR4) 2009; 55 DJ MacKay (1073_CR16) 1999; 45 E Berlekamp (1073_CR3) 1978; 24 E Arikan (1073_CR1) 2008; 12 DJ MacKay (1073_CR18) 1997; 33 A Tanatmis (1073_CR22) 2010; 56 FR Kschischang (1073_CR11) 2001; 47 MP Fossorier (1073_CR7) 1999; 47 R Tanner (1073_CR23) 1981; 27 M Chertkov (1073_CR5) 2008; 54 1073_CR9 1073_CR13 K Yang (1073_CR25) 2006; 24 S Barman (1073_CR2) 2013; 59 1073_CR12 1073_CR14
References_xml	– volume: 24 start-page: 1603 issue: 8 year: 2006 end-page: 1613 ident: CR25 article-title: Nonlinear programming approaches to decoding low-density parity-check codes publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/JSAC.2006.879405 – volume: 62 start-page: 1 issue: 1 year: 2014 end-page: 24 ident: CR10 article-title: Budget-optimal task allocation for reliable crowdsourcing systems publication-title: Oper. Res. doi: 10.1287/opre.2013.1235 – volume: 59 start-page: 7870 issue: 12 year: 2013 end-page: 7886 ident: CR2 article-title: Decomposition methods for large scale LP decoding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2013.2281372 – volume: 18 start-page: 509 issue: 5 year: 2007 end-page: 517 ident: CR24 article-title: On low-complexity linear-programming decoding of LDPC codes publication-title: Eur. Trans. Telecommun. doi: 10.1002/ett.1184 – ident: CR14 – ident: CR12 – volume: 12 start-page: 447 issue: 6 year: 2008 end-page: 449 ident: CR1 article-title: A performance comparison of polar codes and reed-Muller codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2008.080017 – volume: 47 start-page: 673 issue: 5 year: 1999 end-page: 680 ident: CR7 article-title: Reduced complexity iterative decoding of low-density parity check codes based on belief propagation publication-title: IEEE Trans. Commun. doi: 10.1109/26.768759 – volume: 54 start-page: 1514 issue: 4 year: 2008 end-page: 1520 ident: CR5 article-title: An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2008.917682 – volume: 47 start-page: 498 issue: 2 year: 2001 end-page: 519 ident: CR11 article-title: Factor graphs and the sum-product algorithm publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.910572 – volume: 55 start-page: 4835 issue: 11 year: 2009 end-page: 4859 ident: CR4 article-title: Iterative approximate linear programming decoding of LDPC codes with linear complexity publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2009.2030477 – volume: 24 start-page: 384 issue: 3 year: 1978 end-page: 386 ident: CR3 article-title: On the inherent intractability of certain coding problems publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1978.1055873 – volume: 56 start-page: 3277 issue: 7 year: 2010 end-page: 3289 ident: CR22 article-title: A separation algorithm for improved LP-decoding of linear block codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2010.2048489 – ident: CR21 – volume: 58 start-page: 6581 issue: 10 year: 2012 end-page: 6594 ident: CR27 article-title: Adaptive cut generation algorithm for improved linear programming decoding of binary linear codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2012.2204955 – year: 2003 ident: CR17 publication-title: Information Theory, Inference and Learning Algorithms – volume: 53 start-page: 1007 issue: 6 year: 2005 end-page: 1023 ident: CR15 article-title: Selected topics in column generation publication-title: Oper. Res. doi: 10.1287/opre.1050.0234 – ident: CR13 – volume: 33 start-page: 457 issue: 6 year: 1997 end-page: 458 ident: CR18 article-title: Near Shannon limit performance of low density parity check codes publication-title: Electron. Lett. doi: 10.1049/el:19970362 – ident: CR9 – volume: 54 start-page: 1061 issue: 3 year: 2008 end-page: 1072 ident: CR26 article-title: A new linear programming approach to decoding linear block codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2007.915712 – volume: 8 start-page: 21 issue: 1 year: 1962 end-page: 28 ident: CR8 article-title: Low-density parity-check codes publication-title: IRE Trans. Inf. Theory doi: 10.1109/TIT.1962.1057683 – volume: 45 start-page: 399 issue: 2 year: 1999 end-page: 431 ident: CR16 article-title: Good error-correcting codes based on very sparse matrices publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.748992 – volume: 47 start-page: 599 issue: 2 year: 2001 end-page: 618 ident: CR20 article-title: The capacity of low-density parity-check codes under message-passing decoding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.910577 – volume: 27 start-page: 533 issue: 5 year: 1981 end-page: 547 ident: CR23 article-title: A recursive approach to low complexity codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1981.1056404 – year: 2005 ident: CR19 publication-title: Error Correction Coding: Mathematical Methods and Algorithms doi: 10.1002/0471739219 – ident: CR28 – volume: 51 start-page: 954 issue: 3 year: 2005 end-page: 972 ident: CR6 article-title: Using linear programming to decode binary linear codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2004.842696 – volume: 45 start-page: 399 issue: 2 year: 1999 ident: 1073_CR16 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.748992 – volume: 33 start-page: 457 issue: 6 year: 1997 ident: 1073_CR18 publication-title: Electron. Lett. doi: 10.1049/el:19970362 – volume: 47 start-page: 599 issue: 2 year: 2001 ident: 1073_CR20 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.910577 – volume: 27 start-page: 533 issue: 5 year: 1981 ident: 1073_CR23 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1981.1056404 – ident: 1073_CR14 doi: 10.1002/9780470400531.eorms0158 – volume: 54 start-page: 1061 issue: 3 year: 2008 ident: 1073_CR26 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2007.915712 – volume: 51 start-page: 954 issue: 3 year: 2005 ident: 1073_CR6 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2004.842696 – volume: 8 start-page: 21 issue: 1 year: 1962 ident: 1073_CR8 publication-title: IRE Trans. Inf. Theory doi: 10.1109/TIT.1962.1057683 – volume: 62 start-page: 1 issue: 1 year: 2014 ident: 1073_CR10 publication-title: Oper. Res. doi: 10.1287/opre.2013.1235 – ident: 1073_CR13 doi: 10.1137/1.9780898717891.ch1 – ident: 1073_CR12 doi: 10.23919/ICACT.2017.7890139 – volume: 55 start-page: 4835 issue: 11 year: 2009 ident: 1073_CR4 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2009.2030477 – volume: 47 start-page: 673 issue: 5 year: 1999 ident: 1073_CR7 publication-title: IEEE Trans. Commun. doi: 10.1109/26.768759 – ident: 1073_CR21 doi: 10.1109/PIMRC.2014.7136286 – volume: 58 start-page: 6581 issue: 10 year: 2012 ident: 1073_CR27 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2012.2204955 – ident: 1073_CR9 doi: 10.1109/GLOCOM.2001.965575 – ident: 1073_CR28 doi: 10.1109/ISIT.2013.6620477 – volume: 47 start-page: 498 issue: 2 year: 2001 ident: 1073_CR11 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.910572 – volume: 56 start-page: 3277 issue: 7 year: 2010 ident: 1073_CR22 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2010.2048489 – volume: 24 start-page: 1603 issue: 8 year: 2006 ident: 1073_CR25 publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/JSAC.2006.879405 – volume: 54 start-page: 1514 issue: 4 year: 2008 ident: 1073_CR5 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2008.917682 – volume: 53 start-page: 1007 issue: 6 year: 2005 ident: 1073_CR15 publication-title: Oper. Res. doi: 10.1287/opre.1050.0234 – volume: 59 start-page: 7870 issue: 12 year: 2013 ident: 1073_CR2 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2013.2281372 – volume: 18 start-page: 509 issue: 5 year: 2007 ident: 1073_CR24 publication-title: Eur. Trans. Telecommun. doi: 10.1002/ett.1184 – volume-title: Error Correction Coding: Mathematical Methods and Algorithms year: 2005 ident: 1073_CR19 doi: 10.1002/0471739219 – volume: 24 start-page: 384 issue: 3 year: 1978 ident: 1073_CR3 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1978.1055873 – volume: 12 start-page: 447 issue: 6 year: 2008 ident: 1073_CR1 publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2008.080017 – volume-title: Information Theory, Inference and Learning Algorithms year: 2003 ident: 1073_CR17
SSID	ssj0009852
Score	2.3064861
Snippet	Channel coding aims to minimize the errors that occur during the transmission of digital information from one place to another. Low-density parity-check codes...
SourceID	proquest gale crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	805
SubjectTerms	Algorithms Codes Communications systems Computer Science Decoding Error correcting codes Heuristic Integer programming Iterative methods Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Performance enhancement Real Functions
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFH_i67AdBnRDdGPIByQ2bZYaJ6ntYzUN7QAIAUPcLNd2SiWaVk3Y37_3Uod27EMaRyeObdnvU877_QCOCqG9dD3J_TDJOFpJjSqlEh687VuZ2n5WNKwlp_L8XN3e6otYFFa1f7u3V5KNpV4pdlNUDiYo_UXB5Nk6bKK7U0TYcHl1s4TaVQ3PTk-LnOdohWOpzJ_H-MUdPTXKv92ONk7nZPt5y92BVzHIZIOFVOzCWig7sN0SOLCozx14uYJGiK2zRwjXqgO7sVfFPkRo6o-v4WbAhsTEccfdQ81t6fmMQImYvR9N5-P6bsIwBmZTNEMTnN9jakuukY1L5scjoidhbrUghS1wpKs38P3k6_WXbzwyM3CX5qrmWVYEh4m1V14IFVTqVEh9sDr0ZGH10CdSFalFr6jwWZE72XM20YEI1vHwdboHG-W0DPvAqNXPtXWYEWfBpxbzR-EyOUyE00rlXUjaAzIuwpYTe8a9WQIu004b3GnT7LTJuvDp8ZvZArTjn72P6dwNaTSO7GwsTMD1ETaWGUiKIiXGcl04aEXDRFWvjKCLR42RE77-3IrC8vXf5337f93fwQtB0tTUQR7ARj1_CO9hy_2ox9X8sFGBny7w_ZM priority: 102 providerName: Springer Nature
Title	A branch-cut-and-price algorithm for optimal decoding in digital communication systems
URI	https://link.springer.com/article/10.1007/s10898-021-01073-4 https://www.proquest.com/docview/2582892153
Volume	81
WOSCitedRecordID	wos000695785000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-2916 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009852 issn: 0925-5001 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NTxQxFH8R8KAHBdS4CqQHEzXaONOZ2bYnsxCIibJOQBG5NN22A5vA7MoM_v2-N9tlUSMXLy_pfHSavPZ9tPN-P4AXldBeukRyP0pzjlZS45JSKQ_e9q3MbD-vOtaST3I4VMfHuowbbk38rXJuEztD7SeO9sjfCTrf0eigsvfTH5xYo-h0NVJoLMEKRjYp_dK1L8oF6K7qGHcSLQpeoD2ORTOxdE5RcZmgZBqnOc9_c0x_mue_zkk797P38H8HvgoPYuDJBrOZsgZ3Qr0O92_AEa7DWlzoDXsV0ahfP4KjARsR-cYZd1ctt7XnU8IhYvb8FL_Snl0wDHvZBC3PBXbvMZslb8jGNfPjU2IkYe5mDQqbQUc3j-Hr3u6XnQ88kjFwlxWq5XleBYe5tFdeCBVU5lTIfLA6JLKyeuRTqarMoiNUeK0qnEycTXUgTnXUt86ewHI9qcNTYNTqF9o6TILz4DOLKaNwuRylwmmlih6kc00YF5HKiTDj3Cwwlkl7BrVnOu2ZvAdvrt-ZznA6bn36JSnY0CLGnp2NtQg4PoLDMgNJgaPE8K0HG3Otmri6G7NQaQ_ezufF4va_v_vs9t6ewz1BM7IrddyA5fbyKmzCXfezHTeXW7Akv33fgpXt3WF5gK2PkqPcT3ZIis-dLEnKQ5RlcYLy4PDoF5vfBSc
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Bb9MwFH6aBhJwADZAFAb4AAIEFo3j1PYBoQqYNq1UOwy0m3FtZ6u0pWXJQPwpfiPvpQ4dIHbbgWOa1E2a733PL877PoDHpTBB-b7iYZJJjixpMKR0xmNwA6dyN5Bl61oyUuOx3t83uyvwo-uFodcqO05siTrMPD0jfyVofcdggsrfzL9wco2i1dXOQmMBi534_RuWbPXr7Xd4f58Isfl-7-0WT64C3OeFbriUZfRYFAYdhNBR517HPERnYl-VzkxCpnSZO2R0jZ-VhVd97zITyRwcT5zEl5DyL0lSFqNXBcXuUuRXtw4_fSMKXiD_pyad1KqnqZlNUPGOYcXlb4nwz3Tw17psm-42b_xvf9RNuJ4m1my4iIQ1WInVOlw7I7e4DmuJyGr2LKltP78Fn4ZsQuYih9yfNtxVgc9JZ4m5owO8qubwmOG0ns2QWY9x-IDVOmV7Nq1YmB6Q4wrzZ3ts2EIau74NHy_kau_AajWr4l1gtDUojPNY5MsYcoclsfBSTTLhjdZFD7LuzluflNjJEOTILjWkCS0W0WJbtFjZgxe_vjNf6JCce_RTApQlksKRvUu9Fnh-JPdlh4omxgqnpz3Y6FBkE3vVdgmhHrzscLjc_e_fvXf-aI_gytbeh5EdbY937sNVQdHQtnVuwGpzchofwGX_tZnWJw_buGLw-aLx-RM_RVsG
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Rb9MwED5NG0LwMNgA0W2AH0CAwFrjJLX9gFDFqJg2VX0ANPFiXNvZKm1pWbJN_DV-HXepQweIve2BxzSNGzfffXcX-74DeFoI7aXrSu7HScaRJTWalEp48LZnZWp7WdF0LdmXw6E6ONCjJfjR1sLQtsqWExui9lNH78i3Ba3vaHRQ6XYRt0WMdgZvZ984dZCilda2ncYcInvh-wWmb9Wb3R181s-EGLz_-O4Djx0GuEtzVfMsK4LDBNErL4QKKnUqpD5YHbqysHrsE6mK1CK7K_ysyJ3sOpvoQI3CcRIkxIT0vyJxCNpOOMq_LAR_VdPtp6tFznP0BbFgJ5btKSpsE5TIo4nx7Den-Kdr-GuNtnF9gzv_8592F1ZjwM36cwtZg6VQrsPtSzKM67AWCa5iL6IK98t78LnPxtR05Ii7s5rb0vMZ6S8xe3yIs6qPThiG-2yKjHuCw3vM4ikKYJOS-ckhdWJh7nLtDZtLZlf34dO1zPYBLJfTMjwERke9XFuHyX8WfGoxVRYuk-NEOK1U3oGkRYFxUaGdGoUcm4W2NCHHIHJMgxyTdeDVr2tmc32SK7_9nMBliLxwZGdjDQbeH8mAmb6kgFli2NqBrRZRJrJaZRZw6sDrFpOL0__-3Y2rR3sCNxGWZn93uLcJtwQZRlPtuQXL9elZeAQ33Hk9qU4fNybG4Ot1w_Mn6yFj8g
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+branch-cut-and-price+algorithm+for+optimal+decoding+in+digital+communication+systems&rft.jtitle=Journal+of+global+optimization&rft.au=Kabakulak+Banu&rft.au=Caner%2C+Ta%C5%9Fk%C4%B1n+Z&rft.au=Pusane%2C+Ali+Emre&rft.date=2021-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=81&rft.issue=3&rft.spage=805&rft.epage=834&rft_id=info:doi/10.1007%2Fs10898-021-01073-4&rft.externalDBID=HAS_PDF_LINK
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon