A Linear Programming Bound for Codes in a 2-Access Binary Erasure Channel

Adaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e92.a.2418 ◽

2009 ◽

Vol E92-A (10) ◽

pp. 2418-2430 ◽

Cited By ~ 1

Author(s):

Gou HOSOYA ◽

Hideki YAGI ◽

Manabu KOBAYASHI ◽

Shigeichi HIRASAWA

Keyword(s):

Low Density ◽

Parity Check ◽

Decoding Algorithms ◽

Low Density Parity Check ◽

Erasure Channel ◽

Adaptive Decoding ◽

Binary Erasure Channel ◽

Parity Check Codes

Download Full-text

Sharpening the linear programming bound for linear Lee codes

Electronics Letters ◽

10.1049/el.2014.4300 ◽

2015 ◽

Vol 51 (6) ◽

pp. 492-494 ◽

Cited By ~ 2

Author(s):

H. Astola ◽

I. Tabus

Keyword(s):

Linear Programming ◽

Linear Programming Bound

Download Full-text

Optimal rate for irregular LDPC codes in binary erasure channel

2011 IEEE Information Theory Workshop ◽

10.1109/itw.2011.6089360 ◽

2011 ◽

Cited By ~ 5

Author(s):

H. Tavakoli ◽

M. Ahmadian Attari ◽

M. Reza Peyghami

Keyword(s):

Ldpc Codes ◽

Optimal Rate ◽

Irregular Ldpc Codes ◽

Erasure Channel ◽

Binary Erasure Channel

Download Full-text

Optimal regular LDPC codes for the binary erasure channel

IEEE Communications Letters ◽

10.1109/lcomm.2005.1437366 ◽

2005 ◽

Vol 9 (6) ◽

pp. 546-548 ◽

Cited By ~ 2

Author(s):

M. Rashidpour ◽

A. Shokrollahi ◽

S.H. Jamali

Keyword(s):

Ldpc Codes ◽

Erasure Channel ◽

Binary Erasure Channel

Download Full-text

Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates

IEEE Transactions on Information Theory ◽

10.1109/tit.2017.2689783 ◽

2017 ◽

Vol 63 (7) ◽

pp. 4357-4378 ◽

Cited By ~ 9

Author(s):

Christian Hager ◽

Henry D. Pfister ◽

Alexandre Graell i Amat ◽

Fredrik Brannstrom

Keyword(s):

Density Evolution ◽

Product Codes ◽

Erasure Channel ◽

Binary Erasure Channel

Download Full-text

Low Decoding Complexity of LDPC Codes Over the Binary Erasure Channel

Electrical Engineering (ICEE), Iranian Conference on ◽

10.1109/icee.2018.8472553 ◽

2018 ◽

Author(s):

Sareh Majidi Ivari ◽

M. Reza Soleymani ◽

Yousef R. Shayan

Keyword(s):

Ldpc Codes ◽

Decoding Complexity ◽

Erasure Channel ◽

Binary Erasure Channel

Download Full-text

Erasure channel modelling–based secure bit allocation schemes for multipath routing in wireless sensor networks

International Journal of Distributed Sensor Networks ◽

10.1177/1550147716683605 ◽

2016 ◽

Vol 12 (12) ◽

pp. 155014771668360

Author(s):

Zhenhua Yuan ◽

Chen Chen ◽

Ye Jin

Keyword(s):

Energy Efficiency ◽

Channel Model ◽

Multipath Routing ◽

Optimal Solution ◽

Wireless Channel ◽

Bit Allocation ◽

Wireless Sensor ◽

Routing Scheme ◽

Erasure Channel ◽

Binary Erasure Channel

In this article, we study secure multipath routing with energy efficiency for a wireless sensor network in the presence of eavesdroppers. We consider two objectives: (1) the multipath routing scheme for maximising the energy efficiency with security constraints and (2) the multipath routing scheme for maximising the secrecy capacity. The binary erasure channel model is adopted to describe the wireless channel states among neighbouring nodes. Based on the binary erasure channel model, the problem of multipath routing degrades to a problem of bit allocation for each path. We formulate the problems and find that the problems are both quasi-convex. For the first one, it is a linear fractional optimisation problem. The optimal solution is obtained by the Charnes–Cooper transformation. For the second one, we propose an iterative algorithm to obtain the [Formula: see text]-optimal solution. The performance analysis shows that the probability of the secure bit allocation increases along with the number of multipaths and decreases along with the number of hops per path and eavesdroppers. Simulation results are presented to illustrate the proposed algorithms.

Download Full-text