An algorithm for binary linear chance-constrained problems using IIS
Sign Up to like & getrecommendations! Published in 2019 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-018-00055-9
Abstract: We propose an algorithm based on infeasible irreducible subsystems to solve binary linear chance-constrained problems with random technology matrix. By leveraging on the problem structure we are able to generate good quality upper bounds to… read more here.
Keywords: algorithm binary; constrained problems; linear chance; chance constrained ... See more keywords
A note on the minimal binary linear code
Sign Up to like & getrecommendations! Published in 2019 at "Cryptography and Communications"
DOI: 10.1007/s12095-019-00412-3
Abstract: Due to the wide applications in communications, data storage and cryptography, linear codes have received much attention in the past decades. As a subclass of linear codes, minimal linear codes can be used to construct… read more here.
Keywords: binary linear; preferred binary; codes min; linear codes ... See more keywords
Designing quantum circuits for decoding binary linear codes
Sign Up to like & getrecommendations! Published in 2024 at "Journal of Physics A: Mathematical and Theoretical"
DOI: 10.1088/1751-8121/ad955d
Abstract: In the coding theory, it is one of the most important research problems to find an efficient algorithm for the decoding process. A quantum computer is an innovative computing device that performs calculations using the… read more here.
Keywords: binary linear; quantum circuits; linear codes; decoding binary ... See more keywords
Decoding Binary Linear Codes Using Penalty Dual Decomposition Method
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2019.2911277
Abstract: In this letter, we utilize the penalty dual decomposition (PDD) framework and develop a novel PDD decoding algorithm for binary linear codes. Instead of relaxing the discrete constraints to continuous ones, we take an alternative… read more here.
Keywords: penalty; penalty dual; linear codes; dual decomposition ... See more keywords
Toward Universal Decoding of Binary Linear Block Codes via Enhanced Polar Transformations
Sign Up to like & getrecommendations! Published in 2025 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2025.3587044
Abstract: Binary linear block codes (BLBCs) are essential to modern communication, but their diverse structures often require tailor-made decoders, increasing complexity. This work introduces enhanced polar decoding ( $\textsf {PD}^{+}$ ), a universal soft decoding algorithm… read more here.
Keywords: binary linear; tex math; linear block; inline formula ... See more keywords
New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2023.3236660
Abstract: We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply only to linear codes. Delsarte’s LP is the weakest… read more here.
Keywords: upper bounds; linear codes; bounds rate; binary linear ... See more keywords
On the Error Coefficients of Asymptotic Frame Error Rate Optimal Binary Linear Codes
Sign Up to like & getrecommendations! Published in 2025 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2025.3566543
Abstract: A binary linear code is called asymptotic frame error rate (AFER)-optimal if it achieves the maximum possible value of the minimum distance while having the smallest value of the corresponding error coefficient. Over the additive… read more here.
Keywords: binary linear; linear codes; asymptotic frame; frame error ... See more keywords