Efficient secure channel coding based on quasi-cyclic low-density parity-check codes

DOI10.1049/IET-COM:20080050zbMath1273.94334OpenAlexW2048863650MaRDI QIDQ2853132

T. Eghlidos, A. A. Sobhi Afshar, Mohammad Reza Aref

Publication date: 18 October 2013

Published in: IET Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1049/iet-com:20080050

Mathematics Subject Classification ID

Cryptography (94A60) Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)

Related Items (2)

Amount of key information contained in plain and encrypted text sets of the symmetric randomized McEliece cryptosystem ⋮ Identifying an unknown code by partial Gaussian elimination

This page was built for publication: Efficient secure channel coding based on quasi-cyclic low-density parity-check codes