Sign Up to like & get
recommendations!
1
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
Sign Up to like & get
recommendations!
1
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
Sign Up to like & get
recommendations!
0
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
Sign Up to like & get
recommendations!
3
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