A branch and cut algorithm for finding the minimum distance of a linear block code

Ahmet Keha; Tolga M. Duman

doi:10.1109/ISIT.2008.4594976

A branch and cut algorithm for finding the minimum distance of a linear block code

Ahmet Keha, Tolga M. Duman

Electrical, Computer, and Energy Engineering, School of (IAFSE-ECEE)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.

Original language	English (US)
Title of host publication	Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages	201-205
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2008.4594976
State	Published - Sep 29 2008
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: Jul 6 2008 → Jul 11 2008

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto, ON
Period	7/6/08 → 7/11/08

Keywords

Branch-andcut
Linear block codes
Low density parity check codes
Mixed-integer programming modeling

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2008.4594976

Cite this

A branch and cut algorithm for finding the minimum distance of a linear block code. / Keha, Ahmet; Duman, Tolga M.
Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 201-205 4594976 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Keha, A & Duman, TM 2008, A branch and cut algorithm for finding the minimum distance of a linear block code. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4594976, IEEE International Symposium on Information Theory - Proceedings, pp. 201-205, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 7/6/08. https://doi.org/10.1109/ISIT.2008.4594976

@inproceedings{484dbd03878f4658b70efdd84aca9b20,

title = "A branch and cut algorithm for finding the minimum distance of a linear block code",

abstract = "We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.",

keywords = "Branch-andcut, Linear block codes, Low density parity check codes, Mixed-integer programming modeling",

author = "Ahmet Keha and Duman, {Tolga M.}",

year = "2008",

month = sep,

day = "29",

doi = "10.1109/ISIT.2008.4594976",

language = "English (US)",

isbn = "9781424422579",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "201--205",

booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

TY - GEN

T1 - A branch and cut algorithm for finding the minimum distance of a linear block code

AU - Keha, Ahmet

AU - Duman, Tolga M.

PY - 2008/9/29

Y1 - 2008/9/29

N2 - We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.

AB - We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and study the convex hull of the single constraint relaxation of these IP models. We use the new inequalities as cuts in a branch-and-cut scheme. Finally, we report computational results based on low density parity check (LDPC) codes that demonstrate the effectiveness of our cuts.

KW - Branch-andcut

KW - Linear block codes

KW - Low density parity check codes

KW - Mixed-integer programming modeling

UR - http://www.scopus.com/inward/record.url?scp=52349124406&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349124406&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4594976

DO - 10.1109/ISIT.2008.4594976

M3 - Conference contribution

AN - SCOPUS:52349124406

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 201

EP - 205

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

A branch and cut algorithm for finding the minimum distance of a linear block code

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this