Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes

In recent years, several integer programming (IP) approaches were developed for maximum-likelihood decoding and minimum distance computation for binary linear codes. Two aspects in particular have been demonstrated to improve the performance of IP solvers as well as adaptive linear programming decod...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 24; no. 10; pp. 2096 - 2099
Main Authors:	Puchert, Christian, Tillmann, Andreas M.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Binary codes Binary system Codes Computational complexity Computational modeling Decoders Hamming weight Indexes integer linear programming Integer programming IP networks Linear codes Linear programming Maximum likelihood decoding Optimization Parity Parity check codes Separation Solvers
ISSN:	1089-7798, 1558-2558
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!