View full-text article in PMC Entropy (Basel). 2020 Jan 27;22(2):149. doi: 10.3390/e22020149 Search in PMC Search in PubMed View in NLM Catalog Add to search Copyright and License information © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). PMC Copyright notice Algorithm 4 Decoding at legitimate Receiver 1 Require:Υ(1)(V), Φ(1),1:L(V), κΘ(V) and κΓ(V), and Y˜(1),1:Ln. 1: A^1n←Υ(1)(V),Φ(1),1(V),Y˜(1),1n 2: Λ^2:L(V)←A^1RΛ(n) 3:fori=1 to L−1 do 4: Ψ^i(V)←A^i[C2(n)] 5: Γ^i(V)←A^i[C1,2(n)] 6: Θ¯^i+1(V)←A^i[R1(n)],A^i[R1,2′(n)]⊕Ψ^2,i−1(V) 7: Θ^i+1(V)←Θ¯^i+1(V)⊕κΘ(V) 8: Γ¯^i+1(V)←A^i[R1,2(n)]⊕Γ^1,i−1(V),A^i[R1′(n)] 9: Γ^i+1(V)←Γ¯^i+1(V)⊕κΓ(V) 10: Π^i(V)←A^i[I(n)∩G2(n)] 11: Υ^(1),i+1′(V)←Ψ^1,i(V),Γ^2,i(V),Θ^i+1(V),Γ^i+1(V),Π^i(V),Λ^i(V) 12: A^i+1n←Υ^(1),i+1′(V),Φ(1),i+1(V),Y˜(1),i+1n 13: end for