IET International Conference on Wireless Mobile and Multimedia Networks Proceedings (ICWMMN 2006), 2006
ABSTRACT While in wired access networks meeting packet error requirements requested by the applic... more ABSTRACT While in wired access networks meeting packet error requirements requested by the applications are simplified by the stability of the channel conditions, in the case of wireless networks, this is not the case. Especially for real-time applications using User Datagram Protocols (UDP) for fast, unordered and unacknowledged delivery of packets, reliability is greatly compromised. Low Density Parity Check (LDPC) codes are especially suitable for wireless applications as they exhibit near-capacity performance. In this paper we demonstrate a generalized LDPC design, which covers a large family of LDPC codes. The new generalized LDPC codes are defined by a small number of parameters. The proposed LDPC codes cover a large set of code lengths and rates, which can be used for transmission of different types of data over wireless channels. Furthermore performance of these codes, under iterative decoding algorithm, compares well with other well-structured LDPC codes such as BIBD and array LDPC codes as well as pseudo-random LDPC codes.
This paper introduces a new decoding algorithm for general linear block codes. The algorithm gene... more This paper introduces a new decoding algorithm for general linear block codes. The algorithm generates a direct estimate of the error locations based on exploiting the statistical information embedded in the classical syndrome decoding. The algorithm can be used to cryptanalyze many algebraic-code public-key crypto and identification systems. In particular results show that the McEliece public-key cryptosystem with its original parameters is not secure.
IET International Conference on Wireless Mobile and Multimedia Networks Proceedings (ICWMMN 2006), 2006
ABSTRACT While in wired access networks meeting packet error requirements requested by the applic... more ABSTRACT While in wired access networks meeting packet error requirements requested by the applications are simplified by the stability of the channel conditions, in the case of wireless networks, this is not the case. Especially for real-time applications using User Datagram Protocols (UDP) for fast, unordered and unacknowledged delivery of packets, reliability is greatly compromised. Low Density Parity Check (LDPC) codes are especially suitable for wireless applications as they exhibit near-capacity performance. In this paper we demonstrate a generalized LDPC design, which covers a large family of LDPC codes. The new generalized LDPC codes are defined by a small number of parameters. The proposed LDPC codes cover a large set of code lengths and rates, which can be used for transmission of different types of data over wireless channels. Furthermore performance of these codes, under iterative decoding algorithm, compares well with other well-structured LDPC codes such as BIBD and array LDPC codes as well as pseudo-random LDPC codes.
This paper introduces a new decoding algorithm for general linear block codes. The algorithm gene... more This paper introduces a new decoding algorithm for general linear block codes. The algorithm generates a direct estimate of the error locations based on exploiting the statistical information embedded in the classical syndrome decoding. The algorithm can be used to cryptanalyze many algebraic-code public-key crypto and identification systems. In particular results show that the McEliece public-key cryptosystem with its original parameters is not secure.
Uploads
Papers by B. Honary