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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE communications letters Ročník 24; číslo 10; s. 2096 - 2099
Hlavní autori:	Puchert, Christian, Tillmann, Andreas M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!