Asymptotically Tight MLD Bounds and Minimum-Variance Importance Sampling Estimator for Linear Block Codes Over BSCs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Access"
DOI: 10.1109/access.2022.3183203
Abstract: In this paper, we re-examine the classical problem of efficiently evaluating the block and bit error rate performance of linear block codes over binary symmetric channels (BSCs). In communication systems, the maximum likelihood decoding (MLD)… read more here.
Keywords: mld bounds; linear block; asymptotically tight; block codes ... See more keywords
An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane
Sign Up to like & getrecommendations! Published in 2021 at "Symmetry"
DOI: 10.3390/sym13061050
Abstract: Let P be a set of n≥3 points in general position in the plane. The edge disjointness graph D(P) of P is the graph whose vertices are the n2 closed straight line segments with endpoints… read more here.
Keywords: disjointness graph; connectivity; graph; upper bound ... See more keywords